Alternance properties of the solutions of non-linear minimax problems with non-linear constraints

1976 ◽  
Vol 16 (3) ◽  
pp. 236-241 ◽  
Author(s):  
V.A. Daugavet
2021 ◽  
Author(s):  
Oskar Weser ◽  
Björn Hein Hanke ◽  
Ricardo Mata

In this work, we present a fully automated method for the construction of chemically meaningful sets of non-redundant internal coordinates (also commonly denoted as Z-matrices) from the cartesian coordinates of a molecular system. Particular focus is placed on avoiding ill-definitions of angles and dihedrals due to linear arrangements of atoms, to consistently guarantee a well-defined transformation to cartesian coordinates, even after structural changes. The representations thus obtained are particularly well suited for pathway construction in double-ended methods for transition state search and optimisations with non-linear constraints. Analytical gradients for the transformation between the coordinate systems were derived for the first time, which allows analytical geometry optimizations purely in Z-matrix coordinates. The geometry optimisation was coupled with a Symbolic Algebra package to support arbitrary non-linear constraints in Z-matrix coordinates, while retaining analytical energy gradient conversion. Sample applications are provided for a number of common chemical reactions and illustrative examples where these new algorithms can be used to automatically produce chemically reasonable structure interpolations, or to perform non-linearly constrained optimisations of molecules.


1983 ◽  
Vol 11 (4) ◽  
pp. 343-346
Author(s):  
Leif Jansson ◽  
Erik Mellander

2004 ◽  
Vol 49 (3-4) ◽  
pp. 385-417 ◽  
Author(s):  
Gláucio Terra ◽  
Marcelo H. Kobayashi

Author(s):  
Franz Brauße ◽  
Konstantin Korovin ◽  
Margarita V. Korovina ◽  
Norbert Th. Müller

Abstract is a CDCL-style calculus for solving non-linear constraints over the real numbers involving polynomials and transcendental functions. In this paper we investigate properties of the calculus and show that it is a $$\delta $$ δ -complete decision procedure for bounded problems. We also propose an extension with local linearisations, which allow for more efficient treatment of non-linear constraints.


Sign in / Sign up

Export Citation Format

Share Document