Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 43, Issue 3, Pages 307-328Publisher
SPRINGER
DOI: 10.1007/s10589-007-9147-4
Keywords
Bilevel programming; Inexact-restoration; Optimization
Funding
- PRONEX-Optimization [PRONEX-CNPq/FAPERJ E-26/171.164/2003-APQ1]
- FAPESP [06/53768-0, 05-56773-1]
- CNPq
Ask authors/readers for more resources
We present a new algorithm for solving bilevel programming problems without reformulating them as single-level nonlinear programming problems. This strategy allows one to take profit of the structure of the lower level optimization problems without using non-differentiable methods. The algorithm is based on the inexact-restoration technique. Under some assumptions on the problem we prove global convergence to feasible points that satisfy the approximate gradient projection (AGP) optimality condition. Computational experiments are presented that encourage the use of this method for general bilevel problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available