Pages that link to "Item:Q4558525"

The following pages link to Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525):

Displaying 24 items.

• Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI (Q826182) (← links)
• A fully stochastic primal-dual algorithm (Q828693) (← links)
• General convergence analysis of stochastic first-order methods for composite optimization (Q2032020) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
• Stochastic proximal splitting algorithm for composite minimization (Q2047212) (← links)
• Sub-linear convergence of a stochastic proximal iteration method in Hilbert space (Q2162529) (← links)
• Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
• Subgradient averaging for multi-agent optimisation with different constraint sets (Q2665377) (← links)
• On the computation of equilibria in monotone and potential stochastic hierarchical games (Q2693642) (← links)
• Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
• Sublinear Convergence of a Tamed Stochastic Gradient Descent Method in Hilbert Space (Q5093647) (← links)
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization (Q5162590) (← links)
• Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
• A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
• Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems (Q6076947) (← links)
• Faster randomized block sparse Kaczmarz by averaging (Q6109882) (← links)
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) (← links)
• A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)
• Mini-batch stochastic subgradient for functional constrained optimization (Q6565290) (← links)
• On adaptive stochastic heavy ball momentum for solving linear systems (Q6577448) (← links)