Preprocessing sparse semidefinite programs via matrix completion

DOI10.1080/10556780512331319523zbMATH Open1181.90214OpenAlexW2153101027MaRDI QIDQ3377970FDOQ3377970

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

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

zbMATH Keywords

matrix completionsparsitynumerical experimentsclique treepreprocessingsemidefinite programing

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Cites Work

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

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

Uses Software

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

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)