A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
From MaRDI portal
Publication:2815509
DOI10.1080/10556788.2015.1088851zbMath1343.49054OpenAlexW2215520601MaRDI QIDQ2815509
Publication date: 29 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1088851
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Least angle regression. (With discussion)
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Multiplier and gradient methods
- Linearized Bregman iterations for compressed sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Two-Point Step Size Gradient Methods
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- A new approach to variable selection in least squares problems
- Sparse Reconstruction by Separable Approximation
- Neighborliness of randomly projected simplices in high dimensions
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Compressed sensing
This page was built for publication: A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
