An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost

Anatoly Zhigljavsky 1 Luc Pronzato 2 Elena Bukina 2
1 Cardiff University, School of Mathematics
2 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SYSTEMES
Laboratoire I3S - SIS - Signal, Images et Systèmes
Abstract : We consider gradient algorithms for minimizing a quadratic function in R^n with large n. We suggest a particular sequence of step-lengthes and demonstrate that the resulting gradient algorithm has a convergence rate comparable with that of Conjugate Gradients and other methods based on the use of Krylov spaces. When the problem is large and sparse, the proposed algorithm can be more efficient than the Conjugate Gradient algorithm in terms of computational cost, as k iterations of the proposed algorithm only require the computation of O(log k) inner products.
Keywords : Quadratic optimization gradient algorithms conjugate gradient arcsine distribution Fibonacci numbers estimation of leading eigenvalues
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [10 references]  Display  Hide  Download
https://hal.archives-ouvertes.fr/hal-00630982
Contributor : Luc Pronzato <>
Submitted on : Tuesday, October 11, 2011 - 11:15:43 AM
Last modification on : Monday, November 5, 2018 - 3:52:02 PM
Document(s) archivé(s) le : Thursday, January 12, 2012 - 2:25:50 AM

File

Bukina-P-Z_OPTIMIZATION-HAL.pd...
Files produced by the author(s)

Identifiers

Collections

I3S | INSMI | UNICE | TDS-MACS | UNIV-COTEDAZUR

Citation

Anatoly Zhigljavsky, Luc Pronzato, Elena Bukina. An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost. Optimization Letters, Springer Verlag, 2013, 7 (6), pp.1047-1059. ⟨10.1007/s11590-012-0491-7⟩. ⟨hal-00630982⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

309

Files downloads

210

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD