
doi: 10.1007/bf01068810
The author transforms the determination of a minimax in finite dimensional spaces under compactness and convexity assumptions to the problem to integrate a certain associated implicit system of ordinary differential equations. The required solvability assumptions as well as appromation methods to solve the differential equation using regularization techniques are discussed.
Convex programming, regularization techniques, determination of a minimax, loaded functional, Existence of solutions for minimax problems, finite dimensional spaces, Differential games (aspects of game theory)
Convex programming, regularization techniques, determination of a minimax, loaded functional, Existence of solutions for minimax problems, finite dimensional spaces, Differential games (aspects of game theory)
| 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). | 0 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
