Solving SDP faster: a robust IPM framework and efficient implementation
From MaRDI portal
Cited in
(4)- The bit complexity of dynamic algebraic formulas and their determinants
- Training multi-layer over-parametrized neural network in subquadratic time
- Data-driven robust linear quadratic regulator: a minimax design using reinforcement learning
- Quantum computing inspired iterative refinement for semidefinite optimization
This page was built for publication: Solving SDP faster: a robust IPM framework and efficient implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943064)