References
- D. P. Bertsekas and A. E. Ozdaglar (2002). Pseudonormality and a Lagrange multiplier theory for constrained optimization. J. Optim. Theory Appl. 114:287–343.
- F. H. Clarke (1983). Optimization and Nonsmooth Analysis. Wiley-Interscience, New York.
- V. F. Demyanov (1994). Convexification and concavification of a positively homogeneous function by the same family of functions. Universia di Pisa, Report 3, 208, 802.
- V. F. Demyanov and V. Jeyakumar (1997). Hunting for a smaller convex subdifferential. J. Glob. Optim. 10:305–326.
- V. F. Demyanov and A. M. Rubinov (1995). Constructive Nonsmooth Analysis. Verlag Peter Leng, Frankfurt am Main, Germany.
- J. Dutta and S. Chandra (2004). Convexificators, generalized convexity and vector optimzation. Optimization 53:77–94.
- M. J. Fabian, R. Henrion, A. Y. Kruger, and J. V. Outrata (2010). Error bounds: Necessary and sufficient conditions. Set-Valued Var. Anal. 18:121–149.
- G. Giorgi, B. Jiménez, and V. Novo (2016). Approximate Karush-Kuhn-Tucker condition in multiobjective optimization. J. Optim. Theory Appl. 171:70–89.
- M. Golestani and S. Nobakhtian (2012). Convexificators and strong Kuhn-Tucker conditions. Comput. Math. Appl. 64:550–557.
- M. Golestani and S. Nobakhtian (2013). Nonsmooth multiobjective programming and constraint qualifications. Optimization 62:783–795.
- L. Guo, J. J. Ye, and J. Zhang (2013). Mathematical programs with geometric constraints in Banach spaces: Enhanced optimality, exact penalty, and senstivity. SIAM J. Optim. 23:2295–2319.
- V. Jeyakumar and D. T. Luc (1998). Approximate Jacobian matrices for nonsmooth continuous maps and C1-optimization. SIAM J. Control Optim. 36:1815–1832.
- V. Jeyakumar and D. T. Luc (1999). Nonsmooth calculus, minimality, and monotonicity of convexificators. J. Optim. Theory Appl. 101:599–621.
- V. Jeyakumar and D. T. Luc (2008). Nonsmooth Vector Functions and Continuous Optimization. Springer, New York.
- X. F. Li and J. Z. Zhang (2005). Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case. J. Optim. Theory Appl. 127:367–388.
- X. F. Li and J. Z. Zhang (2006). Necessary optimality conditions in terms of convexificators in Lipschitz optimization. J. Optim. Theory Appl. 131:429–452.
- X. F. Li and J. Z. Zhang (2010). Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization. J. Optim. Theory Appl. 145:373–386.
- D. T. Luc (1989). Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems. Vol. 319. Springer-Verlag, Berlin.
- D. V. Luu (2014). Necessary and sufficient conditions for efficiency via convexificators. J. Optim. Theory Appl. 160:510–526.
- P. Michel and J. P. Penot (1992). A generalized derivative for calm and stable functions. Differ. Integr. Equations 5:433–454.
- K. M. Miettinen (1999). Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston.
- B. S. Mordukhovich and Y. H. Shao (1995). On nonconvex subdifferential calculus in Banach space. J. Convex Anal. 2:211–227.
- R. T. Rockafellar (1970). Convex Analysis. Princeton University Press, Princeton, Newjersy.
- J. S. Treiman (1995). The linear nonconvex generalized gradient and Lagrange multipliers. SIAM J. Optim. 5:670–680.
- J. J. Ye and J. Zhang (2013). Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications. Math. Program. 139:353–381.