Rao Mease: Difference between revisions
Appearance
RobertLampel (talk | contribs) No edit summary |
RobertLampel (talk | contribs) No edit summary |
||
| Line 38: | Line 38: | ||
[[Category:MIOCP]] | [[Category:MIOCP]] | ||
[[Category:Sensitivity-seeking arcs]] | |||
Revision as of 08:30, 20 August 2025
| Rao Mease | |
|---|---|
| State dimension: | 1 |
| Differential states: | 1 |
| Discrete control functions: | 1 |
The Rao Mease problem is a very sensitive one-dimensional toy ODE model which is especially suited for multiple shooting solvers. It aims to minimize a quadratic Lagrange term.
The optimal integer control functions exhibits a singular arc.
Mathematical formulation
Reference Solutions
Here is one local solution to the above control problem.
- Reference solution plots
-
States and discretized control for a local optimum.
Miscellaneous and Further Reading
The problem description and further references can be found in the PhD thesis of Michael Ernst Geiger [1].
References
[1] "Adaptive Multiple Shooting for Boundary Value Problems and Constrained Parabolic Optimization Problems" by M. E. Geiger