Modified active set projected spectral gradient method for bound constrained optimization
From MaRDI portal
(Redirected from Publication:638841)
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
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- A Class of penalty functions for optimization problema with bound constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Algorithm 778: L-BFGS-B
- Algorithm 813
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- CUTE
- Newton's Method for Large Bound-Constrained Optimization Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Accurate Identification of Active Constraints
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the asymptotic behaviour of some new gradient methods
- On the convergence of projected gradient processes to singular critical points
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Two-Point Step Size Gradient Methods
Cited in
(6)- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- 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
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)
