A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
From MaRDI portal
Publication:535291
DOI10.1007/s10589-009-9251-8zbMath1220.90092OpenAlexW1982941867MaRDI QIDQ535291
Publication date: 11 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9251-8
convex optimizationlogistic regression\(\ell_{1}\)-regularizationcompressed sensingimage deconvolutionlinear least squarescoordinate gradient descentQ-linear convergence
Related Items
Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Differential network inference via the fused D-trace loss with cross variables, Another hybrid approach for solving monotone operator equations and application to signal processing, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing, New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications, Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming, Stochastic block-coordinate gradient projection algorithms for submodular maximization, Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, On the complexity analysis of randomized block-coordinate descent methods, A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property, Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing, A new spectral method for \(l_1\)-regularized minimization, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, A simple and feasible method for a class of large-scale \(l^1\)-problems, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization, Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence, A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression, Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion, Minimization of $\ell_{1-2}$ for Compressed Sensing, Unnamed Item, Unnamed Item, Primal–dual first-order methods for a class of cone programming, Combining line search and trust-region methods forℓ1-minimization, On the convergence of inexact block coordinate descent methods for constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- LASSO-pattern search algorithm with application to ophthalmology and genomic data
- Wavelets and curvelets for image deconvolution: a combined approach
- A coordinate gradient descent method for nonsmooth separable minimization
- Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Least angle regression. (With discussion)
- An EM algorithm for wavelet-based image restoration
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Atomic Decomposition by Basis Pursuit
- A new approach to variable selection in least squares problems
- Sparse Reconstruction by Separable Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Mathematical Programming for Data Mining: Formulations and Challenges
- Compressed sensing
- Large scale kernel regression via linear programming
