Solving minimax problems by interval methods

@article{Zuhe1990SolvingMP,
  title={Solving minimax problems by interval methods},
  author={Shen Zuhe and Arnold Neumaier and Michael C. Eiermann},
  journal={BIT Numerical Mathematics},
  year={1990},
  volume={30},
  pages={742-751}
}
Interval methods are used to compute the minimax problem of a twice continuously differentiable functionf(y, z),y ε ℝm,z ε ℝn ofm+n variables over anm+n-dimensional interval. The method provides bounds on both the minimax value of the function and the localizations of the minimax points. Numerical examples, arising in both mathematics and physics, show that the method works well. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Search Heuristics for Box Decomposition Methods

  • J. Global Optimization
  • 2002
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A novel method for solving min-max problems by using a modified particle swarm optimization

  • 2011 IEEE International Conference on Systems, Man, and Cybernetics
  • 2011
VIEW 1 EXCERPT
CITES METHODS