Towards global bilevel dynamic optimization
From MaRDI portal
Recommendations
Cites work
- A global optimization approach for the linear two-level program
- A nonconvex max-min problem
- A novel approach to bilevel nonlinear programming
- A quasiconcave minimization method for solving linear two-level programs
- A rigorous global optimization algorithm for problems with ordinary differential equations
- An Algorithm for Solving the General Bilevel Programming Problem
- An effective high-order interval method for validating existence and uniqueness of the solution of an IVP for an ODE
- Bilevel and multilevel programming: A bibliography review
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexity and optimization in \({\mathbb R^n}\)
- Deterministic global optimization in nonlinear optimal control problems
- Filled functions for unconstrained global optimization.
- Foundations of bilevel programming
- Global optimization of linear hybrid systems with explicit transitions
- Global Optimization Of Linear Hybrid Systems With Varying Transition Times
- Global optimization with nonlinear ordinary differential equations
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- Global solution of semi-infinite programs
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3543140 (Why is no real title available?)
- scientific article; zbMATH DE number 3598222 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 2068055 (Why is no real title available?)
- scientific article; zbMATH DE number 2068075 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 3397998 (Why is no real title available?)
- Infinitely constrained optimization problems
- Interval methods for semi-infinite programs
- Nonlinear systems.
- Optimal control via collocation and non-linear programming
- Parametric global optimisation for bilevel programming
- Practical bilevel optimization. Algorithms and applications
- Relaxation-Based Bounds for Semi-Infinite Programs
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Robust optimization-methodology and applications
- Solving minimax problems by interval methods
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Validated solutions of initial value problems for parametric ODEs
Cited in
(7)- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Bilevel optimization: reformulation and first optimality conditions
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Towards global parameter estimation exploiting reduced data sets
- A novel method for path-constrained dynamic optimization via integral transcription and inner approximation
This page was built for publication: Towards global bilevel dynamic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842715)
