Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ1 minimization
From MaRDI portal
Publication:5107961
DOI10.1051/cocv/2018061zbMath1461.65178arXiv1711.05882OpenAlexW2963177878MaRDI QIDQ5107961
Jinglai Shen, Seyedahmad Mousavi
Publication date: 29 April 2020
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.05882
LASSO\(\ell_1\) minimizationbasis pursuitconvex polyhedral functionsolution existence and uniqueness
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Related Items
A survey on compressive sensing: classical results and recent advancements, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Quadratic surface support vector machine with L1 norm regularization, A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- A mathematical introduction to compressive sensing
- Degrees of freedom in lasso problems
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- The solution path of the generalized lasso
- Properties and refinements of the fused Lasso
- Uniqueness of solution in linear programming
- The Lasso problem and uniqueness
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- Shape restricted smoothing splines via constrained optimal control and nonsmooth Newton's methods
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Introduction to Piecewise Differentiable Equations
- Estimation of Monotone Functions via P-Splines: A Constrained Dynamical Optimization Approach
- On Sparse Representations in Arbitrary Redundant Bases
- Switching and stability properties of conewise linear systems
- $\ell_1$ Trend Filtering
- Sparse Optimization Theory and Methods
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Perfect Recovery Conditions for Non-negative Sparse Modeling
- Sparsity and Smoothness Via the Fused Lasso
- Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$
- Linear Programming in O([n3/ln nL) Operations]
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Robust Non-Zenoness of Piecewise Affine Systems with Applications to Linear Complementarity Systems
- A Probabilistic and RIPless Theory of Compressed Sensing
