On the stationarity for nonlinear optimization problems with polyhedral constraints
From MaRDI portal
Publication:6126646
DOI10.1007/s10107-023-01979-9OpenAlexW4377292218MaRDI QIDQ6126646
Marco Viola, Gerardo Toraldo, William W. Hager, Daniela di Serafino
Publication date: 9 April 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-023-01979-9
Cites Work
- Unnamed Item
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- An active set algorithm for nonlinear optimization with polyhedral constraints
- On the convergence properties of the projected gradient method for convex optimization
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- New adaptive stepsize selections in gradient methods
- A new trust region algorithm for bound constrained minimization
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- An interior point-proximal method of multipliers for convex quadratic programming
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers
- On the steplength selection in gradient methods for unconstrained optimization
- Projection onto a Polyhedron that Exploits Sparsity
- A New Active Set Algorithm for Box Constrained Optimization
- New convergence results for the scaled gradient projection method
- A Solver for Nonconvex Bound-Constrained Quadratic Optimization
- On the Identification of Active Constraints II: The Nonconvex Case
- A scaled gradient projection method for constrained image deblurring
- Projected gradient methods for linearly constrained problems
- Two-Point Step Size Gradient Methods
- On the Identification of Active Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Maximization of a Concave Quadratic Function with Box Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
- On the numerical solution of bound constrained optimization problems
- Sparse Approximations with Interior Point Methods
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions
- Benchmarking optimization software with performance profiles.
