Exploiting structured sparsity in large scale semidefinite programming problems
From MaRDI portal
Recommendations
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
Cited in
(10)- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- An efficient approach to solve the large-scale semidefinite programming problems
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Decomposition of arrow type positive semidefinite matrices with application to topology optimization
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Exploiting sparsity in the matrix-dilation approach to robust semidefinite programming
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
This page was built for publication: Exploiting structured sparsity in large scale semidefinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747848)
