An active set method for general linear problem subject to box constraints
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1349149
- The l₁ Solution of Linear Equations Subject to Linear Constraints
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- On the convergence of an active-set method for _1 minimization
- An active set method for solving linearly constrained nonsmooth optimization problems
Cites work
- An Improved Algorithm for Discrete l₁ Linear Approximation
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
- Nonlinear programming and nonsmooth optimization by successive linear programming
Cited in
(8)- Minimization over the _1-ball using an active-set non-monotone projected gradient
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- The l₁ Solution of Linear Equations Subject to Linear Constraints
- scientific article; zbMATH DE number 1349149 (Why is no real title available?)
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints
- An l-BFGS algorithm for solving large-scale \(\ell_1\) problems
- Benders' decomposition for the constrained \(\ell_ 1\)-problem
This page was built for publication: An active set method for general linear problem subject to box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888259)
