Convex Optimization and Parsimony of $L_p$-balls Representation
From MaRDI portal
Publication:5743611
DOI10.1137/140983082zbMath1333.90089OpenAlexW2265795535MaRDI QIDQ5743611
Publication date: 5 February 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140983082
Related Items
Nonnegative forms with sublevel sets of minimal volume, Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity, Stokes, Gibbs, and volume computation of semi-algebraic sets, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures
Cites Work
- Unnamed Item
- Unnamed Item
- A generalization of Löwner-John's ellipsoid theorem
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- New and old results in resultant theory
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Optimization with Sparsity-Inducing Penalties
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Sums of even powers of real linear forms
- A Quick Proof for the Volume of n-Balls
- Solving a class of multivariate integration problems via Laplace techniques
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Convex Analysis
- Compressed sensing
- Complex analysis. Transl. from the German by Dan Fulea
