A Euclidean distance matrix model for protein molecular conformation

Protein molecular conformation is an important and challenging problem in biophysics. It is to recover the structure of proteins based on limited information such as noised distances, lower and upper bounds on some distances between atoms. In this paper, based on the recent progress in numerical algorithms for Euclidean distance matrix (EDM) optimization problems, we propose a EDM model for protein molecular conformation. We reformulate the problem as a rank-constrained least squares problem with linear equality constraints, box constraints, as well as a cone constraint. Due to the nonconvexity of the problem, we develop a majorized penalty approach to solve the problem. We apply the accelerated block coordinate descent algorithm proposed in Sun et al. (SIAM J Optim 26(2):1072–1100, 2016 ) to solve the resulting subproblem. Extensive numerical results demonstrate the efficiency of the proposed model.

[1]  Kim-Chuan Toh,et al.  An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization , 2009, SIAM J. Sci. Comput..

[2]  Jorge J. Moré,et al.  Distance Geometry Optimization for Protein Structures , 1999, J. Glob. Optim..

[3]  Kim-Chuan Toh,et al.  QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming , 2015, Mathematical Programming Computation.

[4]  Yifan Hu,et al.  A Maxent-Stress Model for Graph Layout , 2012, IEEE Transactions on Visualization and Computer Graphics.

[5]  Houduo Qi,et al.  An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization under Ordinal Constraints , 2017 .

[6]  Chao Ding,et al.  Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction , 2014, Mathematical Programming.

[7]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[8]  Kim-Chuan Toh,et al.  A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation , 2008, SIAM J. Sci. Comput..

[9]  Kim-Chuan Toh,et al.  An inexact primal–dual path following algorithm for convex quadratic SDP , 2007, Math. Program..

[10]  Kim-Chuan Toh,et al.  Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems , 2013, Distance Geometry.

[11]  Leo Liberti,et al.  A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem , 2008, Int. Trans. Oper. Res..

[12]  Panos M. Pardalos,et al.  Some Properties for the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems , 2003, J. Glob. Optim..

[13]  Chao Ding,et al.  Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation , 2017, Comput. Optim. Appl..

[14]  Houduo Qi,et al.  A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem , 2013, SIAM J. Matrix Anal. Appl..

[15]  Y. Ye,et al.  A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network Localization , 2006 .

[16]  Danny C. Sorensen,et al.  On the use of directions of negative curvature in a modified newton method , 1979, Math. Program..

[17]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[18]  Nelson Maculan,et al.  Clifford Algebra and the Discretizable Molecular Distance Geometry Problem , 2015 .

[19]  I. J. Schoenberg.  Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert , 1935 .

[20]  Kim-Chuan Toh,et al.  A block symmetric Gauss–Seidel decomposition theorem for convex composite quadratic programming and its applications , 2017, Mathematical Programming.

[21]  Kim-Chuan Toh,et al.  A partial proximal point algorithm for nuclear norm regularized matrix least squares problems , 2014, Math. Program. Comput..

[22]  Kim-Chuan Toh,et al.  An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming , 2015, SIAM J. Optim..

[23]  Le Thi Hoai An.  Solving Large Scale Molecular Distance Geometry Problems by a Smoothing Technique via the Gaussian Transform and D.C. Programming , 2003, J. Glob. Optim..

[24]  A. Householder,et al.  Discussion of a set of points in terms of their mutual distances , 1938 .

[25]  Xiaoming Yuan,et al.  Computing the nearest Euclidean distance matrix with low embedding dimensions , 2014, Math. Program..

[26]  Martin Vetterli,et al.  Euclidean Distance Matrices: Essential theory, algorithms, and applications , 2015, IEEE Signal Processing Magazine.

[27]  Richard H. Byrd,et al.  A Stochastic/Perturbation Global Optimization Algorithm for Distance Geometry Problems , 1997, J. Glob. Optim..

[28]  Kim-Chuan Toh,et al.  Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements , 2006, IEEE Transactions on Automation Science and Engineering.

[29]  Donghui Li,et al.  A projected semismooth Newton method for problems of calibrating least squares covariance matrix , 2011, Oper. Res. Lett..

[30]  Jean B. Lasserre,et al.  Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity , 2016, Mathematical Programming Computation.

[31]  Gabriëlle M. Donné-Op den Kelder.  Distance geometry and molecular conformation: G. M. Crippen and T. F. Havel, John Wiley & Sons, 1988. $223.201 £59.50 (x + 541 pages) ISBN 0 471 92061 4 , 1989 .

[32]  Xiaoming Yuan,et al.  A Lagrangian Dual Approach to the Single-Source Localization Problem , 2013, IEEE Transactions on Signal Processing.

[33]  Leo Liberti,et al.  Euclidean Distance Geometry and Applications , 2012, SIAM Rev..

[34]  Qingna Li,et al.  Ordinal Distance Metric Learning with MDS for Image Ranking , 2018, Asia Pac. J. Oper. Res..