Optimization Online


Numerically tractable optimistic bilevel problems

Lorenzo Lampariello (lorenzo.lampariello***at***uniroma3.it)
Simone Sagratella (sagratella***at***dis.uniroma1.it)

Abstract: We consider fully convex lower level standard optimistic bilevel problems. We show that this class of mathematical programs is sufficiently broad to encompass significant real-world applications. We establish that the critical points of a relaxation of the original problem correspond to the equilibria of a suitably defined generalized Nash equilibrium problem. The latter game is proven to be convex and with a nonempty solution set. Finally, leveraging this correspondence, we provide a provably convergent, easily implementable scheme to calculate critical points of the relaxed bilevel program. As witnessed by some numerical experiments on an application in economics, this algorithm turns out to be numerically viable also for big dimensional problems.

Keywords: Bilevel programming, Generalized Nash equilibirum problems (GNEP), Solution methods

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Complementarity and Variational Inequalities

Category 3: Other Topics (Game Theory )


Download: [PDF]

Entry Submitted: 10/12/2017
Entry Accepted: 10/12/2017
Entry Last Modified: 11/20/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society