Abstract
A general iterative method for the solution of convex minimax optimization problems is proposed. At each iteration, the functions are locally approximated by spheres and the resulting minimax problem is solved. We tested the algorithm on three different minimax location problems in the plane. Computational results with these problems are favorable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
