A trust region algorithm for nonlinear bilevel programming
From MaRDI portal
Publication:1604045
DOI10.1016/S0167-6377(01)00092-XzbMath0993.90071OpenAlexW2116765717MaRDI QIDQ1604045
Patrice Marcotte, Gilles Savard, Dao-Li Zhu
Publication date: 3 July 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00092-x
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Solving discretely-constrained Nash-Cournot games with an application to power markets ⋮ Bilevel decision via variational inequalities ⋮ A trust region algorithm for solving bilevel programming problems ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ An exact algorithm for bilevel 0-1 knapsack problems ⋮ A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints ⋮ Origin-destination matrix estimation problem in a Markov chain approach ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Exact and inexact penalty methods for the generalized bilevel programming problem
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
- Sensitivity Analysis in Variational Inequalities
- Some continuity properties of polyhedral multifunctions
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
