Pages that link to "Item:Q1061193"
From MaRDI portal
The following pages link to The best Euclidean fit to a given distance matrix in prescribed dimensions (Q1061193):
Displaying 24 items.
- Structure method for solving the nearest Euclidean distance matrix problem (Q261791) (← links)
- Fitting semiparametric clustering models to dissimilarity data (Q484231) (← links)
- Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
- The cell matrix closest to a given Euclidean distance matrix (Q745190) (← links)
- Multidimensional scaling with constraints on the configuration (Q913416) (← links)
- Scaling radial basis functions via Euclidean distance matrices (Q936690) (← links)
- Properties of Euclidean and non-Euclidean distance matrices (Q1061194) (← links)
- On certain linear mappings between inner-product and squared-distance matrices (Q1102346) (← links)
- Approximation by matrices positive semidefinite on a subspace (Q1117291) (← links)
- A cyclic projection algorithm via duality (Q1123132) (← links)
- Norm estimates for inverses of Euclidean distance matrices (Q1198160) (← links)
- Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS (Q1329694) (← links)
- Nonlinear eigenvector algorithms for local optimization in multivariate data analysis (Q1369295) (← links)
- On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices (Q1774975) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
- Simultaneous classification and multidimensional scaling with external information (Q2260039) (← links)
- On a general transformation making a dissimilarity matrix Euclidean (Q2476000) (← links)
- Molecular conformation search by distance matrix perturbations (Q2485885) (← links)
- A variance inequality ensuring that a pre-distance matrix is Euclidean (Q2496617) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- The cone of distance matrices (Q2639130) (← links)
- (Q4530821) (← links)
- Distance à centre additive (Q4887131) (← links)