First-order methods in large-scale semidefinite optimization.

DOI10.3929/ETHZ-A-7324299MaRDI QIDQ2907520zbMATH OpenOpenAlexFDO

Authors Michael Bürgisser

Publication date 10 September 2012

Full work available at URL http://e-collection.library.ethz.ch/eserv/eth:5742/eth-5742-02.pdf

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Large-scale semidefinite programming via a saddle point mirror-prox algorithm
• A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
• On solving large-scale polynomial convex problems by randomized first-order algorithms
• First- and second-order methods for semidefinite programming
• Large-update primal-dual interior-point algorithm for semidefinite optimization

Cited in

(2)

• On solving large-scale polynomial convex problems by randomized first-order algorithms
• Large-scale semidefinite programming via a saddle point mirror-prox algorithm

This page was built for publication: First-order methods in large-scale semidefinite optimization.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907520)