A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding
From MaRDI portal
Publication:5506686
DOI10.1137/15M1043133zbMath1354.49058MaRDI QIDQ5506686
Publication date: 13 December 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
quadratic convergencedimensionality reductionEuclidean distance matrixsemismooth Newton methodconvex matrix optimization
Convex programming (90C25) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem ⋮ A feasible \(k\)-means kernel trick under non-Euclidean feature space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Knowledge discovery by accuracy maximization
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Conditional quadratic semidefinite programming: examples and methods
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- The analytical solution of the additive constant problem
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Robust kernel Isomap
- A cyclic projection algorithm via duality
- A nonsmooth version of Newton's method
- Some boundary conditions for a monotone analysis of symmetric matrices
- A new solution to the additive constant problem in metric multidimensional scaling
- Modern multidimensional scaling. Theory and applications.
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Multidimensional scaling. I: Theory and method
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- 10.1162/153244304322972667
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Optimization and nonsmooth analysis
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- A preconditioned Newton algorithm for the nearest correlation matrix
- Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Metric Spaces and Positive Definite Functions
- Methods of conjugate gradients for solving linear systems
