Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
From MaRDI portal
(Redirected from Publication:480824)
Recommendations
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A bounding approach for the optimistic optimal solution of a class of semivectorial bilevel programming problem
- On computational search for optimistic solutions in bilevel problems
- A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
- A solution method for the optimistic linear semivectorial bilevel optimization problem
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Optimal multisections in interval branch-and-bound methods of global optimization
Cites work
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A global optimization approach for the linear two-level program
- A novel approach to bilevel nonlinear programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Convex analysis and global optimization
- Convex two-level optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Existence theorems of equilibrium points in stackelberg
- Foundations of bilevel programming
- Global optimization of nonlinear bilevel programming problems
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of semi-infinite programs
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 970346 (Why is no real title available?)
- Parametric global optimisation for bilevel programming
- Pessimistic bilevel optimization
- Practical bilevel optimization. Algorithms and applications
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Weak via strong Stackelberg problem: New results
Cited in
(22)- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- 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
- On the solution of convex bilevel optimization problems
- Bilevel optimization: reformulation and first optimality conditions
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Global search for bilevel optimization with quadratic data
- MPEC methods for bilevel optimization problems
- BOLIB: bilevel Optimization LIBrary of test 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
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: complexity and a solution method
This page was built for publication: Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480824)
