Robust Euclidean embedding via EDM optimization
From MaRDI portal
Publication:2220896
Recommendations
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Euclidean distance matrix completion problems
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Euclidean distance matrices and applications
- A semismooth Newton method for the nearest Euclidean distance matrix problem
Cites work
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- A cyclic projection algorithm via duality
- A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- A QP-free constrained Newton-type method for variational inequality problems
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- Distance shrinkage and Euclidean embedding via regularized kernel estimation
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Global Continuation for Distance Geometry Problems
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling.
- Multidimensional scaling. I: Theory and method
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Nonmetric multidimensional scaling. A numerical method
- Robust Localization of Nodes and Time-Recursive Tracking in Sensor Networks Using Noisy Range Measurements
- Robust Multidimensional Scaling Using a Maximum Correntropy Criterion
- Simple and Fast Convex Relaxation Method for Cooperative Localization in Sensor Networks Using Range Measurements
- Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
- Some distance properties of latent root and vector methods used in multivariate analysis
Cited in
(10)- Matrix optimization based Euclidean embedding with outliers
- A penalized method of alternating projections for weighted low-rank Hankel matrix optimization
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Optimality conditions for rank-constrained matrix optimization
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- 3D genome reconstruction from partially phased Hi-C data
- A Euclidean distance matrix model for convex clustering
- Weighted embedding and outlier detection of metric space data
This page was built for publication: Robust Euclidean embedding via EDM optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220896)