Advertisement

Bi-Level Strategies in Semi-Infinite Programming

  • Oliver Stein

Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 71)

Table of contents

  1. Front Matter
    Pages I-XXVII
  2. Oliver Stein
    Pages 1-10
  3. Oliver Stein
    Pages 11-23
  4. Oliver Stein
    Pages 85-144
  5. Oliver Stein
    Pages 171-185
  6. Oliver Stein
    Pages 187-189
  7. Back Matter
    Pages 191-202

About this book

Introduction

Semi-infinite optimization is a vivid field of active research. Recently semi­ infinite optimization in a general form has attracted a lot of attention, not only because of its surprising structural aspects, but also due to the large number of applications which can be formulated as general semi-infinite programs. The aim of this book is to highlight structural aspects of general semi-infinite programming, to formulate optimality conditions which take this structure into account, and to give a conceptually new solution method. In fact, under certain assumptions general semi-infinite programs can be solved efficiently when their bi-Ievel structure is exploited appropriately. After a brief introduction with some historical background in Chapter 1 we be­ gin our presentation by a motivation for the appearance of standard and general semi-infinite optimization problems in applications. Chapter 2 lists a number of problems from engineering and economics which give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, ro­ bust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming.

Keywords

Approximation Grad operations research optimization

Authors and affiliations

  • Oliver Stein
    • 1
  1. 1.Department of MathematicsAachen UniversityGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4419-9164-5
  • Copyright Information Springer-Verlag US 2003
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-4817-7
  • Online ISBN 978-1-4419-9164-5
  • Series Print ISSN 1571-568X
  • Buy this book on publisher's site