Preprocessing sparse semidefinite programs via matrix completion

DOI10.1080/10556780512331319523MaRDI QIDQ3377970zbMATH OpenOpenAlexFDO

Authors Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata

Publication date 29 March 2006

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL http://purl.umn.edu/4022

zbMATH Keywords

matrix completionsparsitynumerical experimentsclique treepreprocessingsemidefinite programing

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Solving semidefinite programs using preconditioned conjugate gradients
• Preprocessing and regularization for degenerate semidefinite programs
• Advanced preprocessing techniques for linear and quadratic programming

Cites work

• scientific article; zbMATH DE number 4211299 (Why is no real title available?)
• scientific article; zbMATH DE number 1372697 (Why is no real title available?)
• scientific article; zbMATH DE number 1428912 (Why is no real title available?)
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Global optimization with polynomials and the problem of moments
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Positive definite completions of partial Hermitian matrices
• SDPLIB 1.2, a library of semidefinite programming test problems
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
• Semidefinite programming relaxations for semialgebraic problems
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• Symmetry groups, semidefinite programs, and sums of squares

Cited in

(4)

• A parallel interior point decomposition algorithm for block angular semidefinite programs
• Approx-SVP in ideal lattices with pre-processing
• Strong duality and minimal representations for cone optimization
• COSMO: a conic operator splitting method for convex conic problems

Describes a project that uses

Uses Software

• SDPARA
• SPOOLES
• METIS
• SDPT3
• SDPA
• SDPLIB
• CSDP

This page was built for publication: Preprocessing sparse semidefinite programs via matrix completion

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