Pages that link to "Item:Q306308"
From MaRDI portal
The following pages link to Inexact coordinate descent: complexity and preconditioning (Q306308):
Displaying 24 items.
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← 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)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- Computing locally injective mappings by advanced MIPS (Q2802299) (← links)
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
- (Q2958602) (← links)
- Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling (Q5072595) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
- Riemannian preconditioned coordinate descent for low multilinear rank approximation (Q6561638) (← links)
