Pages that link to "Item:Q374660"

The following pages link to Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660):

Displaying 30 items.

• A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
• Localization from incomplete noisy distance measurements (Q358631) (← links)
• New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← 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)
• Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
• On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
• Theory of semidefinite programming for sensor network localization (Q868476) (← links)
• A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
• An efficient method for non-negative low-rank completion (Q1986538) (← links)
• Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
• Low-rank matrix completion in a general non-orthogonal basis (Q2032243) (← links)
• The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
• Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
• A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
• Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
• Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs (Q2907493) (← links)
• Theory of semidefinite programming for sensor network localization (Q2921695) (← links)
• Universal Rigidity and Edge Sparsification for Sensor Network Localization (Q3083321) (← links)
• On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 (Q4609775) (← links)
• (Q4631286) (← links)
• Exploiting Sparsity in SDP Relaxation for Sensor Network Localization (Q5189557) (← links)
• Preface (Q5970301) (← links)
• Cycle-based formulations in distance geometry (Q6114894) (← links)
• A dual basis approach to multidimensional scaling (Q6185978) (← links)