The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
From MaRDI portal
(Redirected from Publication:6667692)
Cites work
- A Lagrange-Newton algorithm for sparse nonlinear programming
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- A nonsmooth version of Newton's method
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A special newton-type optimization method
- Algorithms for Fitting the Constrained Lasso
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- Atomic Decomposition by Basis Pursuit
- Complementarity formulations of \(\ell_0\)-norm optimization
- Constrained composite optimization and augmented Lagrangian methods
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- DC formulations and algorithms for sparse optimization problems
- Decoding by Linear Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Global optimization for sparse solution of least squares problems
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Proximal Newton-type methods for minimizing composite functions
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
This page was built for publication: The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667692)
