On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
From MaRDI portal
Publication:511961
DOI10.1007/s10957-016-1004-0zbMath1432.65072OpenAlexW2257998465MaRDI QIDQ511961
Publication date: 23 February 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01187012/file/p.pdf
optimality conditionsMinkowski functionbasis pursuitconvex polyhedral functiongauge recoveryL1 minimizationsharp minimumsolution existence and uniqueness
Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Related Items
Parameter choices for sparse regularization with the ℓ1 norm *, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ1 minimization, LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing, Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization, Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple bounds for recovering low-complexity models
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Testing the nullspace property using semidefinite programming
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- Convex analysis and nonlinear optimization. Theory and examples
- Examples of ill-behaved central paths in convex optimization
- The convex geometry of linear inverse problems
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- Compressed sensing and best 𝑘-term approximation
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- Weak Sharp Minima in Mathematical Programming
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Sparse Approximate Solutions to Linear Systems
- Gauge Optimization and Duality
- Accuracy Guarantees for <formula formulatype="inline"> <tex Notation="TeX">$\ell_1$</tex></formula>-Recovery
- On first-order algorithms forl1/nuclear norm minimization
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Compressed sensing
