Pages that link to "Item:Q2452370"
From MaRDI portal
The following pages link to Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370):
Displayed 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)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← 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)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- Greedy and randomized versions of the multiplicative Schwarz method (Q445816) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Schwarz iterative methods: infinite space splittings (Q530579) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- Stochastic optimization using a trust-region method and random models (Q1646570) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Adaptive block coordinate DIRECT algorithm (Q1685578) (← links)
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- Linear convergence of the randomized sparse Kaczmarz method (Q1717238) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence (Q1739044) (← links)
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← 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)
- Matrix completion under interval uncertainty (Q1752160) (← links)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
- On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching (Q2039235) (← links)
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
- Gauss-Seidel method with oblique direction (Q2063282) (← links)
- Asynchronous networked aggregative games (Q2063821) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- On relaxed greedy randomized iterative methods for the solution of factorized linear systems (Q2083243) (← links)
- Cyclic coordinate descent in the Hölder smooth setting (Q2084003) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Stochastic cluster embedding (Q2104017) (← links)
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity (Q2115253) (← links)
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
