Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
From MaRDI portal
Publication:4441946
DOI10.1137/S1052623402406777zbMath1042.49033MaRDI QIDQ4441946
Johannes O. Royset, Elijah Polak, Armen Der Kiureghian
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
90C47: Minimax problems in mathematical programming
90C32: Fractional programming
90C34: Semi-infinite programming
49K35: Optimality conditions for minimax problems
Related Items
Variational Theory for Optimization under Stochastic Ambiguity, Preface, A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models, Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions, Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions, Method of outer approximations and adaptive approximations for a class of matrix games, Solving quality control problems with an algorithm for minimax programs with coupled constraints, Computing power system parameters to maximize the small signal stability margin based on min-max models, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems, Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, On sample size control in sample average approximations for solving smooth stochastic programs, A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
