Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
From MaRDI portal
Recommendations
- Algorithms for bound constrained quadratic programming problems
- A New Active Set Algorithm for Box Constrained Optimization
- A block active set algorithm for large-scale quadratic programming with box constraints
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- A survey on the active set methods for box constrained optimization
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A gradient-based globalization strategy for the Newton 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
- Algorithms for bound constrained quadratic programming problems
- Benchmarking optimization software with performance profiles.
- Gradient methods with adaptive step-sizes
- Gradient projection methods for quadratic programs and applications in training support vector machines
- New adaptive stepsize selections in gradient methods
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- New convergence results for the scaled gradient projection method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On solvability of convex noncoercive quadratic programming problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- 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
- Support-vector networks
- Two-Point Step Size Gradient Methods
Cited in
(7)- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- To the special issue dedicated to the 3rd international conference ``Numerical computations: theory and algorithms -- NUMTA 2019 June 15--21, 2019, Isola Capo Rizzuto, Italy
- An \(O(n^2)\) active set algorithm for solving two related box constrained parametric quadratic programs
- A New Active Set Algorithm for Box Constrained Optimization
- A survey on the active set methods for box constrained optimization
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
This page was built for publication: Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156911)
