Variational calculus and optimal control (2nd ed.): optimization with elementary convexity
Variational calculus and optimal control (2nd ed.): optimization with elementary convexity
Efficient sensitivity analysis of large-scale differential-algebraic systems
Applied Numerical Mathematics
Deterministic Global Optimization in Nonlinear Optimal Control Problems
Journal of Global Optimization
A Rigorous Global Optimization Algorithm for Problems with Ordinary Differential Equations
Journal of Global Optimization
Convexity of reachable sets of nonlinear ordinary differential equations
Automation and Remote Control
A review of recent advances in global optimization
Journal of Global Optimization
Towards global bilevel dynamic optimization
Journal of Global Optimization
Fluid analysis of energy consumption using rewards in massively parallel markov models
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
Applied Numerical Mathematics
Generalized McCormick relaxations
Journal of Global Optimization
Fluid computation of the performance: energy tradeoff in large scale Markov models
ACM SIGMETRICS Performance Evaluation Review
Bounds on the reachable sets of nonlinear control systems
Automatica (Journal of IFAC)
Improved relaxations for the parametric solutions of ODEs using differential inequalities
Journal of Global Optimization
Hi-index | 0.00 |
This paper examines global optimization of an integral objective function subject to nonlinear ordinary differential equations. Theory is developed for deriving a convex relaxation for an integral by utilizing the composition result defined by McCormick (Mathematical Programming 10, 147---175, 1976) in conjunction with a technique for constructing convex and concave relaxations for the solution of a system of nonquasimonotone ordinary differential equations defined by Singer and Barton (SIAM Journal on Scientific Computing, Submitted). A fully automated implementation of the theory is briefly discussed, and several literature case study problems are examined illustrating the utility of the branch-and-bound algorithm based on these relaxations.