A multivariate spectral projected gradient method for bound constrained optimization
From MaRDI portal
Publication:629482
DOI10.1016/j.cam.2010.10.023zbMath1209.65065MaRDI QIDQ629482
Jing Sun, Yi Qin, Zhensheng Yu
Publication date: 9 March 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.10.023
global convergence; nonmonotone line search; numerical comparison; bounded constrained optimization; multivariable spectral projected gradient; quasi-Newton property
65K05: Numerical mathematical programming methods
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
90C53: Methods of quasi-Newton type
Related Items
Unnamed Item, A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints, Multivariate spectral gradient algorithm for nonsmooth convex optimization problems, A modified multivariate spectral gradient algorithm for solving absolute value equations, Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence properties of nonmonotone spectral projected gradient methods
- Multivariate spectral gradient method for unconstrained optimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- 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
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A New Active Set Algorithm for Box Constrained Optimization
- Projected gradient methods for linearly constrained problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Inexact spectral projected gradient methods on convex sets
- 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
- A Limited Memory Algorithm for Bound Constrained Optimization
- 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
- Convex programming in Hilbert space
- A nonmonotone trust region method for nonlinear programming with simple bound constraints
- Adaptive two-point stepsize gradient algorithm
