Monday, 15:15 - 15:40 h, Room: H 2036


Sunyoung Kim
A successive SDP relaxation method for distance geometry problems

Coauthors: Masakazu Kojima, Makoto Yamashita


We present a numerical method using cliques and successive application of
sparse semidefinite programming relaxation (SFSDP) for determining the
structure of the conformation of large molecules from the Protein Data Bank.
A subproblem of a clique and its neighboring nodes is initially solved by SFSDP
and refined by the gradient method. This subproblem is gradually
expanded to the entire problem by fixing the nodes computed with high
accuracy as anchors and successively applying SFSDP. Numerical experiments
show that the performance of the proposed algorithm is robust and efficient.


Talk 1 of the contributed session Mon.3.H 2036
"Semidefinite programming applications" [...]
Cluster 4
"Conic programming" [...]


  Online lending company provides a wide range of ways to get money by means of Payday Loans Tennessee. Of course, the choice is not that easy, as there exist great number of different preparations. Notwithstanding, Cialis is the one that definitely differs from all other products.