๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A successive approximation algorithm for stochastic control problems

โœ Scribed by M.H. Chang; K. Krishna

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
458 KB
Volume
18
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Successive Approximate Algorithm for Bes
Successive Approximate Algorithm for Best Approximation from a Polyhedron
โœ Shusheng Xu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

Suppose K is the intersection of a finite number of closed half-spaces [K i ] in a Hilbert space X, and x # X "K. Dykstra's cyclic projections algorithm is a known method to determine an approximate solution of the best approximation of x from K, which is denoted by P K (x). Dykstra's algorithm redu