An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization

DOI10.1137/080733103MaRDI QIDQ3066208zbMATH OpenOpenAlexFDO

Authors Ngai-Hang Z. Leung, Kim-Chuan Toh

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

divide-and-conquermolecular conformationSDPanchor-free graph realization

Mathematics Subject Classification ID

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

Recommendations

• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• Using a distributed SDP approach to solve simulated protein molecular conformation problems
• The discretizable molecular distance geometry problem
• Recent advances on the discretizable molecular distance geometry problem
• The discretizable distance geometry problem

Cited in

(10)

• Single-cell 3D genome reconstruction in the haploid setting using rigidity theory
• Using a distributed SDP approach to solve simulated protein molecular conformation problems
• DISCO
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
• A Euclidean distance matrix model for protein molecular conformation
• Euclidean distance matrices and applications
• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• Maxent-stress optimization of 3D biomolecular models
• Stable camera motion estimation using convex programming

Describes a project that uses

Uses Software

• SDPT3

This page was built for publication: An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066208)