The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
An efficient newton‐like method for molecular mechanics energy minimization of large molecules
Abstract
Techniques from numerical analysis and crystallographic refinement have been combined to produce a variant of the Truncated Newton nonlinear optimization procedure. The new algorithm shows particular promise for potential energy minimization of large molecular systems. Usual implementations of Newton's method require storage space proportional to the number of atoms squared (i.e., O(N2)) and computer time of O(N3). Our suggested implementation of the Truncated Newton technique requires storage of less than O(N1.5) and CPU time of less than O(N2) for structures containing several hundred to a few thousand atoms. The algorithm exhibits quadratic convergence near the minimum and is also very tolerant of poor initial structures. A comparison with existing optimization procedures is detailed for cyclohexane, arachidonic acid, and the small protein crambin. In particular, a structure for crambin (662 atoms) has been refined to an RMS gradient of 3.6 × 10−6 kcal/mol/Å per atom on the MM2 potential energy surface. Several suggestions are made which may lead to further improvement of the new method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
CHARMM: A program for macromolecular energy, minimization, and dynamics calculations
Brooks, B. R., Bruccoleri, R. E., Olafson, B. D., States, D. J., Swaminathan, S., & Karplus, M. (1983) · Journal of Computational Chemistry · doi:10.1002/jcc.540040211 · Cited by 14,944
The protein data bank: A computer-based archival file for macromolecular structures
Bernstein, F. C., Koetzle, T. F., Williams, G. J. B., Meyer, E. F., Brice, M. D., Rodgers, J. R., Kennard, O., Shimanouchi, T., & Tasumi, M. (1977) · Journal of Molecular Biology · doi:10.1016/s0022-2836(77)80200-3 · Cited by 8,578
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Conformational analysis. 130. MM2. A hydrocarbon force field utilizing V1 and V2 torsional terms
Allinger, N. L. (1977) · Journal of the American Chemical Society · doi:10.1021/ja00467a001 · Cited by 3,556
An all atom force field for simulations of proteins and nucleic acids
Weiner, S. J., Kollman, P. A., Nguyen, D. T., & Case, D. A. (1986) · Journal of Computational Chemistry · doi:10.1002/jcc.540070216 · Cited by 3,437
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-74503-9 · Cited by 2,804
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,539
Meijerink, J. A., & van der Vorst, H. A. (1977) · Mathematics of Computation · doi:10.1090/s0025-5718-1977-0438681-4 · Cited by 1,416
Meijerink, J. A., & van der Vorst, H. A. (1977) · Mathematics of Computation · doi:10.2307/2005786 · Cited by 794
Hendrickson, W. A., & Teeter, M. M. (1981) · Nature · doi:10.1038/290107a0 · Cited by 612
Hartmann, M. (1984) · Acta Polymerica · doi:10.1002/actp.1984.010350714 · Cited by 508
Truncated-Newton algorithms for large-scale unconstrained optimization
Dembo, R. S., & Steihaug, T. (1983) · Mathematical Programming · doi:10.1007/bf02592055 · Cited by 420
Protein folding by restrained energy minimization and molecular dynamics
Levitt, M. (1983) · Journal of Molecular Biology · doi:10.1016/s0022-2836(83)80129-6 · Cited by 363
Newton-Type Minimization via the Lanczos Method
Nash, S. G. (1984) · SIAM Journal on Numerical Analysis · doi:10.1137/0721052 · Cited by 338
Structure and dynamics of ion transport through gramicidin A
Mackay, D. H., Berens, P. H., Wilson, K. R., & Hagler, A. T. (1984) · Biophysical Journal · doi:10.1016/s0006-3495(84)84016-3 · Cited by 181
Vedani, A., & Dunitz, J. D. (1985) · Journal of the American Chemical Society · doi:10.1021/ja00311a071 · Cited by 180
Konnert, J. H. (1976) · Acta Crystallographica Section A · doi:10.1107/s0567739476001289 · Cited by 159
STEREOCHEMICALLY RESTRAINED CRYSTALLOGRAPHIC LEAST-SQUARES REFINEMENT OF MACROMOLECULE STRUCTURES
Hendrickson, W. A., & Konnert, J. H. (1981) · Elsevier eBooks · doi:10.1016/b978-1-4832-8364-7.50009-x · Cited by 121
Oie, T., Maggiora, G. M., Christoffersen, R. E., & Duchamp, D. J. (1981) · International Journal of Quantum Chemistry · doi:10.1002/qua.560200703 · Cited by 107
Biomolecular Structure and Function
(1979) · Journal of Molecular Structure · doi:10.1016/0022-2860(79)80109-x · Cited by 92
Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
Eisenstat, S. C., Schultz, M. H., & Sherman, A. H. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902019 · Cited by 84
Cited by
Mohamadi, F., Richards, N. G. J., Guida, W. C., Liskamp, R., Lipton, M., Caufield, C., Chang, G., Hendrickson, T., & Still, W. C. (1990) · Journal of Computational Chemistry · doi:10.1002/jcc.540110405 · Cited by 3,757
MDTraj: A Modern Open Library for the Analysis of Molecular Dynamics Trajectories
McGibbon, R. T., Beauchamp, K. A., Harrigan, M. P., Klein, C., Swails, J. M., Hernández, C. X., Schwantes, C. R., Wang, L.-P., Lane, T. J., & Pande, V. S. (2015) · Biophysical Journal · doi:10.1016/j.bpj.2015.08.015 · Cited by 2,373
Molecular Dynamics: Survey of Methods for Simulating the Activity of Proteins
Adcock, S. A., & McCammon, J. A. (2006) · Chemical Reviews · doi:10.1021/cr040426m · Cited by 1,272
Tinker 8: Software Tools for Molecular Design
Rackers, J. A., Wang, Z., Lu, C., Laury, M. L., Lagardère, L., Schnieders, M. J., Piquemal, J.-P., Ren, P., & Ponder, J. W. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b00529 · Cited by 1,186
Self-citationProtein–ligand docking: Current status and future challenges
Sousa, S. F., Fernandes, P. A., & Ramos, M. J. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21082 · Cited by 1,004
Metadata
- Authors
- Ponder, J. W., & Richards, F. M.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 1987-10
- Volume
- 8
- Issue
- 7
- Pages
- 1016-1024
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2128172847
- Cited by
- 880
- References
- 23
- FWCI
- 0.24
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.