Pages that link to "Item:Q535291"
From MaRDI portal
The following pages link to A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291):
Displayed 28 items.
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing (Q508757) (← links)
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications (Q1952757) (← links)
- A simple and feasible method for a class of large-scale \(l^1\)-problems (Q2006233) (← links)
- Differential network inference via the fused D-trace loss with cross variables (Q2180062) (← links)
- A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
- On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (Q2815509) (← links)
- A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression (Q2830631) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- (Q4633017) (← links)
- (Q4637005) (← links)
- Combining line search and trust-region methods for<b>ℓ1</b>-minimization (Q5028615) (← links)
- Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion (Q5251927) (← links)
- Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)