### Abstract

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Publication status | Published - 2000 |

### Publication series

Name | |
---|---|

Publisher | Department of Applied Mathematics, University of Twente |

No. | 1544 |

ISSN (Print) | 0169-2690 |

### Keywords

- MSC-90C30
- MSC-90C31
- IR-65731
- EWI-3364
- MSC-90C34

### Cite this

*On generalized semi-infinite optimization and bilevel optimization*. Enschede: University of Twente, Department of Applied Mathematics.

}

*On generalized semi-infinite optimization and bilevel optimization*. University of Twente, Department of Applied Mathematics, Enschede.

**On generalized semi-infinite optimization and bilevel optimization.** / Stein, O.; Still, Georg J.

Research output: Book/Report › Report › Other research output

TY - BOOK

T1 - On generalized semi-infinite optimization and bilevel optimization

AU - Stein, O.

AU - Still, Georg J.

N1 - Imported from MEMORANDA

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - MSC-90C30

KW - MSC-90C31

KW - IR-65731

KW - EWI-3364

KW - MSC-90C34

M3 - Report

BT - On generalized semi-infinite optimization and bilevel optimization

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -