Gradient algorithms for quadratic optimization with fast convergence rates
| Year of publication: |
2011
|
|---|---|
| Authors: | Pronzato, Luc ; Zhigljavsky, Anatoly |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 50.2011, 3, p. 597-617
|
| Publisher: |
Springer |
| Subject: | Chebyshev polynomials | Conjugate gradient | Krylov space | Logistic map | Quadratic operator | Steepest descent |
-
GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
LI, XIA, (2005)
-
A conjugate gradient sampling method for nonsmooth optimization
Mahdavi-Amiri, N., (2020)
-
Preconditioning by approximations of the Gram matrix for convection–diffusion equations
Juncu, Gh., (1998)
- More ...
-
An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost
Zhigljavsky, Anatoly, (2013)
-
Improvements on removing nonoptimal support points in D-optimum design algorithms
Harman, Radoslav, (2007)
-
On the irregular behavior of LS estimators for asymptotically singular designs
Pázman, Andrej, (2006)
- More ...