Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software

DOI10.1016/0096-3003(96)00002-1zbMath0859.65062OpenAlexW2081433316MaRDI QIDQ1923346

Jaroslav Doležal, Jiří Fidler

Publication date: 12 November 1996

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(96)00002-1

zbMATH Keywords

dynamic optimizationoptimal control problemsinteractive environment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)

Uses Software

• LANCELOT
• PCOMP
• FSQP
• PADMOS

Cites Work

• Truncated Newton method for sparse unconstrained optimization using automatic differentiation
• Automatic differentiation: techniques and applications
• Optimal control of discrete systems involving delays
• An outer approximations algorithm for computer-aided design problems
• On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
• A mathematical basis for satisficing decision making
• Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
• An Efficient Method to Solve the Minimax Problem Directly
• Algorithm 746: PCOMP—a Fortran code for automatic differentiation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software