Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
type: Item
instance of: scholarly article
title: Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
zbMATH Open document ID: 1226.90070
published in: Linear Algebra and its Applications
publication date: 2009-02-10T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 5505620
zbMATH Keywords: chordal graph
zbMATH Keywords: constraint nondegeneracy
zbMATH Keywords: matrix completion
zbMATH Keywords: semidefinite programming
author: Houduo Qi
describes a project that uses: QSDP
MaRDI profile type: Publication
full work available at URL: j.laa.2008.10.010
OpenAlex ID: W2141712751
Wikidata QID: Q114851466
cites work: Q4517113
cites work: Complementarity and nondegeneracy in semidefinite programming
cites work: The real positive definite completion problem: cycle completability
cites work: Critical Graphs for the Positive Definite Completion Problem
cites work: The real positive definite completion problem for a simple cycle
cites work: Q4503250
cites work: Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
cites work: Matrix Nearness Problems with Bregman Divergences
cites work: Extensions of band matrices with band inverses
cites work: Positive definite completions and determinant maximization
cites work: Positive definite completions of partial Hermitian matrices
cites work: Matrix completions and chordal graphs
cites work: Computing the nearest correlation matrix--a problem from finance
cites work: Q3487569
cites work: An interior-point method for approximate positive semidefinite completions
cites work: The real positive semidefinite completion problem for series-parallel graphs
cites work: A connection between positive semidefinite and Euclidean distance matrix completion problems
cites work: Encyclopedia of optimization. In 6 vols.
cites work: Local Duality of Nonlinear Semidefinite Programming
cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
cites work: Strongly Regular Generalized Equations
cites work: Triangulated graphs and the elimination process
cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
cites work: An inexact primal-dual path following algorithm for convex quadratic SDP
cites work: Q5442492
cites work: Semidefinite programming for discrete optimization and matrix completion problems
DOI: 10.1016/J.LAA.2008.10.010
description: scientific article; zbMATH DE number 5505620