Pages that link to "Item:Q959979"
From MaRDI portal
The following pages link to A coordinate gradient descent method for nonsmooth separable minimization (Q959979):
Displaying 50 items.
- A Stochastic Quasi-Newton Method for Large-Scale Optimization (Q121136) (← links)
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data (Q139756) (← links)
- Main effects and interactions in mixed and incomplete data frames (Q146484) (← links)
- Spatial Variable Selection and An Application to Virginia Lyme Disease Emergence (Q147727) (← links)
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- On some steplength approaches for proximal algorithms (Q298853) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- Split Bregman algorithms for multiple measurement vector problem (Q336036) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- Solution path clustering with adaptive concave penalty (Q457964) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing (Q479909) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← 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)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- \(\ell_{1}\)-penalization for mixture regression models (Q619141) (← links)
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- A new generalized shrinkage conjugate gradient method for sparse recovery (Q667880) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
- An iterative approach for cone complementarity problems for nonsmooth dynamics (Q711391) (← links)
- An augmented Lagrangian approach for sparse principal component analysis (Q715084) (← links)
- Distributed block-diagonal approximation methods for regularized empirical risk minimization (Q782443) (← links)
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization (Q827573) (← links)
- A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Sparse group Lasso and high dimensional multinomial classification (Q1621358) (← links)
- Nonparametric additive model with grouped Lasso and maximizing area under the ROC curve (Q1623603) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- Visualizing the effects of a changing distance on data using continuous embeddings (Q1658724) (← links)
- A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
- A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Orbital minimization method with \(\ell^{1}\) regularization (Q1685597) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
