Pages that link to "Item:Q2338088"
From MaRDI portal
The following pages link to Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088):
Displaying 8 items.
- Random algorithms for convex minimization problems (Q644912) (← 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)
- Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
- Random gradient-free minimization of convex functions (Q2397749) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Mini-batch stochastic subgradient for functional constrained optimization (Q6565290) (← links)
- A stochastic moving ball approximation method for smooth convex constrained minimization (Q6642788) (← links)