Pages that link to "Item:Q6176428"
From MaRDI portal
The following pages link to Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428):
Displaying 14 items.
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
- Oracle complexity separation in convex optimization (Q2139268) (← links)
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
- Efficiency of coordinate descent methods on huge-scale optimization problems (Q2910875) (← links)
- A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization (Q3571748) (← links)
- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters (Q4558160) (← links)
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
- Block coordinate type methods for optimization and learning (Q5889894) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
