Noisy Euclidean distance matrix completion with a single missing node (Q2010104): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-019-00825-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2970165350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Matrices and Their Applications in Rigidity Theory / 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: Exact and Approximate Solutions of Source Localization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Minimization Schemes for Solving the Single Source Localization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Squares Algorithms for Time-of-Arrival-Based Mobile Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality relating Euclidean distance cone to positive semidefinite cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensor network localization, Euclidean distance matrix completions, and graph realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate Shadows of Semidefinite and Euclidean Distance Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distance matrix completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Euclidean and non-Euclidean 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: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Matrices and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Geometry and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized trust region subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest Euclidean distance matrix with low embedding dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Problems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / 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: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank

Latest revision as of 04:53, 21 July 2024

scientific article
Language Label Description Also known as
English
Noisy Euclidean distance matrix completion with a single missing node
scientific article

    Statements

    Noisy Euclidean distance matrix completion with a single missing node (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    single source localization
    0 references
    noise
    0 references
    Euclidean distance matrix completion
    0 references
    semidefinite programming
    0 references
    wireless communication
    0 references
    facial reduction
    0 references
    generalized trust region subproblem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references