How to Solve a Semi-infinite Optimization Problem
Oliver Stein (steinkit.edu)
Abstract: After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems. Particular attention is paid to connections with mathematical programs with complementarity constraints, lower level Wolfe duality, semi-smooth approaches, as well as branch and bound techniques in adaptive convexification procedures. A section on recent genericity results includes a discussion of the symmetry effect in generalized semi-infinite optimization.
Keywords: Semi-infinite optimization, design centering, robust optimization, mathematical program with complementarity constraints, Wolfe duality, semi-smooth equation, adaptive convexification, genericity, symmetry.
Category 1: Infinite Dimensional Optimization (Semi-infinite Programming )
Citation: European Journal of Operational Research, DOI 10.1016/j.ejor.2012.06.009
Entry Submitted: 03/27/2012
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|