Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques

DOI10.1023/B:JOTA.0000006684.67437.c3zbMath1061.90116OpenAlexW1999738286MaRDI QIDQ597183

Johannes O. Royset, Elijah Polak

Publication date: 6 August 2004

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jota.0000006684.67437.c3

zbMATH Keywords

smoothing techniquesfeedback precision-adjustment ruleMin-max-min problemsnonsmooth optimization algorithms

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35) Semi-infinite programming (90C34)

Related Items (27)

Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ 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 ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ Solving quality control problems with an algorithm for minimax programs with coupled constraints ⋮ An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ An aggregate deformation homotopy method for min-max-min problems with max-min 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 ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ Convergence of an interior point algorithm for continuous minimax ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ Interval method for global solutions of a class of min-max-min problems ⋮ Sufficient optimality and sensitivity analysis of a parameterized min-max programming ⋮ An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization ⋮ Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints ⋮ Global solution of semi-infinite programs with existence constraints ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ A smoothing algorithm for finite min-max-min problems ⋮ Preface ⋮ Reference variable methods of solving min-Max optimization problems ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ A spline smoothing Newton method for semi-infinite minimax problems ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ 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

This page was built for publication: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques