Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

DOI10.1016/j.laa.2008.10.010zbMath1226.90070WikidataQ114851466 ScholiaQ114851466MaRDI QIDQ999796

Hou-Duo Qi

Publication date: 10 February 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.10.010

zbMATH Keywords

semidefinite programming; matrix completion; chordal graph; constraint nondegeneracy

Mathematics Subject Classification ID

90C25: Convex programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

90C27: Combinatorial optimization

Uses Software

• QSDP