Solving bound constrained optimization via a new nonmonotone spectral projected gradient method

DOI10.1016/J.APNUM.2007.07.007zbMath1154.65051OpenAlexW1984687314MaRDI QIDQ941611

Zhensheng Yu

Publication date: 1 September 2008

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2007.07.007

zbMATH Keywords

global convergencenumerical examplesbound constrained optimizationnonmonotone spectral projected gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ Spectral gradient projection method for monotone nonlinear equations with convex constraints ⋮ Nonmonotone conic trust region method with line search technique for bound constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence properties of nonmonotone spectral projected gradient methods
• A new trust region algorithm for bound constrained minimization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Inexact spectral projected gradient methods on convex sets
• Trust Region Methods
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Spectral projected gradient and variable metric methods for optimization with linear inequalities
• A Nonmonotone Line Search Technique for Newton’s Method
• On the Barzilai and Borwein choice of steplength for the gradient method
• Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
• A nonmonotone trust region method for nonlinear programming with simple bound constraints
• Adaptive two-point stepsize gradient algorithm

This page was built for publication: Solving bound constrained optimization via a new nonmonotone spectral projected gradient method