Pages that link to "Item:Q5242933"

The following pages link to Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933):

Displaying 17 items.

• A fully stochastic primal-dual algorithm (Q828693) (← links)
• General convergence analysis of stochastic first-order methods for composite optimization (Q2032020) (← links)
• On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
• Distributed optimization for degenerate loss functions arising from over-parameterization (Q2060697) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators (Q2208608) (← links)
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
• Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
• A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
• Randomized Extended Average Block Kaczmarz for Solving Least Squares (Q5146686) (← links)
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization (Q5162590) (← links)
• Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
• Distributed constrained consensus for discrete multi-agent systems with additive noises (Q5867039) (← links)
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
• The method of randomized Bregman projections for stochastic feasibility problems (Q6156125) (← links)