A trajectory algorithm based on the gradient method I. The search on the quasioptimal trajectories
β Scribed by E. G. Sturua; S. K. Zavriev
- Publisher
- Springer US
- Year
- 1991
- Tongue
- English
- Weight
- 519 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
β¦ Synopsis
The global optimization problem is considered under the assumption that the objective function is convex with respect to some variables. A finite subgradient algorithm for the search of an &-optimal solution is proposed. Results of numerical experiments are presented.
π SIMILAR VOLUMES
A semi-classical tunneling methodology combined with the use of classical trajectories is adopted in order to evaluate the tunneling splittings for bi-dirnensional surfaces of malonaldehyde and hydrogenoxalate anion proton transfer reactions. It is shown that the optimization of the tunneling path m
A new beam propagation method BPM based on the expansion of a global basis function is introduced for the numerical simulation of field propagation in optical wa¨eguides. In dealing with the boundary truncation problem, tangent-type ¨ariable transformation is applied. To show the ¨alidity and useful