A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
From MaRDI portal
Publication:5300546
DOI10.1137/110849523zbMath1266.49052OpenAlexW1990908167MaRDI QIDQ5300546
Publication date: 27 June 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/347784/1/084952RRRR.pdf
Convex programming (90C25) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (22)
Decomposition Methods for Sparse Matrix Nearness Problems ⋮ Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ Model-based distance embedding with applications to chromosomal conformation biology ⋮ An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling ⋮ Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints ⋮ A semismooth Newton method for support vector classification and regression ⋮ A facial reduction approach for the single source localization problem ⋮ Variational analysis of norm cones in finite dimensional Euclidean spaces ⋮ Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications ⋮ Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy ⋮ Ordinal Distance Metric Learning with MDS for Image Ranking ⋮ An efficient augmented Lagrangian method for support vector machine ⋮ Robust Euclidean embedding via EDM optimization ⋮ The vector-valued functions associated with circular cones ⋮ Conditional quadratic semidefinite programming: examples and methods ⋮ Noisy Euclidean distance matrix completion with a single missing node ⋮ Regularized multidimensional scaling with radial basis functions ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ Discriminant analysis of regularized multidimensional scaling ⋮ A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding ⋮ Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach ⋮ Complementarity problems with respect to Loewnerian cones
This page was built for publication: A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem