Sparse Optimization with Least-Squares Constraints

DOI10.1137/100785028zbMath1242.49061OpenAlexW2032693829MaRDI QIDQ3225227

Ewout van den Berg, Michael P. Friedlander

Publication date: 16 March 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/95f431791d657e48b2587cc6866bc7d4b29f22cb

zbMATH Keywords

Newton's methodmatrix completiondualityconvex programgroup sparsitycompressed sensingsparse solutionsroot-findingbasis pursuit

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29) Newton-type methods (49M15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity ⋮ Numerical Integration in Multiple Dimensions with Designed Quadrature ⋮ Efficient block-coordinate descent algorithms for the group Lasso ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ Gradient projection Newton pursuit for sparsity constrained optimization ⋮ On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems ⋮ Group SLOPE – Adaptive Selection of Groups of Predictors ⋮ Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere ⋮ A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising ⋮ Penalty decomposition methods for rank minimization ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem ⋮ Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF ⋮ Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids ⋮ Accelerating Sparse Recovery by Reducing Chatter ⋮ A perturbation view of level-set methods for convex optimization ⋮ Level-set methods for convex optimization ⋮ Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery ⋮ Unnamed Item ⋮ Iterative algorithms for total variation-like reconstructions in seismic tomography ⋮ The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems ⋮ Energy preserved sampling for compressed sensing MRI ⋮ Unnamed Item ⋮ Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere ⋮ SPGL1 ⋮ Nonsmooth sparsity constrained optimization problems: optimality conditions ⋮ Reconstruction of jointly sparse vectors via manifold optimization ⋮ Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics ⋮ Convex optimization under combinatorial sparsity constraints

Uses Software

• SeDuMi
• Spot