An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization

DOI10.1137/080733103zbMath1203.93157OpenAlexW1976414514MaRDI QIDQ3066208

Kim-Chuan Toh, Ngai-Hang Z. Leung

Publication date: 10 January 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/58306

zbMATH Keywords

molecular conformationSDPdivide-and-conqueranchor-free graph realization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Application models in control theory (93C95) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of graph theory to circuits and networks (94C15) Computational methods for problems pertaining to biology (92-08)

Related Items (7)

Stable Camera Motion Estimation Using Convex Programming ⋮ Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints ⋮ Euclidean Distance Matrices and Applications ⋮ Unnamed Item ⋮ SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ DISCO

Uses Software

• SDPT3

This page was built for publication: An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization