Tightening state relaxations for global dynamic optimization using dynamic cuts
From MaRDI portal
Cites work
- A polyhedral branch-and-cut approach to global optimization
- A rigorous global optimization algorithm for problems with ordinary differential equations
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Affine relaxations for the solutions of constrained parametric ordinary differential equations
- An Automatic Method of Solving Discrete Programming Problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BARON: A general purpose global optimization software package
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- Bounds on reachable sets using ordinary differential equations with linear programs embedded
- Bounds on the reachable sets of nonlinear control systems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Deterministic global optimization in nonlinear optimal control problems
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- Generalized McCormick relaxations
- Global dynamic optimization using edge-concave underestimator
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization with nonlinear ordinary differential equations
- scientific article; zbMATH DE number 3219630 (Why is no real title available?)
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Nonlinear Programming
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Reachability analysis and deterministic global optimization of DAE models
- Reduced RLT representations for nonconvex polynomial programming problems
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
This page was built for publication: Tightening state relaxations for global dynamic optimization using dynamic cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983495)
