@Article{JCM-23-3,
author = {},
title = {Preconditioned Spectral Projected Gradient Method on Convex Sets},
journal = {Journal of Computational Mathematics},
year = {2005},
volume = {23},
number = {3},
pages = {225--232},
abstract = {<p style="text-align: justify;">The spectral gradient method has proved to be effective for solving large-scale unconstrained optimization problems. It has been recently extended and combined with the projected gradient method for solving optimization problems on convex sets. This combination includes the use of nonmonotone line search techniques to preserve the fast local convergence. In this work we further extend the spectral choice of steplength to accept preconditioned directions when a good preconditioner is available. We present an algorithm that combines the spectral projected gradient method with preconditioning strategies to increase the local speed of convergence while keeping the global properties. We discuss implementation details for solving large-scale problems. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/2005-JCM-8811},
url = {https://global-sci.com/article/85145/preconditioned-spectral-projected-gradient-method-on-convex-sets}
}