Revisiting the Hahn–Banach theorem and nonlinear infinite programming
- 1 November 2017
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 455 (2) , 1037-1050
Abstract
No abstract availableAll Related Versions
Funding Information
- AEI/FEDER, UE (MTM2016-80676-P)
- Junta de Andalucía (FQM359)
- University of Granada
This publication has 24 references indexed in Scilit:
- An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraintsOptimization, 2011
- Optimality conditions and the basic constraint qualification for quasiconvex programmingNonlinear Analysis, 2011
- Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function SpacesSIAM Journal on Control and Optimization, 2011
- Mazur–Orlicz equalityStudia Mathematica, 2008
- The Hahn–Banach–Lagrange theoremOptimization, 2007
- On a generalized sup-inf problemJournal of Optimization Theory and Applications, 1996
- Perfect duality for convexlike programsJournal of Optimization Theory and Applications, 1982
- Sublineare FunktionaleArchiv der Mathematik, 1972
- Über das von Neumannsche Minimax-TheoremArchiv der Mathematik, 1968
- Quasi-Concave ProgrammingEconometrica, 1961