Complementarity formulations of _0-norm optimization
From MaRDI portal
(Redirected from Complementarity formulations of _0-norm optimization)
Complementarity formulations of \(\ell 0\)-norm optimization
Complementarity formulations of \(\ell 0\)-norm optimization
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
(40)- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- An augmented Lagrangian method for cardinality-constrained optimization problems
- 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
- A smoothing method for sparse optimization over convex sets
- Two relaxation methods for rank minimization problems
- Solving linear programs with complementarity constraints using branch-and-cut
- On integer and MPCC representability of affine sparsity
- An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation
- Capra-convexity, convex factorization and variational formulations for the _0 pseudonorm
- Conic formulation of QPCCs applied to truly sparse QPs
- Lifted stationary points of sparse optimization with complementarity constraints
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Optimizing sparsity over lattices and semigroups
- A smoothing method for sparse optimization over polyhedral sets
- A successive convex approximation approach for sparse solutions of convex programs
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- Sparse approximation over the cube
- Constrained composite optimization and augmented Lagrangian methods
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Cardinality minimization, constraints, and regularization: a survey
- Dual formulation of the sparsity constrained optimization problem: application to classification
- Relaxation approaches for nonlinear sparse optimization problems
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- Sparse SVM with hard-margin loss: a Newton-augmented Lagrangian method in reduced dimensions
- A square departure from symmetry in matrix cones
- Cardinality constraints in single-leader-multi-follower games
- Sparse projection onto semi-symmetric sets with applications to sparse optimization
- Composite optimization with indicator functions: stationary duality and a semismooth Newton method
- An enhanced logical benders approach for linear programs with complementarity constraints
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)
