Pages that link to "Item:Q4835417"
From MaRDI portal
The following pages link to The Euclidian Distance Matrix Completion Problem (Q4835417):
Displaying 27 items.
- A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- The elliptic matrix completion problem (Q630533) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- Structural conditions for cycle completable graphs (Q1126192) (← links)
- Positive definite completions and determinant maximization (Q1300861) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Matrix completions and chordal graphs (Q1412950) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- The positive definite completion problem relative to a subspace (Q1973913) (← links)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- Central limit theorems for classical multidimensional scaling (Q2192306) (← links)
- Matrix estimation by universal singular value thresholding (Q2338924) (← links)
- Matrix completions for linear matrix equations (Q2357669) (← links)
- Molecular conformation search by distance matrix perturbations (Q2485885) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)
