Pages that link to "Item:Q2848180"
From MaRDI portal
The following pages link to A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems (Q2848180):
Displaying 13 items.
- Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
- A version of the mirror descent method to solve variational inequalities (Q681901) (← links)
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- A stochastic primal-dual method for optimization with conditional value at risk constraints (Q2046691) (← links)
- Golden ratio algorithms for variational inequalities (Q2205983) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- First-order methods in large-scale semidefinite optimization. (Q2907520) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints (Q5114401) (← links)
- On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms (Q5252231) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
