Solution of minimax problems using equivalent differentiable functions (Q1068355)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3931877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution of minimax problems using equivalent differentiable functions |
scientific article; zbMATH DE number 3931877 |
Statements
Solution of minimax problems using equivalent differentiable functions (English)
0 references
1985
0 references
A method is proposed for the solution of minimax optimization problems in which the individual functions involved are convex. The method consists of solving a problem with an objective function which is the sum of high powers or strong exponentials of the separate components of the original objective function. The resulting objective function, which is equivalent at the limit to the minimax one, is shown to be smooth as well as convex. Any efficient nonlinear programming method can be utilized for solving the equivalent problem. A number of examples are discussed.
0 references
minimax optimization problems
0 references
strong exponentials
0 references
objective function
0 references
0 references
0 references
0.8437538743019104
0 references
0.8282826542854309
0 references
0.8234807252883911
0 references
0.8210623860359192
0 references
