Algorithms in convex analysis to fit \(\ell_ p\)-distance matrices (Q1340283)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms in convex analysis to fit _ p-distance matrices |
scientific article; zbMATH DE number 701308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms in convex analysis to fit \(\ell_ p\)-distance matrices |
scientific article; zbMATH DE number 701308 |
Statements
Algorithms in convex analysis to fit \(\ell_ p\)-distance matrices (English)
0 references
16 February 1995
0 references
multidimensional scaling
0 references
constrained maximization of convex functions
0 references
inverse iteration
0 references
dissimilarity matrix
0 references
weighted least squares loss function
0 references
finite dimensional Hilbert space
0 references
local maximum
0 references
nonlinear eigenproblem
0 references
subgradients
0 references
new iterative procedure
0 references
global convergence
0 references
0.773426353931427
0 references
