BOLIB: bilevel Optimization LIBrary of test problems
From MaRDI portal
Publication:5014641
DOI10.1007/978-3-030-52119-6_19zbMATH Open1477.90002arXiv1812.00230OpenAlexW2902389027MaRDI QIDQ5014641FDOQ5014641
Andrey Tin, Sheng-Long Zhou, Alain B. Zemkoho
Publication date: 8 December 2021
Published in: Bilevel Optimization (Search for Journal in Brave)
Abstract: This chapter presents the Bilevel Optimization LIBrary of the test problems (BOLIB for short), which contains a collection of test problems, with continuous variables, to help support the development of numerical solvers for bilevel optimization. The library contains 173 examples with 138 nonlinear, 24 linear, and 11 simple bilevel optimization problems. This BOLIB collection is probably the largest bilevel optimization library of test problems. Moreover, as the library is computationenabled with the MATLAB m-files of all the examples, it provides a uniform basis for testing and comparing algorithms. The library, together with all the related codes, is freely available at biopt.github.io/bolib.
Full work available at URL: https://arxiv.org/abs/1812.00230
Recommendations
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Test problem generation for quadratic-linear pessimistic bilevel optimization
- Numerical solution of a linear bilevel problem
- Test problem construction for linear bilevel programming problems
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Research data for problems pertaining to operations research and mathematical programming (90-11)
Cites Work
- Solving bilevel linear programs using multiple objective linear programming
- Practical bilevel optimization. Algorithms and applications
- A global optimization method for solving convex quadratic bilevel programming problems
- A hybrid neural network approach to bilevel programming problems
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On calmness conditions in convex bilevel programming
- Existence theorems of equilibrium points in stackelberg
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- A smoothing method for mathematical programs with equilibrium constraints
- Solving bilevel programs with the KKT-approach
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Solution algorithm for an optimistic linear Stackelberg problem
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Optimality conditions for the bilevel programming problem
- Generating quadratic bilevel programming test problems
- Some properties of the bilevel programming problem
- Handbook of test problems in local and global optimization
- A solution method for the linear static Stackelberg problem using penalty functions
- Filled functions for unconstrained global optimization.
- Convex two-level optimization
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Computational Difficulties of Bilevel Linear Programming
- On solving simple bilevel programs with a nonconvex lower level program
- On the numerical solution of a class of Stackelberg problems
- A solution method for the static constrained Stackelberg problem via penalty method
- Stackelberg problems: subgame perfect equilibria via Tikhonov regularization
- On Optimization Problems with Variational Inequality Constraints
- Title not available (Why is that?)
- Two-Level Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A novel approach to bilevel nonlinear programming
- Characterizing an optimal solution to the linear bilevel programming problem
- Necessary optimality conditions for Stackelberg problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- First-order necessary optimality conditions for general bilevel programming problems
- DC programming techniques for solving a class of nonlinear bilevel programs
- A quasiconcave minimization method for solving linear two-level programs
- Linear bilevel programming with upper level constraints depending on the lower level solution
- A global optimization approach for the linear two-level program
- Title not available (Why is that?)
- On bilevel programming. I: General nonlinear cases
- Title not available (Why is that?)
- A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
- Double penalty method for bilevel optimization problems
- An inertial extrapolation method for convex simple bilevel optimization
- Dependence of bilevel mathematical programs on irrelevant constraints
- A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- A note on the optimality conditions for the bilevel programming problem
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods
- Characterizing optimality in mathematical programming models
- The bilevel linear/linear fractional programming problem
- A bridge between bilevel programs and Nash games
- Weak and strong stationarity in generalized bilevel programming and bilevel optimal control
- Numerically tractable optimistic bilevel problems
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
Cited In (11)
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- Gauss-Newton-type methods for bilevel optimization
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Exploiting the polyhedral geometry of stochastic linear bilevel programming
- BOLIB
- A survey on mixed-integer programming techniques in bilevel optimization
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
- A primal nonsmooth reformulation for bilevel optimization problems
Uses Software
This page was built for publication: BOLIB: bilevel Optimization LIBrary of test problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014641)
