Pages that link to "Item:Q1639710"
From MaRDI portal
The following pages link to A flexible coordinate descent method (Q1639710):
Displaying 16 items.
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- A coordinate descent method for total variation minimization (Q1992568) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)
- Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup> (Q2829565) (← links)
- (Q3809123) (← links)
- Semi-stochastic coordinate descent (Q4594842) (← links)
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
- (Q5689980) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)