Image regularity conditions for nonconvex multiobjective optimization problems with applications

References

• Luenberger DG. Linear and nonlinear programming. Addison-Wesley: Second Edition; 1984.
   Google Scholar
• Minoux M. Mathematical programming: theory and algorithms. Chichester: John Wiley and Sons; 1986.
   Google Scholar
• Mangasarian OL. Nonlinear programming. Philadelphia: SIAM; 1994. (Classics Appl. Math; Vol. 10).
   Google Scholar
• Clarke FH. Optimization and nonsmooth analysis. New York: Wiley; 1983.
   Google Scholar
• Burke JV. Calmness and exact penalization. SIAM J Control Optim. 1991;29:493–497.
   Web of Science ®Google Scholar
• Karlin S. Mathematical methods and theory in games. Addison-Wesley; 1959. (Programming and Economics; Vol. 1).
   Google Scholar
• Burke JV. An exact penalization viewpoint of constrained optimization. SIAM J Control Optim. 1991;29:968–998.
   Web of Science ®Google Scholar
• Giannessi F. Theorems of alternative, quadratic programs, and complementarity problems. In: Cottle RW, Giannessi F, Lions J-L, editors. Variational inequalities and complementarity problems. Theory and applications. New York: Wiley; 1980. p. 151–186.
   Google Scholar
• Giannessi F. Constrained optimization and image space analysis. Vol. 1, New York: Separation of Sets and Optimality Conditions. Springer; 2005.
   Google Scholar
• Li SJ, Xu YD, You MX, et al. Constrained extremum problems and image space analysis. Part I: optimality conditions. J Optim Theory Appl. 2018;177:609–636.
   Web of Science ®Google Scholar
• Li SJ, Xu YD, You MX, et al. Constrained extremum problems and image space analysis. Part II: duality and penalization. J Optim Theory Appl. 2018;177:637–659.
   Web of Science ®Google Scholar
• Li SJ, Xu YD, You MX, et al. Constrained extremum problems and image space analysis. Part III: generalized systems. J Optim Theory Appl. 2018;177:660–678.
   Web of Science ®Google Scholar
• Giannessi F. On the theory of Lagrangian duality. Optim Lett. 2007;1:9–20.
   Web of Science ®Google Scholar
• Giannessi F, Mastroeni G. Separation of sets and Wolfe duality. J Glob Optim. 2008;42:401–412.
   Web of Science ®Google Scholar
• Mastroeni G. Some applications of the image space analysis to the duality theory for constrained extremum problems. J Glob Optim. 2010;46:603–614.
   Web of Science ®Google Scholar
• Zhu SK, Li SJ. Unified duality theory for constrained extremum problems. Part I: image space analysis. J Optim Theory Appl. 2014;161:738–762.
   Web of Science ®Google Scholar
• Zhu SK, Li SJ. Unified duality theory for constrained extremum problems. Part II: special duality schemes. J Optim Theory Appl. 2014;161:763–782.
   Web of Science ®Google Scholar
• Dien PH, Mastroeni G, Pappalardo M, et al. Regularity conditions for constrained extremum problems via image space. J Optim Theory Appl. 1994;80:19–37.
   Web of Science ®Google Scholar
• Flores-Bazán F, Mastroeni G. Strong duality in cone constrained nonconvex optimization. SIAM J Optim. 2013;23:153–169.
   Web of Science ®Google Scholar
• Flores-Bazán F, Mastroeni G, Vera C. Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems. J Optim Theory Appl. 2019;181:787–816.
   Web of Science ®Google Scholar
• Giannessi F, Mastroeni G, Pellegrini L. On the theory of vector optimization and variational inequalities image space analysis and separation. In: Giannessi F, editor. Vector variational inequalities and vector equilibria, mathematical theories. Dordrecht: Kluwer; 2000. p. 153–215.
   Google Scholar
• Zhu SK. Image space analysis to Lagrange-type duality for constrained vector optimization problems with applications. J Optim Theory Appl. 2018;177:743–769.
   Web of Science ®Google Scholar
• Xu YD, Zhou CL, Zhu SK. Image space analysis for set optimization problems with applications. J Optim Theory Appl. 2021;191:311–343.
   Web of Science ®Google Scholar
• Xu YD, Zhang PP, Zhu SK. Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis. Optimization. 2021;70:1673–1701.
   Web of Science ®Google Scholar
• Ansari QH, Sharma PK, Qin X. Characterizations of robust optimality conditions via image space analysis. Optimization. 2020;69:2063–2083.
   Web of Science ®Google Scholar
• Pellegrini L, Zhu SK. Constrained extremum problems, regularity conditions and image space analysis. Part II: the vector finite-dimensional case. J Optim Theory Appl. 2018;177:788–810.
   Web of Science ®Google Scholar
• Fullerton RE, Braunschweiger CC. Quasi-interior points of cones. University of Delaware, Department of Mathematics; 1963. (Technical Report No. 2).
   Google Scholar
• Borwein JM, Lewis AS. Partially finite convex programming, part I: quasi relative interiors and duality theory. Math Program Ser A. 1992;57:15–48.
   Web of Science ®Google Scholar
• Gerth C, Weidner P. Nonconvex separation theorems and some applications in vector optimization. J Optim Theory Appl. 1990;67:297–320.
   Web of Science ®Google Scholar
• Chen GY, Huang XX, Yang XQ. Vector optimization: set-valued and variational analysis. Berlin: Springer; 2005. (Lecture Notes in Economics and Mathematical Systems; Vol. 541).
   Google Scholar
• Luc DT. Multiobjective linear programming. New York: Springer; 2016.
   Google Scholar
• Mordukhovich BS, Nam NM. An easy path to convex analysis and applications. Williston, VT: Morgan & Claypool Publishers; 2014.
   Google Scholar
• Li ZF, Wang SY. Lagrange multipliers and saddle points in multiobjective programming. J Optim Theory Appl. 1994;83:63–81.
   Web of Science ®Google Scholar
• Gould FJ, Howe SM. A new result on interpreting Lagrange multipliers as dual variables. Chapel Hill, NC: Department of Statistics, University of North Carolina; 1971. (Institute of Statistics Mimeo Series No. 738).
   Google Scholar
• Sun XL, Li D, McKinnon KIM. On saddle points of augmented lagrangians for constrained nonconvex optimization. SIAM J Optim. 2005;15:1128–1146.
   Web of Science ®Google Scholar
• Huang XX, Teo KL, Yang XQ. Calmness and exact penalization in vector optimization with cone constraints. Comput Optim Appl. 2006;35:47–67.
   Web of Science ®Google Scholar