Electronic Resource
Springer
Mathematical programming
22 (1982), S. 227-230
ISSN:
1436-4646
Keywords:
Minimax
;
Nonconvex Optimization
;
Stationary Points
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We give a short proof that in a convex minimax optimization problem ink dimensions there exist a subset ofk + 1 functions such that a solution to the minimax problem with thosek + 1 functions is a solution to the minimax problem with all functions. We show that convexity is necessary, and prove a similar theorem for stationary points when the functions are not necessarily convex but the gradient exists for each function.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01581038
|
Location |
Call Number |
Expected |
Availability |