Calculation method for dynamic optimization, using quadratic approximations to the minimum surface

DOI10.1016/0005-1098(71)90009-4zbMath0231.49019OpenAlexW2053528868MaRDI QIDQ2550543

P. J. A. Lekkerkerker, T. W. Oerlemans

Publication date: 1971

Published in: Automatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Feedback control (93B52) Dynamic programming (90C39)

Cites Work

• Approximate synthesis of optimal control
• A Steepest-Ascent Method for Solving Optimum Programming Problems
• An Algorithm for the Iterative Solution of a Class of Two-Point Boundary Value Problems
• On the Nature of the Spectrum of Singular Second Order Linear Differential Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Calculation method for dynamic optimization, using quadratic approximations to the minimum surface