Global dynamic optimization using edge-concave underestimator
From MaRDI portal
Publication:2182856
DOI10.1007/s10898-020-00883-2zbMath1467.90035OpenAlexW3004064417MaRDI QIDQ2182856
M. M. Faruque Hasan, Ishan Bajaj
Publication date: 26 May 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00883-2
ordinary differential equationsdeterministic global optimizationdynamic optimizationdifferential inequalitiesedge-concave underestimator
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Efficient polyhedral enclosures for the reachable set of nonlinear control systems
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- Interval bounds on the solutions of semi-explicit index-one DAEs. II: Computation
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Global impulsive optimal control computation
- Existence and sum decomposition of vertex polyhedral convex envelopes
- On a class of functions attaining their maximum at the vertices of a polyhedron
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Domain reduction techniques for global NLP and MINLP optimization
- Convex envelopes for edge-concave functions
- A rigorous global optimization algorithm for problems with ordinary differential equations
- A branch-and-reduce approach to global optimization
- Bounds on the reachable sets of nonlinear control systems
- Efficient upper and lower bounds for global mixed-integer optimal control
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- A DIRECT-type approach for derivative-free constrained global optimization
- Global optimization with nonlinear ordinary differential equations
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Algorithm 909
- Affine relaxations for the solutions of constrained parametric ordinary differential equations
- Global optimal control with the direct multiple shooting method
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Bounds on reachable sets using ordinary differential equations with linear programs embedded
- Numerical Software with Result Verification
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- Deterministic global optimization in nonlinear optimal control problems
This page was built for publication: Global dynamic optimization using edge-concave underestimator
