Reachability Analysis and Deterministic Global Optimization of DAE Models
DOI10.1007/978-3-319-22428-2_2zbMath1343.65104OpenAlexW2302047639MaRDI QIDQ2795640
Joseph K. Scott, Paul I. Barton
Publication date: 22 March 2016
Published in: Surveys in Differential-Algebraic Equations III (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22428-2_2
global optimizationdifferential-algebraic equationsconvex relaxationsdynamic optimizationinterval methodsreachability analysis
Nonconvex programming, global optimization (90C26) Implicit ordinary differential equations, differential-algebraic equations (34A09) Ordinary differential inclusions (34A60) Existence theories for optimal control problems involving ordinary differential equations (49J15) Numerical methods for differential-algebraic equations (65L80) Attainable sets, reachability (93B03) Control/observation systems governed by ordinary differential equations (93C15) Differential inequalities involving functions of a single real variable (34A40)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SUNDIALS
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- Interval bounds on the solutions of semi-explicit index-one DAEs. I: Analysis
- 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
- Generalized McCormick relaxations
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- Set membership state and parameter estimation for systems described by nonlinear differential equations
- The cluster problem revisited
- Ellipsoidal state estimation for dynamical systems
- Near optimal interval observers bundle for uncertain bioreactors
- Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models
- Controllers for reachability specifications for hybrid systems
- The cluster problem in multivariate global optimization
- Rigorous global search: continuous problems
- Efficient sensitivity analysis of large-scale differential-algebraic systems
- Interval observers for biochemical processes with uncertain kinetics and inputs
- A polyhedral branch-and-cut approach to global optimization
- Validated solutions of initial value problems for ordinary differential equations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A rigorous global optimization algorithm for problems with ordinary differential equations
- Computing validated solutions of implicit differential equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Numerical methods and software for sensitivity analysis of differential-algebraic systems
- A branch-and-reduce approach to global optimization
- Bounds on the reachable sets of nonlinear control systems
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- Global optimization with nonlinear ordinary differential equations
- On the computation of invariant sets for constrained nonlinear systems: an interval arithmetic approach
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Validated solutions of initial value problems for parametric ODEs
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Convex and concave relaxations of implicit functions
- Optimal start-up of microfabricated power generation processes employing fuel cells
- McCormick-Based Relaxations of Algorithms
- Interval Methods for Systems of Equations
- Optimal control via collocation and non-linear programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Survey of Bundle Methods for Nonsmooth Optimization
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- On Taylor Model Based Integration of ODEs
- Algorithm 811: NDA
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- An Algorithm for Separable Nonconvex Programming Problems
- Deterministic global optimization in nonlinear optimal control problems
This page was built for publication: Reachability Analysis and Deterministic Global Optimization of DAE Models