Revisiting the Hahn-Banach theorem and nonlinear infinite programming

DOI10.1016/J.JMAA.2017.06.007zbMATH Open1432.49036OpenAlexW2963332372MaRDI QIDQ2014078FDOQ2014078

Authors P. Montiel López, M. Ruiz Galán

Publication date 10 August 2017

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.00885

zbMATH Keywords

nonlinear programmingLagrange multipliersHahn-Banach theoreminfsup-convexityFritz John theoremKarush-Kuhn-Tucker theorem

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Optimality conditions for problems in abstract spaces (49K27) Programming in abstract spaces (90C48) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22)

Abstract: [REVISED VERSION] The aim of this paper is to state a sharp version of the K"onig supremum theorem, an equivalent reformulation of the Hahn--Banach theorem. We apply it to derive statements of the Lagrange multipliers, Karush-Kuhn-Tucker and Fritz John type, for nonlinear infinite programs. We also show that a weak concept of convexity coming from minimax theory, infsup-convexity, is the adequate one for this kind of results.

Recommendations

• Nonlinear programming via König's maximum theorem
• The Hahn–Banach–Lagrange theorem
• Infinite programming and theorems of the alternative
• scientific article; zbMATH DE number 3859735
• A sharp Lagrange multiplier theorem for nonlinear programs

Cites work

• scientific article; zbMATH DE number 3148887 (Why is no real title available?)
• scientific article; zbMATH DE number 6409513 (Why is no real title available?)
• scientific article; zbMATH DE number 3052220 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• A derivative-coderivative inclusion in second-order nonsmooth analysis
• A sharp Lagrange multiplier theorem for nonlinear programs
• A theorem of the alternative and a two-function minimax theorem
• An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
• Bootstrapping the Mazur--Orlicz--K\"onig theorem
• Fritz John necessary optimality conditions of the alternative-type
• Generalizations of the Hahn-Banach theorem revisited
• Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces
• Mazur–Orlicz equality
• Minimal sublinear functionals
• Minimax Theorems
• Mixed variational formulations in locally convex spaces
• Nonlinear programming via König's maximum theorem
• On Simons' version of Hahn-Banach-Lagrange theorem
• On a generalized sup-inf problem
• On a theorem of Mazur and Orlicz
• Optimality conditions and the basic constraint qualification for quasiconvex programming
• Perfect duality for convexlike programs
• Quasi-Concave Programming
• Strong and total Lagrange dualities for quasiconvex programming
• Sublinear functionals and conical measures
• Sublineare Funktionale
• Sur les espaces métriques linéaires (II)
• The Gordan theorem and its implications for minimax theory
• The Hahn–Banach–Lagrange theorem
• The Mazur-Orlicz theorem for convex functionals
• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• Über das von-Neumannsche Minimax-Theorem

Cited in

(5)

• Nonlinear programming via König's maximum theorem
• Generalizations of the Hahn-Banach theorem revisited
• A minimax approach for inverse variational inequalities
• About Hahn-Banach extension theorems and applications to set-valued optimization
• Infinite programming and theorems of the alternative

This page was built for publication: Revisiting the Hahn-Banach theorem and nonlinear infinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014078)