Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 709-728 |
| Number of pages | 20 |
| Journal | Journal of Global Optimization |
| Volume | 76 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Apr 2020 |
Keywords
- Accelerated block coordinate descent method
- Euclidean distance matrix
- Majorized penalty approach
- Protein molecular conformation
Fingerprint
Dive into the research topics of 'A Euclidean distance matrix model for protein molecular conformation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver