On generalized semi-infinite optimization and bilevel optimization

The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a special case of a (BL). We consider the so-called reduction approach for (BL) and (GSIP) leading to optimality conditions and Newton-type methods for solving the problems. We show by a structural analysis that for (GSIP)-problems the regularity assumptions for the reduction approach can be expected to hold generically at a solution but for general (BL)-problems not. The genericity behavior of (BL) and (GSIP) is in particular studied for linear problems.

• Type: Journal
• Year: 2002
• Where: EOR
• Authors: Oliver Stein, Georg Still
• Keywords: EOR 2002, GSIP, Problems, Reduction Approach