Preprocessing sparse semidefinite programs via matrix completion

DOI10.1080/10556780512331319523zbMath1181.90214MaRDI QIDQ3377970

Mituhiro Fukuda, Katsuki Fujisawa, Kazuhide Nakata

Publication date: 29 March 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

matrix completion; numerical experiments; sparsity; clique tree; preprocessing; semidefinite programing

Mathematics Subject Classification ID

90C22: Semidefinite programming

Related Items

A parallel interior point decomposition algorithm for block angular semidefinite programs

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Semidefinite programming relaxations for semialgebraic problems
• Symmetry groups, semidefinite programs, and sums of squares
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Global Optimization with Polynomials and the Problem of Moments
• Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• SDPLIB 1.2, a library of semidefinite programming test problems
• 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)