Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
From MaRDI portal
Publication:597183
DOI10.1023/B:JOTA.0000006684.67437.c3zbMath1061.90116MaRDI QIDQ597183
Johannes O. Royset, Elijah Polak
Publication date: 6 August 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
smoothing techniques; feedback precision-adjustment rule; Min-max-min problems; nonsmooth optimization algorithms
90C47: Minimax problems in mathematical programming
49J35: Existence of solutions for minimax problems
90C34: Semi-infinite programming
Related Items
An aggregate deformation homotopy method for min-max-min problems with max-min constraints, 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, Discrete gradient method: Derivative-free method for nonsmooth optimization, A smoothing algorithm for finite min-max-min problems, Reference variable methods of solving min-Max optimization problems, Sufficient optimality and sensitivity analysis of a parameterized min-max programming, Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints, An effective nonsmooth optimization algorithm for locally Lipschitz functions, An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems, Convergence of an interior point algorithm for continuous minimax, Interval method for global solutions of a class of min-max-min problems, An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- On the optimal design centering, tolerancing, and tuning problem
- Algorithms for optimization problems with exclusion constraints
- Optimization. Algorithms and consistent approximations
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
- A cut-map algorithm for design problems with parameter tolerances and tuning
- A nonlinear programming approach to optimal design centering, tolerancing, and tuning
- On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
- Variational Analysis