On the Use of Augmented Lagrangians in the Solution of Generalized Semi-Infinite Min-Max Problems

We present an approach for the solution of a class of generalized semi-infinite optimization problems. Our approach uses augmented Lagrangians to transform generalized semi-infinite min-max problems into ordinary semi-infinite min-max problems, with the same set of local and global solutions as well as the same stationary points. Once the transformation is effected, the generalized semi-infinite min-max problems can be solved using any available semi-infinite optimization algorithm. We illustrate our approach with two numerical examples, one of which deals with structural design subject to reliability constraints.

[1]  C. C. Gonzaga,et al.  On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .

[2]  G. Di Pillo,et al.  Exact Penalty Methods , 1994 .

[3]  Alexander Shapiro,et al.  First-Order Optimality Conditions in Generalized Semi-Infinite Programming , 1999 .

[4]  Oliver Stein.  First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization , 2001, Math. Oper. Res..

[5]  Georg Still,et al.  Generalized semi-infinite programming: Theory and methods , 1999, Eur. J. Oper. Res..

[6]  Henrik O. Madsen,et al.  Structural Reliability Methods , 1996 .

[7]  Li Xingsi,et al.  AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATION , 1992 .

[8]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[9]  Johannes O. Royset,et al.  Reliability-based optimal structural design by the decoupling approach , 2001, Reliab. Eng. Syst. Saf..

[10]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  Rainer Tichatschke,et al.  A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems , 1998, J. Glob. Optim..

[13]  O. Mangasarian,et al.  Local Duality of Nonlinear Programs , 1984 .

[14]  A. Kaplan,et al.  On the numerical treatment of a class of semi-infinite terminal problems ∗ ∗Partially supported by the german research society (DFG)$ef: , 1997 .

[15]  Hubertus Th. Jongen,et al.  Generalized semi-infinite optimization: A first order optimality condition and examples , 1998, Math. Program..

[16]  William W. Hager,et al.  Dual techniques for minimax , 1987 .

[17]  Armen Der Kiureghian,et al.  Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems , 2003, SIAM J. Optim..

[18]  Georg J. Still,et al.  Semi-infinite programming models in robotics , 1991 .

[19]  R. Rockafellar.  Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming , 1974 .

[20]  Hector A. Rosales-Macedo.  Nonlinear Programming: Theory and Algorithms (2nd Edition) , 1993 .

[21]  B. N. Pshenichnyi,et al.  Numerical Methods in Extremal Problems. , 1978 .

[22]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[23]  Bruce H. Krogh,et al.  The acceleration radius: a global performance measure for robotic manipulators , 1988, IEEE J. Robotics Autom..

[24]  Oliver Stein,et al.  Bi-Level Strategies in Semi-Infinite Programming , 2003 .

[25]  Gerhard-Wilhelm Weber,et al.  Generalized semi-infinite optimization: On some foundations , 1999 .

[26]  James V. Burke,et al.  Calmness and exact penalization , 1991 .

[27]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[28]  Georg J. Still,et al.  Generalized semi-infinite programming: numerical aspects , 2001 .

[29]  E. Levitin.  Reduction of Generalized Semi-Infinite Programming Problems to Semi-Infinite or Piece-Wise Smooth Programming Problems , 2001, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[30]  G. Still,et al.  On Optimality Conditions for Generalized Semi-Infinite Programming Problems , 2000 .

[31]  Jerzy Kyparisis,et al.  On uniqueness of Kuhn-Tucker multipliers in nonlinear programming , 1985, Math. Program..

[32]  André L. Tits,et al.  An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions , 1996, SIAM J. Optim..

[33]  André L. Tits,et al.  Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions , 1998, SIAM J. Optim..