The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Energy-Represented Direct Inversion in the Iterative Subspace within a Hybrid Geometry Optimization Method
Abstract
A geometry optimization method using an energy-represented direct inversion in the iterative subspace algorithm, GEDIIS, is introduced and compared with another DIIS formulation (controlled GDIIS) and the quasi-Newton rational function optimization (RFO) method. A hybrid technique that uses different methods at various stages of convergence is presented. A set of test molecules is optimized using the hybrid, GEDIIS, controlled GDIIS, and RFO methods. The hybrid method presented in this paper results in smooth, well-behaved optimization processes. The optimization speed is the fastest among the methods considered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
A new approach to variable metric algorithms
Fletcher, R. (1970) · The Computer Journal · doi:10.1093/comjnl/13.3.317 · Cited by 4,068
Conditioning of quasi-Newton methods for function minimization
Shanno, D. F. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0274029-x · Cited by 3,872
A family of variable-metric methods derived by variational means
Goldfarb, D. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0258249-6 · Cited by 3,325
The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
BROYDEN, C. G. (1970) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/6.1.76 · Cited by 2,874
Convergence acceleration of iterative sequences. the case of scf iteration
Pulay, P. (1980) · Chemical Physics Letters · doi:10.1016/0009-2614(80)80396-4 · Cited by 2,612
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737
Improved SCF convergence acceleration
Pulay, P. (1982) · Journal of Computational Chemistry · doi:10.1002/jcc.540030413 · Cited by 1,323
Encyclopedia of computational chemistry
(1999) · Choice Reviews Online · doi:10.5860/choice.36-5691 · Cited by 1,141
Search for stationary points on surfaces
Banerjee, A., Adams, N., Simons, J., & Shepard, R. (1985) · The Journal of Physical Chemistry · doi:10.1021/j100247a015 · Cited by 833
Methods for optimizing large molecules. II. Quadratic search
Farkas, Ö., & Schlegel, H. B. (1999) · The Journal of Chemical Physics · doi:10.1063/1.480484 · Cited by 171
Recent advances in unconstrained optimization
Powell, M. J. D. (1971) · Mathematical Programming · doi:10.1007/bf01584071 · Cited by 158
Cited by
TD-DFT Assessment of Functionals for Optical 0–0 Transitions in Solvated Dyes
Jacquemin, D., Planchat, A., Adamo, C., & Mennucci, B. (2012) · Journal of Chemical Theory and Computation · doi:10.1021/ct300326f · Cited by 481
Density Functional Theory for Electrocatalysis
Liao, X., Lu, R., Xia, L., Liu, Q., Wang, H., Zhao, K., Wang, Z., & Zhao, Y. (2022) · ENERGY & ENVIRONMENTAL MATERIALS · doi:10.1002/eem2.12204 · Cited by 420
Schlegel, H. B. (2011) · WIREs Computational Molecular Science · doi:10.1002/wcms.34 · Cited by 360
Choosing a Functional for Computing Absorption and Fluorescence Band Shapes with TD-DFT
Charaf-Eddin, A., Planchat, A., Mennucci, B., Adamo, C., & Jacquemin, D. (2013) · Journal of Chemical Theory and Computation · doi:10.1021/ct4000795 · Cited by 286
Membrane alternatives in worlds without oxygen: Creation of an azotosome
Stevenson, J., Lunine, J., & Clancy, P. (2015) · Science Advances · doi:10.1126/sciadv.1400067 · Cited by 87
Metadata
- Authors
- Li, X., & Frisch, M. J.
- Venue
- Journal of Chemical Theory and Computation
- Publisher
- American Chemical Society (ACS)
- Published
- 2006-04-18
- Volume
- 2
- Issue
- 3
- Pages
- 835-839
- ISSN
- 1549-9618 (ISSN-L)
- 1549-9626
- OpenAlex
- W2010273809
- Cited by
- 483
- References
- 13
- FWCI
- 0.64
- 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.