Complementarity formulations of _0-norm optimization
zbMATH Open1474.90476MaRDI QIDQ5148366FDOQ5148366
John E. Mitchell, Mingbin Feng, Xin Shen, Andreas Wächter, Jong-Shi Pang
Publication date: 3 February 2021
Full work available at URL: http://www.yokohamapublishers.jp/online-p/PJO/vol14/pjov14n2p273.pdf
Recommendations
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- A smoothing method for sparse optimization over convex sets
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- A smoothing method for sparse optimization over polyhedral sets
- Sparse solutions of linear complementarity problems
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (23)
- Solving linear programs with complementarity constraints using branch-and-cut
- Cardinality minimization, constraints, and regularization: a survey
- Dual formulation of the sparsity constrained optimization problem: application to classification
- On integer and MPCC representability of affine sparsity
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Lifted stationary points of sparse optimization with complementarity constraints
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- Relaxation approaches for nonlinear sparse optimization problems
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Two relaxation methods for rank minimization problems
- An augmented Lagrangian method for cardinality-constrained optimization problems
- Title not available (Why is that?)
- An enhanced logical benders approach for linear programs with complementarity constraints
- Sparse approximation over the cube
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- Conic formulation of QPCCs applied to truly sparse QPs
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- Constrained composite optimization and augmented Lagrangian methods
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
This page was built for publication: Complementarity formulations of \(\ell_0\)-norm optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148366)
