Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
From MaRDI portal
Publication:480823
DOI10.1007/s10898-013-0121-7zbMath1310.90093WikidataQ59400258 ScholiaQ59400258MaRDI QIDQ480823
Polyxeni-Margarita Kleniati, Claire S. Adjiman
Publication date: 11 December 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0121-7
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Related Items
The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem, Global Search for Bilevel Optimization with Quadratic Data, MPEC Methods for Bilevel Optimization Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Recent advances in nonconvex semi-infinite programming: applications and algorithms, A survey on mixed-integer programming techniques in bilevel optimization, Bilevel optimization for joint scheduling of production and energy systems, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory, Gauss-Newton-type methods for bilevel optimization, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Convergence rate of McCormick relaxations
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Generalized semi-infinite programming: a tutorial
- Bisecton by global optimization revisited
- A smoothing algorithm for finite min-max-min problems
- Global solution of bilevel programs with a nonconvex inner program
- Convex two-level optimization
- Infinitely constrained optimization problems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Global minimum potential energy conformations of small molecules
- Bilevel and multilevel programming: A bibliography review
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- A bilevel programming approach to determining tax credits for biofuel production
- Recent developments and trends in global optimization
- Foundations of bilevel programming
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- Weak via strong Stackelberg problem: New results
- On generalized semi-infinite optimization and bilevel optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Bilevel programming in traffic planning: Models, methods and challenge
- Bilevel optimization: on the structure of the feasible set
- Global solution of nonlinear mixed-integer bilevel programs
- Deterministic global optimization. Theory, methods and applications
- Parametric global optimisation for bilevel programming
- An overview of bilevel optimization
- Generalized semi-infinite programming: numerical aspects
- Global optimization of semi-infinite programs via restriction of the right-hand side
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- An Algorithm for Solving the General Bilevel Programming Problem
- Existence theorems of equilibrium points in stackelberg
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A nonconvex max-min problem
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Subdivision Direction Selection in Interval Methods for Global Optimization
- A linear max—min problem
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Solving generalized semi-infinite programs by reduction to simpler problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Constraint Qualifications Revisited
- Convex analysis and global optimization
- First-order necessary optimality conditions for general bilevel programming problems
- First-order necessary optimality conditions for general bilevel programming problems
- Introduction to global optimization.
- Global optimization of nonlinear bilevel programming problems
