Spectral Projected Gradient Methods: Review and Perspectives

Ernesto G. Birgin, Jose Mario Martínez and Marcos Raydan

Journal of Statistical Software, 2014, vol. 060, issue i03

Abstract: Over the last two decades, it has been observed that using the gradient vector as a search direction in large-scale optimization may lead to efficient algorithms. The effectiveness relies on choosing the step lengths according to novel ideas that are related to the spectrum of the underlying local Hessian rather than related to the standard decrease in the objective function. A review of these so-called spectral projected gradient methods for convex constrained optimization is presented. To illustrate the performance of these low-cost schemes, an optimization problem on the set of positive definite matrices is described.

Date: 2014-09-28
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
https://www.jstatsoft.org/index.php/jss/article/view/v060i03/v60i03.pdf
https://www.jstatsoft.org/index.php/jss/article/do ... ile/v060i03/v60i03.R

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jss:jstsof:v:060:i03

DOI: 10.18637/jss.v060.i03

Access Statistics for this article

Journal of Statistical Software is currently edited by Bettina Grün, Edzer Pebesma and Achim Zeileis

More articles in Journal of Statistical Software from Foundation for Open Access Statistics
Bibliographic data for series maintained by Christopher F. Baum ().