Pages that link to "Item:Q3449571"
From MaRDI portal
The following pages link to Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571):
Displaying 29 items.
- (Q5149027) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm (Q5502117) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning (Q5506688) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
- An accelerated communication-efficient primal-dual optimization framework for structured machine learning (Q5859008) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Distributed Stochastic Optimization with Large Delays (Q5868949) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates (Q5882231) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient (Q6046830) (← links)
- Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
- A modified stochastic quasi-Newton algorithm for summing functions problem in machine learning (Q6138300) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
- Adaptive Catalyst for Smooth Convex Optimization (Q6329866) (← links)
- Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
- More communication-efficient distributed sparse learning (Q6546022) (← links)
- A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem (Q6569058) (← links)
- IML FISTA: a multilevel framework for inexact and inertial forward-backward. Application to image restoration (Q6587646) (← links)
- Acceleration and restart for the randomized Bregman-Kaczmarz method (Q6615435) (← links)
- Several kinds of acceleration techniques for unconstrained optimization first-order algorithms (Q6665360) (← links)
