Pages that link to "Item:Q4558525"

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

Displaying 6 items.

• 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)
• A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)