The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
From MaRDI portal
Publication:6667692
DOI10.1007/s10589-024-00625-0MaRDI QIDQ6667692
Christian Kanzow, Felix Weiß, Alexandra Schwartz
Publication date: 20 January 2025
Published in: Computational Optimization and Applications (Search for Journal in Brave)
quadratic convergencelocal minimaLagrange-Newton methodsparse optimizationB-subdifferentialglobal minimastrong stationarity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- A semismooth equation approach to the solution of nonlinear complementarity problems
- DC formulations and algorithms for sparse optimization problems
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- A Lagrange-Newton algorithm for sparse nonlinear programming
- 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
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- A nonsmooth version of Newton's method
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Proximal Newton-Type Methods for Minimizing Composite Functions
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- Algorithms for Fitting the Constrained Lasso
- Decoding by Linear Programming
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Atomic Decomposition by Basis Pursuit
- A special newton-type optimization method
- First-Order Methods in Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global optimization for sparse solution of least squares problems
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Constrained composite optimization and augmented Lagrangian methods
This page was built for publication: The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results