Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
From MaRDI portal
Publication:5219700
DOI10.1287/moor.2017.0905OpenAlexW2963598490MaRDI QIDQ5219700
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.07293
augmented Lagrangian methodsparse recoverycompressed sensingrestricted isometry propertyproximal gradient methodnull space propertysparse logistic regressionpartial regularization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, Inexact proximal DC Newton-type method for nonconvex composite functions, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, The complexity results of the sparse optimization problems and reverse convex optimization problems, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning, A residual-based algorithm for solving a class of structured nonsmooth optimization problems, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Robust signal recovery for ℓ 1–2 minimization via prior support information, Penalty and Augmented Lagrangian Methods for Constrained DC Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- A relaxed constant positive linear dependence constraint qualification and applications
- An augmented Lagrangian approach for sparse principal component analysis
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Optimization and nonsmooth analysis
- Two-Point Step Size Gradient Methods
- Generalized Gradients and Applications
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- High-Resolution Radar via Compressed Sensing
- Sparse Reconstruction by Separable Approximation
- The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic Range
- A Statistical View of Some Chemometrics Regression Tools
- 10.1162/153244303322753751
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Sparse Approximation via Penalty Decomposition Methods
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Compressed sensing
