A sharp Lagrange multiplier theorem for nonlinear programs

DOI10.1007/s10898-015-0379-zzbMath1359.90137OpenAlexW1931563615MaRDI QIDQ300758

Manuel Ruiz Galán

Publication date: 29 June 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0379-z

zbMATH Keywords

Lagrange multipliersnonlinear programmingKarush-Kuhn-Tucker conditionsseparation theoremFritz John conditionsinfsup-convexity

Mathematics Subject Classification ID

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

Related Items (5)

Nonlinear programming via König's maximum theorem ⋮ A minimax approach for inverse variational inequalities ⋮ Elementary convex techniques for equilibrium, minimax and variational problems ⋮ Revisiting the Hahn-Banach theorem and nonlinear infinite programming ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fritz John necessary optimality conditions of the alternative-type
• Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
• Optimality conditions and the basic constraint qualification for quasiconvex programming
• On relaxing the Mangasarian-Fromovitz constraint qualification
• Existence and extensions of positive linear operators
• Perfect duality for convexlike programs
• Minimax monotonicity
• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• The origins of quasi-concavity: a development between mathematics and economics.
• Strong and total Lagrange dualities for quasiconvex programming
• From Hahn--Banach to monotonicity
• Techniques of variational analysis
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Maximinimax, minimax, and antiminimax theorems and a result of R. C. James
• On a generalized sup-inf problem
• 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
• Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces
• From the Farkas Lemma to the Hahn--Banach Theorem
• Quasi-Concave Programming
• A General Gordan Alternative Theorem with Weakened Convexity and Its Application
• Traces and Emergence of Nonlinear Programming
• Quasiconvexity and Density Topology
• 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: A sharp Lagrange multiplier theorem for nonlinear programs