Nonlinear programming via König's maximum theorem

DOI10.1007/S10957-016-0959-1zbMATH Open1360.90238OpenAlexW2470757684MaRDI QIDQ328441FDOQ328441

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

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

Recommendations

• Revisiting the Hahn-Banach theorem and nonlinear infinite programming
• scientific article
• A sharp Lagrange multiplier theorem for nonlinear programs
• Infinite programming and theorems of the alternative
• Optimality, minimax and duality in nonlinear programming

zbMATH Keywords

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

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25) Convex functions and convex programs in convex geometry (52A41) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22)

Cites Work

• Title not available (Why is that?)
• On maximum and variational principles via image space analysis
• Quasi-Concave Programming
• Title not available (Why is that?)
• The Hahn–Banach–Lagrange theorem
• Minimax Theorems
• Farkas' lemma: three decades of generalizations for mathematical optimization
• 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
• Title not available (Why is that?)
• 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
• A General Gordan Alternative Theorem with Weakened Convexity and Its Application
• Title not available (Why is that?)
• Traces and Emergence of Nonlinear Programming
• Sur les espaces métriques linéaires (II)
• Sublinear functionals and conical measures
• Optimality conditions and the basic constraint qualification for quasiconvex programming
• Theorems of the alternative and duality
• 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
• Sublineare Funktionale
• A concave-convex Ky Fan minimax inequality
• Gordan-Type Alternative Theorems and Vector Optimization Revisited
• Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems
• On a theorem of Mazur and Orlicz
• Duality and a Farkas lemma for integer programs
• \(L\)-invex-infine functions and applications
• Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
• Generalizations of the Hahn-Banach theorem revisited
• On Simons' version of Hahn–Banach–Lagrange theorem
• Minimal sublinear functionals

Cited In (5)

• Revisiting the Hahn-Banach theorem and nonlinear infinite programming
• The Hahn–Banach–Lagrange theorem
• A minimax approach for inverse variational inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)

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)