On minimax optimization problems

DOI10.1007/BF01581038MaRDI QIDQ3929548zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(10)

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

This page was built for publication: On minimax optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929548)