Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
From MaRDI portal
Publication:2026765
DOI10.1007/s10589-020-00227-6zbMath1468.90101arXiv1710.04613OpenAlexW3089906210MaRDI QIDQ2026765
Publication date: 20 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.04613
convergence analysistractabilitynonconvex ADMMconstraint qualifications and KKT conditionsnonconvex sparse recovery
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Global solutions to folded concave penalized nonconvex learning
- Best subset selection via a modern optimization lens
- A note on the complexity of \(L _{p }\) minimization
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Iterative thresholding for sparse approximations
- Algorithm for cardinality-constrained quadratic optimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Geometric categories and o-minimal structures
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Structural properties of affine sparsity constraints
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Lectures on Modern Convex Optimization
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Optimization with Sparsity-Inducing Penalties
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Mathematical Programs with Equilibrium Constraints
- Compressed sensing
- A general theory of concave regularization for high-dimensional sparse estimation problems
