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...
Uloženo v:
| Vydáno v: | Journal of optimization theory and applications Ročník 170; číslo 3; s. 838 - 852 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer US
01.09.2016
Springer Nature B.V |
| Témata: | |
| ISSN: | 0022-3239, 1573-2878 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | 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 |