Derivative evaluation and computational experience with large bilevel mathematical programs
From MaRDI portal
A bilevel program is a mathematical program involving functions defined implicitly as solutions to another mathematical program. We discuss a method for extracting derivative information on the implicit function, which is especially efficient when the lower-level problem has simple bounds on the variables and/or many inactive constraints. Computational experience on problems with up to 230 variables and 30 constraints is presented.
Recommendations
Cites work
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- An Algorithm for Solving the General Bilevel Programming Problem
- An Analysis of the Principal-Agent Problem
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Introduction to sensitivity and stability analysis in nonlinear programming
- On two-level optimization
- Point-to-Set Maps in Mathematical Programming
- Sensitivity analysis for nonlinear programming using penalty methods
- Solution of Some Stochastic Quadratic Nash and Leader-Follower Games
- Stackelburg solution for two-person games with biased information patterns
- The Theory of Max-Min, with Applications
- Two-Level Linear Programming
Cited in
(32)- Capital budgeting with Benders' decomposition
- A hierarchical decomposition for large-scale optimal control problems with parallel processing structure
- Hierarchical optimization: An introduction
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- On the quasiconcave bilevel programming problem
- Descent approaches for quadratic bilevel programming
- Bilevel and multilevel programming: A bibliography review
- Dependence of bilevel mathematical programs on irrelevant constraints
- A new descent algorithm for solving quadratic bilevel programming problems.
- Optimization in curbing risk contagion among financial institutes
- A homotopy method for solving bilevel programming problem
- On bilevel programming. I: General nonlinear cases
- Bilevel programming in traffic planning: Models, methods and challenge
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Gradient methods for solving Stackelberg games
- An overview of bilevel optimization
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches
- Shortest path network interdiction with asymmetric information
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A new method to solve bi-level quadratic linear fractional programming problems
- Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- Fully zeroth-order bilevel programming via Gaussian smoothing
- An efficient solution approach to capacitated bilevel time minimizing transportation problem
- A redistribued proximal bundle method for a class of bilevel nonconvex nonsmooth minimization problems with inexact information
- Locally convergent bi-level MDO architectures based on the block coordinate descent algorithm
- Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
- Approximation of the steepest descent direction for the O-D matrix adjustment problem
- Bilevel time minimizing transportation problem
This page was built for publication: Derivative evaluation and computational experience with large bilevel mathematical programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123142)