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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of optimization theory and applications Jg. 170; H. 3; S. 838 - 852
Hauptverfasser: Montiel Lopez, P, Ruiz Galan, M
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.09.2016
Springer Nature B.V
Schlagworte:
ISSN:0022-3239, 1573-2878
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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