On the complexity of the exchange algorithm for minimax optimization problems

DOI10.1007/BF02604643MaRDI QIDQ3770292zbMATH OpenOpenAlexFDO

Authors Zvi Drezner

Publication date 1987

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

locationconvex functionsminimax optimization

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)

Recommendations

• scientific article; zbMATH DE number 2221954
• On complexity of the translational-cut algorithm for convex minimax problems
• Nonmonotone algorithm for minimax optimization problems
• Solution of minimax problems using equivalent differentiable functions
• scientific article; zbMATH DE number 871324

Cites work

• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• On minimax optimization problems
• Single Facility l_p -Distance Minimax Location

Cited in

(6)

• Algorithms for Pareto optimal exchange with bounded exchange cycles
• Communication complexity of convex optimization
• On solving large-scale finite minimax problems using exponential smoothing
• On the theoretical properties of the exchange algorithm
• scientific article; zbMATH DE number 2221954 (Why is no real title available?)
• On Finite Dimension Exchange Algorithms

This page was built for publication: On the complexity of the exchange algorithm for minimax optimization problems

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