Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Dmitriy Drusvyatskiy / rank
Normal rank
 
Property / author
 
Property / author: Dmitriy Drusvyatskiy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: frlib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W624923763 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.2037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closedness criteria for the image of a closed set by a inear operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidian Distance Matrix Completion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3665778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block matrices and multispherical structure of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cone of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multispherical Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majorization for the eigenvalues of Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connection between positive semidefinite and Euclidean distance matrix completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Closedness of the Linear Image of a Closed Convex Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bad Semidefinite Programs: They All Look the Same / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Linear Matrix Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distance matrices: new characterization and boundary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circum-Euclidean distance matrices and faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial reduction algorithms for conic optimization problems / rank
 
Normal rank

Latest revision as of 07:59, 10 July 2024

scientific article; zbMATH DE number 6449611
Language Label Description Also known as
English
Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
scientific article; zbMATH DE number 6449611

    Statements

    Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2015
    0 references
    matrix completion
    0 references
    semidefinite programming
    0 references
    Euclidean distance matrices
    0 references
    facial reduction
    0 references
    Slater condition
    0 references
    projection
    0 references
    closedness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references