A sharp Lagrange multiplier theorem for nonlinear programs (Q300758): Difference between revisions

The concept of infsup-convexity for a family of real-valued functions defined on the same nonempty set is a natural notion of convexity when dealing with minimax theory and alternative theorems. The main aim of this paper is to show that the duality between optimal solutions of a nonlinear program with inequalities and under a Slater constraint qualification and saddle points for the corresponding Lagrangian is equivalent to the infsup-convexity. The author also presents a Fritz John theorem that cannot be improved, since it establishes the equivalence of the Fritz John conditions and the infsup-convexity of an adequate finite family of functions.