Pages that link to "Item:Q2401516"
From MaRDI portal
The following pages link to Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516):
Displayed 27 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)
- Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
- On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem (Q2060942) (← links)
- Gauss-Seidel method with oblique direction (Q2063282) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← 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)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631) (← links)
- Emergence of price-taking behavior (Q2206009) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems (Q2686517) (← links)
- A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
- Generalized gradients, bid–ask spreads, and market equilibrium (Q4634166) (← links)
- On Adaptive Sketch-and-Project for Solving Linear Systems (Q4997841) (← links)
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations (Q5020146) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems (Q5061750) (← links)
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
- (Q5158544) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)