Semideterministic global optimization method: Application to a control problem of the Burgers equation
DOI10.1007/s10957-007-9251-8zbMath1146.90053OpenAlexW1994392184MaRDI QIDQ2483031
Benjamin Ivorra, Bijan Mohammadi, Angel Manuel Ramos
Publication date: 5 May 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9251-8
Burgers equationGenetic algorithmGlobal optimizationOptimal control problemSemideterministic algorithm
Nonconvex programming, global optimization (90C26) Existence theories for optimal control problems involving ordinary differential equations (49J15)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid method for aerodynamic shape optimization in automotive industry
- On the limited memory BFGS method for large scale optimization
- Pointwise control of the Burgers equation and related Nash equilibrium problems: Computational approach
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Semi-deterministic and genetic algorithms for global optimization of microfluidic protein-folding devices
- A low-complexity global optimization algorithm for temperature and pollution control in flames with complex chemistry
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
This page was built for publication: Semideterministic global optimization method: Application to a control problem of the Burgers equation