Modifications are made to a previously published algorithm for constrained optimization in Cartesian coordinates (J. Comp. Chem., 13,240, 1992) to incorporate both fmed and dummy atoms. Standard distance and angle constraints can now be specified with respect to dummy atoms, greatly extending the ra
Constrained optimization in delocalized internal coordinates
β Scribed by Baker, Jon
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 248 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
β¦ Synopsis
Using the recently introduced delocalized internal coordinates, in conjunction with the classical method of Lagrange multipliers, an algorithm for constrained optimization is presented in which the desired constraints do not have to be satisfied in the starting geometry. The method used is related to a previous algorithm by the same author for constrained optimization in Cartesian w Ε½ .x coordinates J. Comput. Chem., 13, 240 1992 , but is simpler and far more Ε½ . efficient. Any internal distance or anglertorsion constraint can be imposed between any atoms in the system whether or not the atoms involved are formally bonded. Imposed constraints can be satisfied exactly.
π SIMILAR VOLUMES
Eight protein-ligand complexes were simulated by using global optimization of a complex energy function, including solvation, surface tension, and side-chain entropy in the internal coordinate space of the flexible ligand and the receptor side chains [Abagyan, R.
## Abstract The smallβamplitude conformational changes in macromolecules can be described by the changes in bond lengths and bond angles. The descriptors of large scale changes are torsions. We present a recursive algorithm, in which a bond vector is explicitly written in terms of these internal, o