Steplength selection in gradient projection methods for box-constrained quadratic programs
From MaRDI portal
Publication:2009551
DOI10.1016/j.amc.2019.03.039zbMath1428.90110OpenAlexW2925918685WikidataQ128140097 ScholiaQ128140097MaRDI QIDQ2009551
Serena Crisci, Luca Zanni, Valeria Ruggiero
Publication date: 29 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11392/2403748
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Numerical methods based on necessary conditions (49M05)
Related Items
Newton projection method as applied to assembly simulation, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Combined Newton-gradient method for constrained root-finding in chemical reaction networks, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Variable metric techniques for forward-backward methods in imaging, Using gradient directions to get global convergence of Newton-type methods, Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, Hybrid limited memory gradient projection methods for box-constrained optimization problems
Uses Software
Cites Work
- Unnamed Item
- On the application of the spectral projected gradient method in image segmentation
- An efficient gradient method using the Yuan steplength
- On the convergence properties of the projected gradient method for convex optimization
- Duality-based algorithms for total-variation-regularized image restoration
- A limited memory steepest descent method
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- Gradient methods with adaptive step-sizes
- A new steplength selection for scaled gradient methods with application to image deblurring
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
- New adaptive stepsize selections in gradient methods
- Algorithms for bound constrained quadratic programming problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- On the steplength selection in gradient methods for unconstrained optimization
- R-linear convergence of the Barzilai and Borwein gradient method
- On spectral properties of steepest descent methods
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- New convergence results for the scaled gradient projection method
- On the rate of convergence of projected Barzilai–Borwein methods
- A scaled gradient projection method for constrained image deblurring
- Two-Point Step Size Gradient Methods
- Generating box-constrained optimization problems
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
- A Nonmonotone Line Search Technique for Newton’s Method
- Gradient projection methods for quadratic programs and applications in training support vector machines
- A Rapidly Convergent Descent Method for Minimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
- On the steepest descent algorithm for quadratic functions