Pages that link to "Item:Q1383832"
From MaRDI portal
The following pages link to An interior-point method for approximate positive semidefinite completions (Q1383832):
Displaying 9 items.
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Completion problem with partial correlation vines (Q852640) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- An efficient algorithm for maximum entropy extension of block-circulant covariance matrices (Q2435387) (← links)
- Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem (Q5379243) (← links)
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)