Complementarity formulations of _0-norm optimization
From MaRDI portal
Publication:5148366
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
Cited in
(33)- Constrained composite optimization and augmented Lagrangian methods
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- Solving linear programs with complementarity constraints using branch-and-cut
- Optimizing sparsity over lattices and semigroups
- A successive convex approximation approach for sparse solutions of convex programs
- On integer and MPCC representability of affine sparsity
- Cardinality minimization, constraints, and regularization: a survey
- Dual formulation of the sparsity constrained optimization problem: application to classification
- 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
- An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation
- 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
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- Relaxation approaches for nonlinear sparse optimization problems
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Two relaxation methods for rank minimization problems
- An augmented Lagrangian method for cardinality-constrained optimization problems
- Capra-convexity, convex factorization and variational formulations for the \(\ell_0\) pseudonorm
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- An enhanced logical benders approach for linear programs with complementarity constraints
- Sparse approximation over the cube
- A smoothing method for sparse optimization over convex sets
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- Conic formulation of QPCCs applied to truly sparse QPs
- A smoothing method for sparse optimization over polyhedral sets
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- 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
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)
