Modified active set projected spectral gradient method for bound constrained optimization
From MaRDI portal
Publication:638841
DOI10.1016/J.APM.2010.09.011zbMATH Open1221.90081OpenAlexW1999920090MaRDI QIDQ638841FDOQ638841
Authors: Qingjie Hu, Yunhai Xiao, Zengxin Wei 
Publication date: 16 September 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.09.011
Recommendations
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Large-scale active-set box-constrained optimization method with spectral projected gradients
global convergencegradient projectionnonmonotone line searchspectral gradient methodbound constrained problem
Cites Work
- Algorithm 778: L-BFGS-B
- Newton's Method for Large Bound-Constrained Optimization Problems
- Algorithm 813
- CUTE
- A Limited Memory Algorithm for Bound Constrained Optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Title not available (Why is that?)
- On the Accurate Identification of Active Constraints
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the asymptotic behaviour of some new gradient methods
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the convergence of projected gradient processes to singular critical points
- A Class of penalty functions for optimization problema with bound constraints
Cited In (6)
- A multivariate spectral projected gradient method for bound constrained optimization
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- A globally convergent active-set memoryless quasi-Newton method based on spectral-scaling Broyden family for bound constrained optimization
- Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
Uses Software
This page was built for publication: Modified active set projected spectral gradient method for bound constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638841)
