Theory of semidefinite programming for sensor network localization (Q868476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph rigidity via Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigidity and realizability of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two theorems on Euclidean distance matrices and Gale transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Wireless Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-dimensional embedding with extra information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of distance geometry and convex properties of quadratic maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Trajectories in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some distance properties of latent root and vector methods used in multivariate analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Molecule Problem: Exploiting Structure in Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Continuation for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional scaling. I: Theory and method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix completion by numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of classical multidimensional scaling via variable reduction / rank
 
Normal rank

Latest revision as of 14:28, 25 June 2024

scientific article
Language Label Description Also known as
English
Theory of semidefinite programming for sensor network localization
scientific article

    Statements

    Theory of semidefinite programming for sensor network localization (English)
    0 references
    0 references
    0 references
    5 March 2007
    0 references
    Euclidean distance geometry
    0 references
    graph realization
    0 references
    sensor network localization
    0 references
    semidefinite programming
    0 references
    rigidity theory
    0 references
    0 references
    0 references
    0 references

    Identifiers

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