A sharp Lagrange multiplier theorem for nonlinear programs
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.
- A General Gordan Alternative Theorem with Weakened Convexity and Its Application
- 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
- Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
- Existence and extensions of positive linear operators
- Fritz John necessary optimality conditions of the alternative-type
- From Hahn--Banach to monotonicity
- From the Farkas lemma to the Hahn-Banach theorem
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 6409513 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces
- Maximinimax, minimax, and antiminimax theorems and a result of R. C. James
- Minimax monotonicity
- Minimax Theorems
- On a generalized sup-inf problem
- On relaxing the Mangasarian-Fromovitz constraint qualification
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Perfect duality for convexlike programs
- Quasi-Concave Programming
- Quasiconvexity and Density Topology
- Strong and total Lagrange dualities for quasiconvex programming
- Sublinear functionals and conical measures
- Sur les espaces métriques linéaires (II)
- Techniques of variational analysis
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The Gordan theorem and its implications for minimax theory
- The Hahn–Banach–Lagrange theorem
- The origins of quasi-concavity: a development between mathematics and economics.
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Traces and Emergence of Nonlinear Programming
- Equivalence of saddle-points and optima for non-concave programmes
- Implied constraints and an alternate unified development of nonlinear programming theory
- Lagrangian duality and saddle points for sparse linear programming
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- A minimax approach for inverse variational inequalities
- Ordinary convex programs without a duality gap
- Nonlinear programming via König's maximum theorem
- scientific article; zbMATH DE number 4154226 (Why is no real title available?)
- scientific article; zbMATH DE number 4044587 (Why is no real title available?)
- scientific article; zbMATH DE number 4072742 (Why is no real title available?)
- scientific article; zbMATH DE number 19344 (Why is no real title available?)
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- scientific article; zbMATH DE number 6862661 (Why is no real title available?)
- scientific article; zbMATH DE number 205728 (Why is no real title available?)
- Sharp Lagrange multipliers for set-valued optimization problems
- Infinite programming and theorems of the alternative
- Enhanced Fritz John Conditions for Convex Programming
- Elementary convex techniques for equilibrium, minimax and variational problems
This page was built for publication: A sharp Lagrange multiplier theorem for nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300758)
