Dynamic programming and penalty functions
From MaRDI portal
Recommendations
- Dynamic programming and the Lagrange multipliers
- Dynamic programming and inequalities
- The principle and models of dynamic programming
- Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method
- On penalty function methods for nonlinear programming problems
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3168214 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3209277 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3307166 (Why is no real title available?)
- scientific article; zbMATH DE number 3326170 (Why is no real title available?)
- scientific article; zbMATH DE number 3334757 (Why is no real title available?)
- scientific article; zbMATH DE number 3198484 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- An approach to nonlinear programming
- Analytic Inequalities
- Combined Primal-Dual and Penalty Methods for Constrained Minimization
- Dynamic programming and inequalities
- Dynamic programming and the Lagrange multipliers
- Dynamic programming approach to inequalities
- Functional equation approach to inequalities
- Functional equation approach to inequalities. II
- Functional equation approach to inequalities. III
- Functional equations in dynamic programming
- ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
- On the combination of the multiplier method of Hestenes and Powell with Newton's method
- On the method of multipliers for mathematical programming problems
- Quasilinearization and invariant imbedding. With applications to chemical engineering and adaptive control
- The art and theory of dynamic programming
- The multiplier method of Hestenes and Powell applied to convex programming
- The principle and models of dynamic programming
- The principle and models of dynamic programming. II
- The principle and models of dynamic programming. III
- The principle and models of dynamic programming. IV
- The principle and models of dynamic programming. V
Cited in
(5)- A dynamic penalty function method for the solution of structural optimization problems
- Solving NLP problems with dynamic system approach based on smoothed penalty function
- scientific article; zbMATH DE number 3945826 (Why is no real title available?)
- scientific article; zbMATH DE number 1985615 (Why is no real title available?)
- Infinite-horizon deterministic dynamic programming in discrete time: a monotone convergence principle and a penalty method
This page was built for publication: Dynamic programming and penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749459)