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 8 items.
- Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
- A version of the mirror descent method to solve variational inequalities (Q681901) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- A stochastic primal-dual method for optimization with conditional value at risk constraints (Q2046691) (← links)
- Golden ratio algorithms for variational inequalities (Q2205983) (← 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)
