A First-Order Smoothed Penalty Method for Compressed Sensing
From MaRDI portal
Publication:3004985
DOI10.1137/090762294zbMath1219.90123OpenAlexW2060649248MaRDI QIDQ3004985
No author found.
Publication date: 6 June 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8e592bdb7bb9cb72041ab854a2a78750fd115811
Nesterov's methodsparse optimization\(\ell_1\)-minimizationbasis pursuitsmooth approximation of nonsmooth functions
Numerical smoothing, curve fitting (65D10) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Numerical methods involving duality (49M29)
Related Items
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function ⋮ Sparse solutions to an underdetermined system of linear equations via penalized Huber loss ⋮ A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints ⋮ An active set Newton-CG method for \(\ell_1\) optimization ⋮ An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems ⋮ An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems ⋮ A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares ⋮ An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems ⋮ Gradient-based method with active set strategy for $\ell _1$ optimization ⋮ Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs ⋮ A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization ⋮ Nomonotone spectral gradient method for sparse recovery
Uses Software
