An interior-point method for approximate positive semidefinite completions
From MaRDI portal
Publication:1383832
DOI10.1023/A:1018363021404zbMath0907.90207OpenAlexW1488876970MaRDI QIDQ1383832
Henry Wolkowicz, Charles R. Johnson, Brenda K. Kroschel
Publication date: 29 July 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018363021404
semidefinite programmingoptimality conditionscomplementarity problemsduality theoryprimal-dual interior-point algorithmspositive definite completionsbest nonnegative approximation
Related Items
Completion problem with partial correlation vines, Cuts, matrix completions and graph rigidity, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, An efficient algorithm for maximum entropy extension of block-circulant covariance matrices, Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem, The discretizable molecular distance geometry problem, Semidefinite programming for discrete optimization and matrix completion problems, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
