On a functional equation of Bellman in the theory of dynamic programming.
On a general dynamic programming problem
On a new superposition principle for optimization problem
On the equivalence of variational problems. II
Elements of general theory of infinitely prolonged underdetermined systems of ordinary differential equations are outlined and applied to the equivalence of one-dimensional constrained variational integrals. The relevant infinite-dimensional variant of Cartan’s moving frame method expressed in quite elementary terms proves to be surprisingly efficient in solution of particular equivalence problems, however, most of the principal questions of the general theory remains unanswered. New concepts of...
On the existence of a weak solution of the boundary value problem for the equilibrium of a shallow shell reinforced with stiffening ribs
The existence and the unicity of a weak solution of the boundary value problem for a shallow shell reinforced with stiffening ribs is proved by the direct variational method. The boundary value problem is solved in the space , on which the corresponding bilinear form is coercive. A finite element method for numerical solution is introduced. The approximate solutions converge to a weak solution in the space .
On the functional equation of Bellman in the theory of dynamic programming. (Short Communication).
On the theory of one-sided models in spaces with arbitrary cones.
On the transversal distribution and the complete figure in the second order multiple integral problem in the calculus of variations.
On the Two Armed Bandit with one Probability Known.
On variational approach to the Hamilton-Jacobi PDE
In this paper we construct a minimizing sequence for the problem (1). In particular, we show that for any subsolution of the Hamilton-Jacobi equation there exists a minimizing sequence weakly convergent to this subsolution. The variational problem (1) arises from the theory of computer vision equations.
Optimal control of a linear discrete system
Optimal Stratification and Grouping by Dynamic Programming.
Ottimizzazione dei sistemi di controllo a parametri distribuiti : condizioni necessarie di ottimalità. Punto di vista della programmazione dinamica