Pages that link to "Item:Q868476"

The following pages link to Theory of semidefinite programming for sensor network localization (Q868476):

Displaying 50 items.

• Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
• Arithmetic modeling of random processes and \(r\)-algorithms (Q380647) (← links)
• An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
• On the efficiency of routing in sensor networks (Q455964) (← links)
• Distributed localization with mixed measurements under switching topologies (Q503179) (← links)
• Universal rigidity of complete bipartite graphs (Q517442) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
• (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
• Discretization orders for distance geometry problems (Q691496) (← links)
• Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
• Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
• The discretizable molecular distance geometry problem (Q694593) (← links)
• On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
• Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
• Sum of squares method for sensor network localization (Q839485) (← links)
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
• A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
• Mathematical programming techniques for sensor networks (Q1662467) (← links)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• A note on probably certifiably correct algorithms (Q1695210) (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
• The discretizable distance geometry problem (Q1926615) (← links)
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
• Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
• An adaptation for iterative structured matrix completion (Q2072669) (← links)
• Sensitivity of low-rank matrix recovery (Q2100520) (← links)
• A block coordinate descent method for sensor network localization (Q2119759) (← links)
• Dealing with missing information in data envelopment analysis by means of low-rank matrix completion (Q2178379) (← links)
• Generically globally rigid graphs have generic universally rigid frameworks (Q2182252) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• Truncated sparse approximation property and truncated \(q\)-norm minimization (Q2322801) (← links)
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117) (← links)
• Phase retrieval via sensor network localization (Q2422613) (← links)
• On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
• Exact matrix completion via convex optimization (Q2655288) (← links)
• Characterizing the universal rigidity of generic tensegrities (Q2689816) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Six mathematical gems from the history of distance geometry (Q2827761) (← links)
• Robust Low-Rank Matrix Completion by Riemannian Optimization (Q2830625) (← links)
• Diagonally Dominant Programming in Distance Geometry (Q2835679) (← links)
• Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
• Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
• Stable Camera Motion Estimation Using Convex Programming (Q3192651) (← links)
• Hilbert mobile beacon for localisation and coverage in sensor networks (Q3497765) (← links)
• (Q4568800) (← links)
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
• Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning (Q4969047) (← links)
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
• Retracting Graphs to Cycles (Q5091228) (← links)