𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comput. and autom.: Bress, D. L. ‘Computers and cartography’. Vol 21 (August 1972) No 8, pp. 25–26

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
241 KB
Volume
5
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis

Fhe authors introduce refinements into the randomized pattern search method The randomized method of Lawrence and Stelghtz augments the ability of the method to adapt to direction An algorithm is derived that makes the method more adaptive in step size and incorporates penaltv terms to accommodate constraints The algorithm is robust and rehable and offers a scheme for obtaining ball-park estimates of a constrained global minimum Fletcher, R 73 2 'Fortran subroutines for minimization by quasi-Newton methods' Atomic Energy Res Est , Harwell, England (June 1972) 31 pp Two quasi-Newton subroutines are presented for minimizing a function F(x) of n variables x The gradient vector and the Hessian matrix are assumed to exist

📜 SIMILAR VOLUMES

A non-parametric valley-seeking techniqu
A non-parametric valley-seeking technique for cluster analysis: Koontz, W. L. G. and Fukimaga, K.Inst. Elect. Electron. Eng. Trans. Comput., Vol C-21, No 2 (February 1972), pp 171–178
📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 143 KB

The authors present an algorithm which applies to a large class of minimum-time problems. It can be applied to any minimumtime norm-constraint problem for which the control is explicitly characterized by a separating hyperplane. It can also be extended to simple linear distributed systems, under cer