Nonlinear programming via König's maximum theorem
Fritz John theoremHahn-Banach theoreminfsup-convexityKarush/Kuhn-Tucker theoremLagrange multipliersnonlinear programmingseparation theorem
Convexity of real functions of several variables, generalizations (26B25) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Convex functions and convex programs in convex geometry (52A41) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
The authors establish a result which is an equivalent reformulation of the finite-dimensional Hahn-Banach theorem. This result generalizes the König Maximum theorem. The latter result can be stated as follows: Assume there is a finite family \(S_1,\dots, S_n\) of sublinear functions defined in a vector space \(E\), a nonempty and convex subset \(X\) of \(E\), and a linear function \(L\) such that \[ L\leq \max_{i=1,\dots,n} S_i \text{ on } X. \] Then there is a convex combination of the \(S_i\)'s that majorizes \(L\). The authors show how (a generalization of) this theorem can be used to establish some central results in nonlinear programming that are improvements upon their classical versions. The analysis uses infsup-convexity, which is a natural notion of convexity arising in the context of minimax inequalities. The authors prove that their Theorem 2.3 is equivalent to the finite dimensional Separation theorem. As a consequence, the authors establish sharp duality between optimal solutions of constrained variational problems and Lagrange multipliers, as well as some results of Karush/Kuhn-Tucker and Fritz-John type for nonlinear programming problems.
- \(L\)-invex-infine functions and applications
- A concave-convex Ky Fan minimax inequality
- A General Gordan Alternative Theorem with Weakened Convexity and Its Application
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
- 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
- Duality and a Farkas lemma for integer programs
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
- Fritz John necessary optimality conditions of the alternative-type
- Generalizations of the Hahn-Banach theorem revisited
- Glogal optimality conditions for classes of non-convex multi-objective quadratic optimization problems
- Gordan-type alternative theorems and vector optimization revisited
- scientific article; zbMATH DE number 2120969 (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?)
- Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces
- Minimal sublinear functionals
- Minimax Theorems
- On a generalized sup-inf problem
- On a theorem of Mazur and Orlicz
- On maximum and variational principles via image space analysis
- On Simons' version of Hahn-Banach-Lagrange theorem
- 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
- Theorems of the alternative and duality
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Traces and Emergence of Nonlinear Programming
- Über das von-Neumannsche Minimax-Theorem
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- A minimax approach for inverse variational inequalities
- A sharp Lagrange multiplier theorem for nonlinear programs
- scientific article; zbMATH DE number 4072742 (Why is no real title available?)
- scientific article; zbMATH DE number 4116267 (Why is no real title available?)
- The Hahn–Banach–Lagrange theorem
This page was built for publication: Nonlinear programming via König's maximum theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328441)
