Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
From MaRDI portal
Publication:811878
DOI10.1007/s10898-004-6100-2zbMath1093.90060OpenAlexW2028090065MaRDI QIDQ811878
Claire S. Adjiman, Ioannis Papamichail
Publication date: 23 January 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-6100-2
Related Items (4)
A review of recent advances in global optimization ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Generalized McCormick relaxations ⋮ Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- Control parametrization: a unified approach to optimal control problems with general constraints
- Global minimum potential energy conformations of small molecules
- Rigorous convex underestimators for general twice-differentiable problems
- A rigorous global optimization algorithm for problems with ordinary differential equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Jointly Constrained Biconvex Programming
- Optimal control via collocation and non-linear programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Use of orthogonal collocation method in optimal control problems
- An Algorithm for Separable Nonconvex Programming Problems
- Deterministic global optimization in nonlinear optimal control problems
- Optimal control
This page was built for publication: Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
