BOLIB: Bilevel Optimization LIBrary of Test Problems
From MaRDI portal
Publication:5014641
DOI10.1007/978-3-030-52119-6_19zbMath1477.90002arXiv1812.00230OpenAlexW2902389027MaRDI QIDQ5014641
Andrey Tin, Sheng-Long Zhou, Alain B. Zemkoho
Publication date: 8 December 2021
Published in: Bilevel Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.00230
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)
Related Items (10)
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ Exploiting the polyhedral geometry of stochastic linear bilevel programming ⋮ Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ Gauss-Newton-type methods for bilevel optimization ⋮ Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization ⋮ BOLIB
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution algorithm for an optimistic linear Stackelberg problem
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- DC programming techniques for solving a class of nonlinear bilevel programs
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Some properties of the bilevel programming problem
- Solving bilevel linear programs using multiple objective linear programming
- Characterizing optimality in mathematical programming models
- Convex two-level optimization
- Double penalty method for bilevel optimization problems
- A global optimization approach for the linear two-level program
- A smoothing method for mathematical programs with equilibrium constraints
- Handbook of test problems in local and global optimization
- Practical bilevel optimization. Algorithms and applications
- A quasiconcave minimization method for solving linear two-level programs
- Necessary optimality conditions for Stackelberg problems
- Characterizing an optimal solution to the linear bilevel programming problem
- Dependence of bilevel mathematical programs on irrelevant constraints
- A global optimization method for solving convex quadratic bilevel programming problems
- A bridge between bilevel programs and Nash games
- The bilevel linear/linear fractional programming problem
- On bilevel programming. I: General nonlinear cases
- Solving bilevel programs with the KKT-approach
- Numerically tractable optimistic bilevel problems
- On solving simple bilevel programs with a nonconvex lower level program
- A novel approach to bilevel nonlinear programming
- A hybrid neural network approach to bilevel programming problems
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Weak and strong stationarity in generalized bilevel programming and bilevel optimal control
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On calmness conditions in convex bilevel programming
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- On the numerical solution of a class of Stackelberg problems
- A solution method for the static constrained Stackelberg problem via penalty method
- Optimality conditions for the bilevel programming problem
- A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Computational Difficulties of Bilevel Linear Programming
- Existence theorems of equilibrium points in stackelberg
- 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
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- On Optimization Problems with Variational Inequality Constraints
- A necessary and a sufficient optimality condition for bilevel programming problems
- Generating quadratic bilevel programming test problems
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- Two-Level Linear Programming
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods
- A solution method for the linear static Stackelberg problem using penalty functions
- An inertial extrapolation method for convex simple bilevel optimization
- First-order necessary optimality conditions for general bilevel programming problems
- Filled functions for unconstrained global optimization.
This page was built for publication: BOLIB: Bilevel Optimization LIBrary of Test Problems
