Hybrid limited memory gradient projection methods for box-constrained optimization problems
From MaRDI portal
Publication:2111472
Recommendations
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- An improved gradient projection method for constrained optimization problems
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- scientific article; zbMATH DE number 6310859
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 4147424 (Why is no real title available?)
- scientific article; zbMATH DE number 1194487 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- A New Active Set Algorithm for Box Constrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Rapidly Convergent Descent Method for Minimization
- A limited memory gradient projection method for box-constrained quadratic optimization problems
- A limited memory steepest descent method
- A new steplength selection for scaled gradient methods with application to image deblurring
- A scaled gradient projection method for constrained image deblurring
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- An efficient gradient method using the Yuan steplength
- Benchmarking optimization software with performance profiles.
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- Computational Methods for Inverse Problems in Imaging
- Constrained global optimization: algorithms and applications
- Convergence properties of nonmonotone spectral projected gradient methods
- Generating box-constrained optimization problems
- Gradient Method with Retards and Generalizations
- Gradient methods with adaptive step-sizes
- Handling nonpositive curvature in a limited memory steepest descent method
- New adaptive stepsize selections in gradient methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On spectral properties of steepest descent methods
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- On the convergence properties of the projected gradient method for convex optimization
- On the steplength selection in gradient methods for unconstrained optimization
- Projected gradient methods for linearly constrained problems
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Two-Point Step Size Gradient Methods
Cited in
(3)
This page was built for publication: Hybrid limited memory gradient projection methods for box-constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111472)
