Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints

In this paper, a general optimization problem is considered to investigate the conditions which ensure the existence of Lagrangian vectors with a norm not greater than a fixed positive number. In addition, the nonemptiness and boundedness of the multiplier sets together with their exact upper bounds is characterized. Moreover, three new constraint qualifications are suggested that each of them follows a degree of boundedness for multiplier vectors. Several examples at the end of the paper indicate that the upper bound for Lagrangian vectors is easily computable using each of our constraint qualifications. One innovation is introducing the so-called bounded Lagrangian constraint qualification which is stated based on the nonemptiness and boundedness of all possible Lagrangian sets. An application of the results for a mathematical program with equilibrium constraints is presented.

[1]  Lawrence M. Graves,et al.  Some mapping theorems , 1950 .

[2]  B. Mordukhovich.  Variational analysis and generalized differentiation , 2006 .

[3]  Jiří V. Outrata,et al.  Optimality Conditions for Disjunctive Programs with Application to Mathematical Programs with Equilibrium Constraints , 2007 .

[4]  Boris S. Mordukhovich,et al.  Enhanced metric regularity and Lipschitzian properties of variational systems , 2011, J. Glob. Optim..

[5]  A. Jourani.  Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems , 1994 .

[6]  Asen L. Dontchev,et al.  Regularity and Conditioning of Solution Mappings in Variational Analysis , 2004 .

[7]  Robert Mifflin,et al.  On conditions to have bounded multipliers in locally lipschitz programming , 1980, Math. Program..

[8]  Jacques Gauvin,et al.  A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming , 1977, Math. Program..

[9]  Boris S. Mordukhovich.  Coderivative Analysis of Variational Systems , 2004, J. Glob. Optim..

[10]  Olvi L. Mangasarian,et al.  Misclassification minimization , 1994, J. Glob. Optim..

[11]  J. Zowe,et al.  Regularity and stability for the mathematical programming problem in Banach spaces , 1979 .

[12]  Jane J. Ye,et al.  Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints , 2005 .

[13]  N. Movahedian.  Calmness of Set-Valued Mappings Between Asplund Spaces and Application to Equilibrium Problems , 2012 .

[14]  C. Stegall,et al.  The Radon-Nikodym property in conjugate Banach spaces , 1975 .

[15]  Xi Yin Zheng,et al.  Metric Subregularity and Calmness for Nonconvex Generalized Equations in Banach Spaces , 2010, SIAM J. Optim..

[16]  Jean-Pierre Aubin,et al.  Lipschitz Behavior of Solutions to Convex Minimization Problems , 1984, Math. Oper. Res..

[17]  Michel Théra,et al.  A note on an approximate lagrange multiplier rule , 2010, Math. Program..

[18]  René Henrion,et al.  Calmness of constraint systems with applications , 2005, Math. Program..

[19]  B. Mordukhovich.  Variational Analysis and Generalized Differentiation II: Applications , 2006 .

[20]  R. Tyrrell Rockafellar,et al.  Variational Analysis , 1998, Grundlehren der mathematischen Wissenschaften.

[21]  Boris S. Mordukhovich.  Necessary and sufficient conditions for linear suboptimality in constrained optimization , 2008, J. Glob. Optim..

[22]  O. Mangasarian,et al.  The Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints , 1967 .

[23]  Stephen M. Robinson,et al.  Solution continuity in variational conditions , 2008, J. Glob. Optim..

[24]  C. S. Lalitha,et al.  Bounded sets of KKT multipliers in vector optimization , 2006, J. Glob. Optim..

[25]  M. Pappalardo.  Error bounds for generalized Lagrange multipliers in locally Lipschitz programming , 1992 .