Abstract
The majority of problems in structural computational biology require minimization of the energy function (force field) defined on the molecule geometry. This makes it possible to determine properties of molecules, predict the correct arrangement of protein chains, find the best molecular docking for complex formation, verify hypotheses concerning the protein design, and solve other problems arising in modern drug development. In the case of low-molecular compounds (consisting of less than 250 atoms), the problem of finding the geometry that minimizes the energy function is well studied. The minimization of macromolecules (in particular, proteins) consisting of tens of thousands of atoms is more difficult. However, a distinctive feature of statements of these problems is that initial approximations that are close to the solution are often available. Therefore, the original problem can be formulated as a problem of nonconvex optimization in the space of about \({{10}^{4}}\) variables. The complexity of computing the function and its gradient is quadratic in the number variables. A comparative analysis of gradient-free methods with gradient-type methods (gradient descent, fast gradient descent, conjugate gradient, and quasi-Newton methods) in their GPU implementations is carried out.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
E.A. Coutsias et al., “A kinematic view of loop closure,” J. Comput. Chem. 25, 510–528 (2004).
W.D. Cornell et al., “A Second generation force field for the simulation of proteins, nucleic acids, and organic molecules,” J. Am. Chem. Soc. 117 (19), 5179–5197 (1995).
S. Guminov et al., “A universal modification of the linear coupling method,” Optim. Meth. Software 34, 560–577 (2019).
M. M. T. Chakravarty et al., “Accelerate: An embedded language for accelerated array processing,” http://hackage.haskell.org/package/accelerate
P. Yakovlev et al., “Algorithms for local minimization of 3D molecules OPLS force field,” (2018). arXiv:1810.03358
A. A. Canutescu and R. L. Dunbrack, “Cyclic coordinate descent: A robotics algorithm for protein loop closure,” Protein Sci. 12, 963–972 (2003).
J. Huang et al., “CHARMM36m: An improved force field for folded and intrinsically disordered proteins,” Nature Meth. 14, 71–73 (2017).
M. De Berg et al., “Computational geometry,” Computational Geometry (Springer, 2000), pp. 1–17.
A. R. Conn, K. Scheinberg, and L. N. Vicente, Introduction to Derivative-Free Optimization (SIAM, 2009).
J. Nutini et al., “Coordinate descent converges faster with the Gauss-Southwell rule than random selection,” Int. Conf. on Machine Learning, 2015, pp. 1632–1641.
CUDA: Parallel computing platform and programming model developed by NVIDIA. https://developer.nvidia.com/cuda-zone
J. D. Lee et al., “First-order methods almost always avoid saddle points,” 2017. arXiv: 1710.07406
A. Gasnikov, “Universal gradient descent,” 2017. arXiv: 1711.00394
S. Ghadimi and G. Lan, Stochastic first-and zeroth-order methods for nonconvex stochastic programming," SIAM J. Optim. 23, 2341–2368 (2013).
S. Ghadimi, G. Lan, and H. Zhang, “Generalized uniformly optimal methods for nonlinear programming,” 2015. arXiv: 1508.07384
J. D. Lee et al., “Gradient descent only converges to minimizers,” Conf. on Learning Theory, 2016, pp. 1246–1257.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, Mass., 2001).
J. Janin, Welcome to CAPRI: A critical assessment of predicted interactions," Proteins: Struct. Func. Bioinform. 47, 257 (2002).
W. L. Jorgensen, D. S. Maxwell, and J. Tirado-Rives, “Development and testing of the OPLS all-atom force field on conformational energetics and properties of organic liquids,” J. Am. Chem. Soc. 118 (45), 11225–11236 (1996).
Y. Carmon et al., “Lower bounds for finding stationary points I,” 2017. arXiv: 1710.11606
Y. Carmon et al., “Lower bounds for finding stationary points II: First-order methods,” 2017. arXiv: 1711.00841
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course (Springer Science & Business Media, 2013).
Y. Nesterov and V. Spokoiny, “Random gradient-free minimization of convex functions,” Foundat. Comput. Math. 17, 527–566 (2017).
J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed. (Springer, New York, 2006).
B. O’Donoghue and E. Candes, “Adaptive restart for accelerated gradient schemes,” Found. Comput. Math. 15, 715–732 (2015).
J. W. Ponder and D. A. Case, “Force fields for protein simulations,” Adv. Protein Chem. 66, 27–85 (2003).
Y. Nesterov et al., “Primal-dual accelerated gradient descent with line search for convex and nonconvex optimization problems” (2018). arXiv: 1809.05895
G. M. Sastry et al., “Protein and ligand preparation: Parameters, protocols, and influence on virtual screening enrichments,” J. Comput. Aided Mol. Des. 27, 221–234 (2013).
W. C. Still et al., “Semianalytical treatment of solvation for molecular mechanics and dynamics, J. Am. Chem. Soc. 112 (16), 6127–6129 (1990).
W. Su, S. Boyd, and E. Candes, “A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights,” Adv. Neural Inf. Process. Syst. 2510–2518 (2014).
A. J. M. Sweere and J. G. E. M. Fraaije, “Accuracy test of the OPLS-AA force field for calculating free energies of mixing and comparison with PAC-MAC,” J. Chem. Theory Comput. 13, 1911–1923 (2017).
T. Vreven et al., “Updates to the integrated protein–protein interaction benchmarks: Docking benchmark version 5 and afinity benchmark version 2,” J. Mol. Biol. 427 (19), 3031–3041 (2015).
D. J. Wales and J. P. Doye, “Global optimization by basin-hopping and the lowest energy structures of Lennard–Jones clusters containing up to 110 atoms.” J. Phys. Chem. A. 101 (28), 5111–5116 (1997).
N. Wilt, The CUDA Handbook: A Comprehensive Guide to GPU Programming (Pearson Education, 2013).
S. J. Wright, “Coordinate descent algorithms,” Math. Program. 151, 3–34 (2015).
A. A. Zhigljavsky, Theory of Global Random Search (Springer Science & Business Media, 2012).
A. Zhigljavsky and A. Zilinskas, Stochastic Global Optimization (Springer Science & Business Media, 2008).
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning (MIT Press, Cambridge, Mass., 2016).
A. A. Zhmurov and V. A. Barsegov, Simulation of Biological Systems on GPU (Mosk. Fiz.-Tekhn. Inst., Moscow, 2013) [in Russian].
A. S. Nemirovski and D. B. Yudin, Problem Complexity and Method Efficiency in Optimization, Interscience Series in Discrete Mathematics (Nauka, Moscow, 1979; Wiley, 1983), Vol. XV.
B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).
M. A. Posypkin, “Methods and distributed software infrastructure for numerical search of molecular clusters with minimal energy,” Vest. Nizhn. Novgorod Univ., No. 1, 210–219 (2010).
ACKNOWLEDGMENTS
We are grateful to A.I. Golikov and Yu.G. Evtushenko for valuable remarks that helped improve the initial text of the paper.
Funding
The work by A.Yu. Gornov was supported by the Russian Foundation for Basic Research, project no. 18-07-00587. The work by A.S. Anikin was supported by the Russian Foundation for Basic Research, project no. 18-29-03071. The work by A.V. Gasnikov was supported by the Russian Science Foundation, project no. 17-11-01027.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by A. Klimontovich
Rights and permissions
About this article
Cite this article
Yakovlev, P.A., Anikin, A.S., Bol’shakova, O.A. et al. Local Algorithms for Minimizing the Force Field for 3D Representation of Macromolecules. Comput. Math. and Math. Phys. 59, 1994–2008 (2019). https://doi.org/10.1134/S0965542519120030
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542519120030