Nonlinear Programming via König’s Maximum Theorem
Starting from one extension of the Hahn–Banach theorem, the Mazur–Orlicz theorem, and a not very restrictive concept of convexity, that arises naturally in minimax theory, infsup-convexity, we derive an equivalent version of that fundamental result for finite dimensional spaces, which is a sharp gen...
Saved in:
| Published in: | Journal of optimization theory and applications Vol. 170; no. 3; pp. 838 - 852 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.09.2016
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0022-3239, 1573-2878 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Starting from one extension of the Hahn–Banach theorem, the Mazur–Orlicz theorem, and a not very restrictive concept of convexity, that arises naturally in minimax theory, infsup-convexity, we derive an equivalent version of that fundamental result for finite dimensional spaces, which is a sharp generalization of König’s Maximum theorem. It implies several optimal statements of the Lagrange multipliers, Karush/Kuhn–Tucker, and Fritz John type for nonlinear programs with an objective function subject to both equality and inequality constraints. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 0022-3239 1573-2878 |
| DOI: | 10.1007/s10957-016-0959-1 |