Nonmonotone projected gradient methods based on barrier and Euclidean distances
We consider nonmonotone projected gradient methods based on non-Euclidean distances, which play the role of barrier for a given constraint set. Our basic scheme uses the resulting projection-like maps that produces interior trajectories, and combines it with the recent nonmonotone line search technique originally proposed for unconstrained problems by Zhang and Hager. The combination of these two ideas leads to produce a nonmonotone scheme for constrained nonconvex problems, which is proven to converge to a stationary point. Some variants of this algorithm that incorporate spectral steplength are also studied and compared with classical nonmonotone schemes based on the usual Euclidean projection. To validate our approach, we report on numerical results solving bound constrained problems from the CUTEr library collection.
KeywordsConvex and nonconvex optimization Projected gradient algorithms Nonmonotone methods Spectral stepsizes Barrier proximal distances Convergence analysis
Unable to display preview. Download preview PDF.
- 16.Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987) Google Scholar
- 17.Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: the Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1992) Google Scholar