Pages that link to "Item:Q121877"

The following pages link to Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions (Q121877):

Displaying 32 items.

• edmcr (Q86506) (← links)
• A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
• Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
• On Farkas lemma and dimensional rigidity of bar frameworks (Q498344) (← 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)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
• Level-set methods for convex optimization (Q1739042) (← links)
• Preface: Special issue dedicated to distance geometry (Q1756744) (← links)
• Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
• The discretizable distance geometry problem (Q1926615) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
• A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
• A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
• An application-based characterization of dynamical distance geometry problems (Q2174892) (← links)
• Rejoinder on: ``Distance geometry and data science'' (Q2192024) (← links)
• Robust principal component analysis using facial reduction (Q2218887) (← links)
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
• Barvinok's naive algorithm in distance geometry (Q2294219) (← links)
• Iterative universal rigidity (Q2351022) (← links)
• Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Diagonally Dominant Programming in Distance Geometry (Q2835679) (← links)
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
• Distance Geometry on the Sphere (Q2958102) (← links)
• Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)
• Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)
• A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) (← links)