Equality relating Euclidean distance cone to positive semidefinite cone
From MaRDI portal
Publication:924334
DOI10.1016/j.laa.2007.12.008zbMath1142.15014OpenAlexW1989058043MaRDI QIDQ924334
Publication date: 15 May 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.12.008
Related Items (50)
Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching ⋮ Monotonicity and circular cone monotonicity associated with circular cones ⋮ Regularized adaptive Kalman filter for non-persistently excited systems ⋮ Generalized isotone projection cones ⋮ An algorithm for realizing Euclidean distance matrices ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ Remarks on the quadratic orthogonal bisectional curvature ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ Mittag-Leffler vector random fields with Mittag-Leffler direct and cross covariance functions ⋮ An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ Multidimensional scaling on metric measure spaces ⋮ Robust subspace clustering based on automatic weighted multiple kernel learning ⋮ Newton's method for computing the nearest correlation matrix with a simple upper bound ⋮ 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 ⋮ Strongly Stable Stationary Points for a Class of Generalized Equations ⋮ Ordinal Distance Metric Learning with MDS for Image Ranking ⋮ Deformation of planar ring mesh under static in-plane tensile loads ⋮ The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems ⋮ Incremental Embedding Within a Dissimilarity-Based Framework ⋮ Conditional quadratic semidefinite programming: examples and methods ⋮ Vector critical points and cone efficiency in nonsmooth vector optimization ⋮ A note on optimality conditions for multi-objective problems with a Euclidean cone of preferences ⋮ Numerical methods for solving some matrix feasibility problems ⋮ A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem ⋮ The discretizable molecular distance geometry problem ⋮ An approach to geometric interpolation by Pythagorean-hodograph curves ⋮ Noisy Euclidean distance matrix completion with a single missing node ⋮ Strict linear prices in non-convex European day-ahead electricity markets ⋮ Rank of Hadamard powers of Euclidean distance matrices ⋮ On the nonnegative rank of Euclidean distance matrices ⋮ Constructions of complementarity functions and merit functions for circular cone complementarity problem ⋮ Euclidean Distance Matrices and Applications ⋮ Endotactic Networks and Toric Differential Inclusions ⋮ A Posteriori Error Estimation in Model Order Reduction of Elastic Multibody Systems with Large Rigid Motion ⋮ Puiseux Parametric Equations via the Amoeba of the Discriminant ⋮ Coordinate Difference Matrices ⋮ NOVEL ENSEMBLE TECHNIQUES FOR REGRESSION WITH MISSING DATA ⋮ A Network of Spiking Neurons for Computing Sparse Representations in an Energy-Efficient Way ⋮ An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs ⋮ A Global Approach for Solving Edge-Matching Puzzles ⋮ Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach ⋮ Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems ⋮ Coupled block diagonal regularization for multi-view subspace clustering ⋮ Matrix Support Functionals for Inverse Problems, Regularization, and Learning ⋮ Evaluation of exact quantum query complexities by semidefinite programming ⋮ ON THE NONNEGATIVITY OF THE DIRICHLET ENERGY OF A WEIGHTED GRAPH ⋮ Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
Cites Work
This page was built for publication: Equality relating Euclidean distance cone to positive semidefinite cone
