Pages that link to "Item:Q1588838"
From MaRDI portal
The following pages link to Distance matrix completion by numerical optimization (Q1588838):
Displayed 16 items.
- An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
- A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
- Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
- Adequateness and interpretability of objective functions in ordinal data analysis (Q557988) (← links)
- Projected Landweber iteration for matrix completion (Q708281) (← links)
- Theory of semidefinite programming for sensor network localization (Q868476) (← links)
- Sensitivity analysis of the strain criterion for multidimensional scaling (Q959142) (← links)
- Variable precision rough set for group decision-making: an application (Q962636) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- An efficient method for convex constrained rank minimization problems based on DC programming (Q1793529) (← links)
- Extensions of classical multidimensional scaling via variable reduction (Q1855631) (← links)
- ROP: matrix recovery via rank-one projections (Q2338922) (← links)
- An alternating direction method for solving convex nonlinear semidefinite programming problems (Q2841143) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← links)