A predictive Min-H method to improve convergence to optimal solutions
From MaRDI portal
Publication:4777952
DOI10.1080/00207177408932654zbMath0289.49035OpenAlexW2078659790MaRDI QIDQ4777952
Publication date: 1974
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207177408932654
Related Items (11)
Optimal control of transverse vibration of a moving string with time-varying lengths ⋮ Optimal control of vibrations of a dynamic Gao beam in contact with a reactive foundation ⋮ Maximum principle for optimal distributed control of the viscous dullin-gottwald-Holm equation ⋮ An extension of the predictive Min-H method to multivariable control ⋮ Biased penalty function algorithms for optimal control problems with terminal restraints ⋮ Comparison of optimization algorithms ⋮ Maximum principle for optimal distributed control of viscous weakly dispersive Degasperis-Procesi equation ⋮ Necessary optimality conditions for optimal distributed and (Neumann) boundary control of Burgers equation in both fixed and free final horizon cases ⋮ Optimal control of age-structured population dynamics for spread of universally fatal diseases ⋮ Optimal control of vibrations of two nonlinear Gao beams connected with a joint ⋮ Pontryagin's maximum principle for optimal control of an extrusion process
Cites Work
- Unnamed Item
- Unnamed Item
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- Optimum Control, Inequality State Constraints, and the Generalized Newton-Raphson Algorithm
- Search speed control strategies for the solution of optimal control problems
- Fast Hybrid Computer Implementation of the Dynostat Algorithm
This page was built for publication: A predictive Min-H method to improve convergence to optimal solutions
