Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications

Convex programming (90C25) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

In memoriam: Asen L. Dontchev (1948--2021)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
Computing the nearest Euclidean distance matrix with low embedding dimensions
Conditional quadratic semidefinite programming: examples and methods
Interpolation of scattered data: distance matrices and conditionally positive definite functions
Equality relating Euclidean distance cone to positive semidefinite cone
Nonsingularity in second-order cone programming via the smoothing metric projector
Approximation by matrices positive semidefinite on a subspace
A cyclic projection algorithm via duality
Solving Euclidean distance matrix completion problems via semidefinite progrmming
Nonsmooth equations in optimization. Regularity, calculus, methods and applications
First and second order analysis of nonlinear semidefinite programs
An interior-point method for approximate positive semidefinite completions
Matrix optimization based Euclidean embedding with outliers
Robust Euclidean embedding via EDM optimization
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
An introduction to a class of matrix cone programming
Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
Modern multidimensional scaling. Theory and applications.
Perturbation analysis of second-order cone programming problems
Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems
An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
Implicit Functions and Solution Mappings
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
Strongly Regular Generalized Equations
Variational Analysis
Variational Analysis and Applications
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints
Localization From Incomplete Euclidean Distance Matrix: Performance Analysis for the SVD–MDS Approach
A TWO-REGIME, STOCHASTIC-VOLATILITY EXTENSION OF THE LIBOR MARKET MODEL
Finite-Dimensional Variational Inequalities and Complementarity Problems
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
Euclidean Distance Geometry and Applications
Semismooth Matrix-Valued Functions

This page was built for publication: Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications