Pages that link to "Item:Q652286"

The following pages link to (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286):

Displaying 12 items.

• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← 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)
• On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
• A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
• Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
• A modified quasisecant method for global optimization (Q2294744) (← links)
• A DC programming approach for sensor network localization with uncertainties in anchor positions (Q2438403) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)