The following pages link to (Q5396661):
Displaying 50 items.
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
- A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems (Q830584) (← links)
- Pathwise coordinate optimization for sparse learning: algorithm and theory (Q1747736) (← links)
- Multi-label Lagrangian support vector machine with random block coordinate descent method (Q1750531) (← links)
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions (Q2013141) (← links)
- Gauss-Seidel method with oblique direction (Q2063282) (← links)
- Nonparametric regression with modified ReLU networks (Q2081757) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- Perturbed iterate SGD for Lipschitz continuous loss functions (Q2093279) (← links)
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
- Large-scale distributed sparse class-imbalance learning (Q2198074) (← links)
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← links)
- Cauchy noise loss for stochastic optimization of random matrix models via free deterministic equivalents (Q2287214) (← links)
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis (Q2291319) (← links)
- Learning with correntropy-induced losses for regression with mixture of symmetric stable noise (Q2300760) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression (Q2419533) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- A general framework for fast stagewise algorithms (Q2788373) (← links)
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent (Q2832112) (← links)
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization (Q2954396) (← links)
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
- Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- (Q4558169) (← links)
- On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
- (Q4558543) (← links)
- (Q4558572) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- (Q4637005) (← links)
- (Q4637059) (← links)
- Investigating competition in financial markets: a sparse autologistic model for dynamic network data (Q5035721) (← links)
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
- (Q5149262) (← links)
- Stochastic proximal quasi-Newton methods for non-convex composite optimization (Q5198046) (← links)
- Sparse low-rank separated representation models for learning from data (Q5243616) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Analysis of Online Composite Mirror Descent Algorithm (Q5380674) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
