Min-max identities on boundaries of convex sets around the origin
Min-max and max-min identities are found for inner products on the boundaries of compact, convex sets whose interiors contain the origin. The identities resemble the minimax theorem but they are different from it. Specifically, the value of each min-max (or max-min) equals the value of a dual problem of the same type. Their solution sets can be characterized geometrically in terms of the enclosed convex sets and their polar sets. However, the solution sets need not be convex nor even connected.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director, Office of Science. Office of Advanced Scientific Computing Research. Mathematical, Information, and Computational Sciences Division (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 839224
- Report Number(s):
- LBNL-50634; R&D Project: K11001; TRN: US200509%%256
- Resource Relation:
- Other Information: PBD: 31 Jan 2002
- Country of Publication:
- United States
- Language:
- English
Similar Records
Min-Max Spaces and Complexity Reduction in Min-Max Expansions
The effects of initial conditions and control time on optimal actuator placement via a max-min Genetic Algorithm
Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
Journal Article
·
Fri Jun 15 00:00:00 EDT 2012
· Applied Mathematics and Optimization
·
OSTI ID:839224
The effects of initial conditions and control time on optimal actuator placement via a max-min Genetic Algorithm
Conference
·
Thu Jul 01 00:00:00 EDT 1993
·
OSTI ID:839224
Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
Journal Article
·
Thu Mar 15 00:00:00 EDT 2018
· Computational and Applied Mathematics
·
OSTI ID:839224
+1 more