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.





Describes a project that uses

Uses Software






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)