Solving minimax problems by interval methods

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1990 English Publisher:Springer Science and Business Media LLCJournal:BIT, volume 30, pages 742-751 (issn: 0006-3835, eissn: 1572-9125,

Copyright policy )

Authors: Shen, Zuhe; Neumaier, A.; Eiermann, M. C.;

doi: 10.1007/bf01933221

Solving minimax problems by interval methods

- Summary
- Subjects
- Metrics

Abstract

Interval arithmetic offers various tests (monotonicity test, convexity test, etc.) and methods (Newton's method, bisection, etc.) for solving global optimization problems with prescribed accuracy. The paper shows that these tests can be extended to solve global minimax problems. An algorithm as well as two numerical examples are included.

Related Organizations

University of Freiburg
Germany
Nanjing University
China (People's Republic of)
Nanjing University
China (People's Republic of)

Keywords

Numerical optimization and variational techniques, convexity test, numerical examples, algorithm, bisection, global optimization, Interval and finite arithmetic, Newton-type methods, global minimax problems, Newton's method, Optimality conditions for minimax problems, monotonicity test, Interval arithmetic

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	33
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average