✦ LIBER ✦

The optimal route problem and the method of approximation in policy space

✍ Scribed by D Davidson; D.J White

Publisher: Elsevier Science
Year: 1970
Tongue: English
Weight: 116 KB
Volume: 32
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90311-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the equivalence of optimality criteri

On the equivalence of optimality criterion and sequential approximate optimization methods in the classical topology layout problem

✍ Albert A. Groenwold; L. F. P. Etman 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 411 KB

Approximation methods in the space of in

Approximation methods in the space of integer functions in the solution of “bottleneck” problems

✍ T.M. Pervozvanskaya 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 532 KB

Optimal approximation and the method of

Optimal approximation and the method of least squares

✍ F.J. Delvos; Walter Schempp 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 397 KB

An approximate method of solving the lin

An approximate method of solving the linear time optimal problem

✍ V.A. Sokol; N.T. Tynyanskii 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 753 KB

Successive approximation methods for the

Successive approximation methods for the solution of optimal control problems

✍ S.K. Mitter 📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 801 KB

IN THIS paper we present some successive approximation methods for the solution of a general class of optimal control problems. The class of problems considered is known as the Bolxa Problem in the Calculus of Variations [l]. The algorithms considered are extensions of the gradient methods due to KE

The method of successive approximations

The method of successive approximations in optimal control problems with boundary conditions

✍ V.A. Srochko; R.G. Khamidulin 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 867 KB