
doi: 10.1007/bf01919289
Minimax problems play an important role in different fields of nonlinear analysis (game theory, duality theory, fixed point theory). After the introduction of the problem and some of its basic properties the paper investigates penalty methods to solve minimax problems. Similar to ordinary optimization problems the author distinguished between interior and exterior methods, analyzed in sections 2 and 3, respectively. The exterior methods have the advantage that they are easy to start, but often yield unfeasible solutions. To overcome this drawback the author proposes in the third section an extension to these methods. The paper ends with considerations for min-sup problems, i.e. for the case of the determination of half saddle points.
Programming in abstract spaces, penalty methods, interior and exterior methods, Numerical mathematical programming methods, Nonlinear programming, Other numerical methods in calculus of variations, Existence of solutions for minimax problems, minimax problems
Programming in abstract spaces, penalty methods, interior and exterior methods, Numerical mathematical programming methods, Nonlinear programming, Other numerical methods in calculus of variations, Existence of solutions for minimax problems, minimax problems
| 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 |
