Spectral projected gradient and variable metric methods for optimization with linear inequalities
From MaRDI portal
The authors consider linearly constrained optimization problems of the form \[ \min f(x)\quad\text{s.t. }Ax\leq 0,\quad x\in\mathbb{R}^n, \] where \(A\) is a \((m,n)\)-matrix and \(f(x)\) is a continuously differentiable function. For solving this optimization problem, the authors introduce a general purpose inexact variable metric algorithm. Subproblems are solved using the dual of a strictly convex quadratic programming problem. Convergence results and numerical experiments are given.
Recommendations
- A multivariate spectral projected gradient method for bound constrained optimization
- Spectral gradient methods for linearly constrained optimization
- Spectral projected subgradient method for nonsmooth convex optimization problems
- On inexact projected gradient methods for solving variable vector optimization problems
- Inexact spectral projected gradient methods on convex sets
- Projected gradient methods for linearly constrained problems
- Two spectral gradient projection methods for constrained equations and their linear convergence rate
- Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
Cited in
(15)- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- On the inexact scaled gradient projection method
- On inexact projected gradient methods for solving variable vector optimization problems
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- A flexible inexact-restoration method for constrained optimization
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Spectral gradient methods for linearly constrained optimization
- On regularization and active-set methods with complexity for constrained optimization
- Inexact variable metric method for convex-constrained optimization problems
- A multivariate spectral projected gradient method for bound constrained optimization
- Projected gradient methods with momentum
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Gradient methods with adaptive step-sizes
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
This page was built for publication: Spectral projected gradient and variable metric methods for optimization with linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670197)