On minimax optimization problems

DOI10.1007/BF01581038zbMath0473.90067OpenAlexW2020012752MaRDI QIDQ3929548

Zvi Drezner

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581038

zbMATH Keywords

nonconvex optimizationstationary pointsconvex minimax optimization

Mathematics Subject Classification ID

Convex programming (90C25) Existence of solutions for minimax problems (49J35)

Related Items (10)

Solving general continuous single facility location problems by cutting planes ⋮ The determination of a ``least quantile of squares regression line for all quantiles ⋮ The transfer point location problem ⋮ An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms ⋮ On minquantile and maxcovering optimisation ⋮ On the complexity of the exchange algorithm for minimax optimization problems ⋮ Continuous location of dimensional structures. ⋮ Locating a central hunter on the plane ⋮ Continuous Center Problems ⋮ Solution of minimax problems using equivalent differentiable functions

Cites Work

• Generalized Gradients and Applications
• APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS

This page was built for publication: On minimax optimization problems