Solving minimax problems by interval methods
From MaRDI portal
Publication:2639605
DOI10.1007/BF01933221zbMath0718.65049MaRDI QIDQ2639605
Arnold Neumaier, M. C. Eiermann, Zu He Shen
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
algorithmglobal optimizationNewton's methodnumerical examplesbisectionInterval arithmeticmonotonicity testconvexity testglobal minimax problems
Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Interval and finite arithmetic (65G30) Optimality conditions for minimax problems (49K35)
Related Items
Towards global bilevel dynamic optimization ⋮ A branch-and-bound algorithm for bound constrained optimization problems without derivatives ⋮ A simplex grey wolf optimizer for solving integer programming and minimax problems ⋮ On smooth reformulations and direct non-smooth computations for minimax problems ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ Direct Gravitational Search Algorithm for Global Optimisation Problems ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ Continuous minimax optimization using modal intervals ⋮ Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems ⋮ Interval method for global solutions of a class of min-max-min problems ⋮ Global solution of bilevel programs with a nonconvex inner program ⋮ Interval mathematics, algebraic equations and optimization ⋮ Development of modal interval algorithm for solving continuous minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal centered forms
- Global optimization using interval analysis - the multi-dimensional case
- Bounding solutions of systems of equations using interval analysis
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- Interval Slopes for Rational Functions and Associated Centered Forms
- Optimal Search for the Global Maximum of Functions with Bounded Seminorm
- Using Interval Methods for the Numerical Solution of ODE's
- Interval Methods for Systems of Equations
- Overestimation in Linear Interval Equations
- A Sequential Method Seeking the Global Maximum of a Function