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

DOI10.1016/j.laa.2008.10.010zbMath1226.90070OpenAlexW2141712751WikidataQ114851466 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 programmingmatrix completionchordal graphconstraint nondegeneracy

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27)

Related Items

Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ An inexact SQP Newton method for convex SC\(^{1}\) minimization problems ⋮ A projected semismooth Newton method for problems of calibrating least squares covariance matrix

Uses Software

• QSDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the nearest correlation matrix--a problem from finance
• The real positive semidefinite completion problem for series-parallel graphs
• Semidefinite programming for discrete optimization and matrix completion problems
• Positive definite completions of partial Hermitian matrices
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Extensions of band matrices with band inverses
• Positive definite completions and determinant maximization
• The real positive definite completion problem for a simple cycle
• Complementarity and nondegeneracy in semidefinite programming
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• An interior-point method for approximate positive semidefinite completions
• Matrix completions and chordal graphs
• Triangulated graphs and the elimination process
• Local Duality of Nonlinear Semidefinite Programming
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• Matrix Nearness Problems with Bregman Divergences
• Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
• Strongly Regular Generalized Equations
• Critical Graphs for the Positive Definite Completion Problem
• The real positive definite completion problem: cycle completability
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications