Revisiting the Hahn-Banach theorem and nonlinear infinite programming

DOI10.1016/J.JMAA.2017.06.007zbMATH Open1432.49036arXiv1610.00885OpenAlexW2963332372MaRDI 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)

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.

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

Recommendations

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

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)

Cites Work

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

Cited In (5)

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

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)