Stochastic semidefinite optimization using sampling methods
From MaRDI portal
Recommendations
- Stochastic semidefinite programming: a new paradigm for stochastic optimization
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Subsampling algorithms for semidefinite programming
- A stochastic approximation method for convex programming with many semidefinite constraints
Cited in
(10)- Stochastic accelerated alternating direction method of multipliers with importance sampling
- Boosted sampling
- Greedy Sampling Using Nonlinear Optimization
- Large Sample Mean-Field Stochastic Optimization
- Subsampling algorithms for semidefinite programming
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs
- A stochastic approximation method for convex programming with many semidefinite constraints
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Stochastic semidefinite programming: a new paradigm for stochastic optimization
This page was built for publication: Stochastic semidefinite optimization using sampling methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281605)