One-at-a-time dynamic programming over polytope

DOI10.1016/0005-1098(75)90025-4zbMath0331.90060OpenAlexW2094925293MaRDI QIDQ1227532

L. Silman, Ury Passy

Publication date: 1975

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(75)90025-4

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99) Numerical methods in optimal control (49M99)

Related Items (2)

Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming ⋮ Convergence rate analysis of the state increment dynamic programming method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

This page was built for publication: One-at-a-time dynamic programming over polytope