Pages that link to "Item:Q614018"
From MaRDI portal
The following pages link to The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018):
Displaying 13 items.
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Algorithms for stochastic optimization with function or expectation constraints (Q2181600) (← links)
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
- Primal-dual mirror descent method for constraint stochastic optimization problems (Q2416753) (← links)
- A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
- FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems (Q4646679) (← links)
- Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems (Q4965108) (← links)
- Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints (Q4973261) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints (Q5860603) (← links)
