Nonlinear programming via König's maximum theorem
DOI10.1007/s10957-016-0959-1zbMath1360.90238OpenAlexW2470757684MaRDI QIDQ328441
P. Montiel López, Manuel Ruiz Galán
Publication date: 20 October 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0959-1
Lagrange multipliersHahn-Banach theoremnonlinear programmingseparation theoreminfsup-convexityFritz John theoremKarush/Kuhn-Tucker theorem
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On maximum and variational principles via image space analysis
- A sharp Lagrange multiplier theorem for nonlinear programs
- Fritz John necessary optimality conditions of the alternative-type
- \(L\)-invex-infine functions and applications
- Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Generalizations of the Hahn-Banach theorem revisited
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Perfect duality for convexlike programs
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Theorems of the alternative and duality
- Strong and total Lagrange dualities for quasiconvex programming
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
- Über das von-Neumannsche Minimax-Theorem
- Sublineare Funktionale
- On a generalized sup-inf problem
- A theorem of the alternative and a two-function minimax theorem
- Gordan-Type Alternative Theorems and Vector Optimization Revisited
- Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems
- 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
- On a theorem of Mazur and Orlicz
- Quasi-Concave Programming
- Duality and a Farkas lemma for integer programs
- A General Gordan Alternative Theorem with Weakened Convexity and Its Application
- On Simons' version of Hahn–Banach–Lagrange theorem
- Traces and Emergence of Nonlinear Programming
- Minimal sublinear functionals
- The Hahn–Banach–Lagrange theorem
- Minimax Theorems
- Sur les espaces métriques linéaires (II)
- Sublinear functionals and conical measures
This page was built for publication: Nonlinear programming via König's maximum theorem
