Hybrid limited memory gradient projection methods for box-constrained optimization problems
DOI10.1007/S10589-022-00409-4OpenAlexW4294564512MaRDI QIDQ2111472FDOQ2111472
Authors: Serena Crisci, F. Porta, V. Ruggiero, Luca Zanni 
Publication date: 16 January 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00409-4
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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- A Rapidly Convergent Descent Method for Minimization
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- A scaled gradient projection method for constrained image deblurring
- Projected gradient methods for linearly constrained problems
- A Nonmonotone Line Search Technique for Newton’s Method
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Constrained global optimization: algorithms and applications
- New adaptive stepsize selections in gradient methods
- On spectral properties of steepest descent methods
- A New Active Set Algorithm for Box Constrained Optimization
- Title not available (Why is that?)
- Gradient Method with Retards and Generalizations
- An efficient gradient method using the Yuan steplength
- A limited memory steepest descent method
- Gradient methods with adaptive step-sizes
- Title not available (Why is that?)
- On the steplength selection in gradient methods for unconstrained optimization
- On the convergence properties of the projected gradient method for convex optimization
- Title not available (Why is that?)
- Generating box-constrained optimization problems
- Convergence properties of nonmonotone spectral projected gradient methods
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
- A new steplength selection for scaled gradient methods with application to image deblurring
- Computational Methods for Inverse Problems in Imaging
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- A limited memory gradient projection method for box-constrained quadratic optimization problems
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds
- Handling nonpositive curvature in a limited memory steepest descent method
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)
