Pages that link to "Item:Q868467"
From MaRDI portal
The following pages link to Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467):
Displaying 18 items.
- Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- First- and second-order methods for semidefinite programming (Q1403288) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- A novel approach for solving semidefinite programs (Q2336591) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems (Q2436689) (← links)
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems (Q2848180) (← links)
- First-order methods in large-scale semidefinite optimization. (Q2907520) (← links)
- The equivalent model of the large sparse saddle point problem and its solving strategy (Q2927466) (← links)
- Solving variational inequalities with Stochastic Mirror-Prox algorithm (Q5168840) (← links)
- High-accuracy solution of large-scale semidefinite programs (Q5200555) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
