Solving Semi-Infinite Optimization Problems with Interior Point Techniques
Authors:
- Oliver SteinOSOliver Stein
- Georg StillGSGeorg Still
Open Access
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 42 (3) , 769-788
Abstract
We introduce a new numerical solution method for semi-infinite optimization problems with convex lower level problems. The method is based on a reformulation of the semi-infinite problem as a Stackelberg game and the use of regularized nonlinear complementarity problem functions. This approach leads to central path conditions for the lower level problems, where for a given path parameter a smooth nonlinear finite optimization problem has to be solved. The solution of the semi-infinite optimization problem then amounts to driving the path parameter to zero. We show convergence properties of the method and give a number of numerical examples from design centering and from robust optimization, where actually so-called generalized semi-infinite optimization problems are solved. The presented method is easy to implement, and in our examples it works well for dimensions of the semi-infinite index set at least up to 150.Keywords
This publication has 43 references indexed in Scilit:
- Generalized semi-infinite programming: numerical aspectsOptimization, 2001
- On level sets of marginal functionsOptimization, 2000
- Robust solutions of uncertain linear programsOperations Research Letters, 1999
- A smoothing method for mathematical programs with equilibrium constraintsMathematical Programming, 1999
- Semi-infinite terminal problems: a newton type methodOptimization, 1998
- On the complexity of some basic problems in computational convexity: I. Containment problemsDiscrete Mathematics, 1994
- A special newton-type optimization methodOptimization, 1992
- The acceleration radius: a global performance measure for robotic manipulatorsIEEE Journal on Robotics and Automation, 1988
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problemJournal of Optimization Theory and Applications, 1982
- A new computational method for Stackelberg and min-max problems by use of a penalty methodIEEE Transactions on Automatic Control, 1981