[1] Q. H. Ansari, S. Schaible, and J.-C. Yao, “η-pseudolinearity,” Rivista di Matematica per le Scienze Economiche e Sociali, vol. 22, pp. 31–39 (1999).
[2] T. Antczak, “r-preinvexity and r-invexity in mathematical programming,” Computers and Mathematics with Applications, vol. 50, pp. 551–566 (2005).
[3] T. M. Apostol, Mathematical Analysis, Reading, MA: Addison-Wesley (1974).
[4] K. J. Arrow and A. C. Enthoven, “Quasiconcave programming,” Econometrica, vol. 29, pp. 779–800 (1961).
[5] M. Avriel, “r-convex functions,” Mathematical Programming, vol. 2, pp. 309–323 (1972).
[6] M. Avriel, W. E. Diewert, S. Schaible, and I. Zang, Generalized Concavity, New York: Plenum Press (1988).
[7] M. Avriel and I. Zang, “Generalized convex functions with applications to nonlinear programming,” in Mathematical Programs for Activity Analysis, P. Van Moeseke, Ed., Amsterdam: North-Holland, pp. 23–33 (1974).
[8] C. R. Bector, S. Chandra, and M. K. Bector, “Sufficient optimality conditions and duality for a quasiconvex programming problem,” Journal of Optimization Theory and Applications, vol. 59, pp. 209–221 (1988).
[9] C. R. Bector and C. Singh, “B-vex functions,” Journal of Optimization Theory and Applications, vol. 71, pp. 237–253 (1991).
[10] C. R. Bector, S. K. Suneja, and C. S. Lalitha, “Generalized B-vex functions and generalized B-vex programming,” Journal of Optimization Theory and Applications, vol. 76, pp. 561–576 (1993).
[11] A. Ben-Israel and B. Mond, “What is invexity?,” Journal of the Australian Mathematical Society, Series B, vol. 28, pp. 1–9 (1986).
[12] J. V. Burke and M. C. Ferris, “Characterization of solution sets of convex programs,” Operations Research Letters, vol. 10, pp. 57–60 (1991).
[13] A. Cambini and L. Martein, Generalized Convexity in Optimization, Berlin: Springer-Verlag (2009).
[14] R. Cambini and L. Carosi, “A note on scalar ‘generalized’ invexity,” Journal of Information and Optimization Sciences, vol. 40, pp. 615–632 (2019).
[15] R. Cambini and L. Martein, “First and second order characterizations of a class of pseudoconcave vector functions,” in Generalized Convexity and Generalized Monotonicity, N. Hadjisavvas, J. E. Martínez-Legaz, and J.-P. Penot, Eds., Berlin: Springer, pp. 144–158 (2001).
[16] E. Caprari, “η-invex functions and (F, η)-convex functions: properties and equivalences,” Optimization, vol. 52, pp. 65–74 (2003).
[17] M. Castellani and M. Giuli, “A characterization of the solution set of pseudoconvex extremum problems,” Journal of Convex Analysis, vol. 19, pp. 113–123 (2012).
[18] B. D. Craven and B. M. Glover, “Invex functions and duality,” Bulletin of the Australian Mathematical Society, Series A, vol. 39, pp. 1–20 (1985).
[19] J. A. Ferland, “Mathematical programming problems with quasiconvex objective functions,” Mathematical Programming, vol. 3, pp. 296–301 (1972).
[20] J. Gauvin, “A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming,” Mathematical Programming, vol. 12, pp. 136–138 (1977).
[21] F. Giannessi, Constrained Optimization and Image Space Analysis. Volume 1: Separation of Sets and Optimality Conditions, New York: Springer (2005).
[22] G. Giorgi, “Quasi-convex programming revisited,” Calcolo, vol. 21, no. 4, pp. 307–316 (1984).
[23] G. Giorgi, “A note on the relationships between convexity and invexity,” Journal of the Australian Mathematical Society, Series B, vol. 32, pp. 97–99 (1990).
[24] G. Giorgi, “On sufficient optimality conditions for a quasiconvex programming problem,” Journal of Optimization Theory and Applications, vol. 81, pp. 401–405 (1994).
[25] G. Giorgi, “Some remarks on preinvex functions and other generalized convex functions,” Mathematical Reports of the Romanian Academy, vol. 10 (60), pp. 317–325 (2008).
[26] G. Giorgi, “On some generalizations of preinvex functions,” International Journal of Pure and Applied Mathematics, vol. 49, pp. 121–129 (2008).
[27] G. Giorgi and A. Guerraggio, “Various types of nonsmooth invex functions,” Journal of Information and Optimization Sciences, vol. 17, pp. 137–150 (1996).
[28] G. Giorgi and A. Guerraggio, “Constraint qualifications in the invex case,” Journal of Information and Optimization Sciences, vol. 19, pp. 373–384 (1998).
[29] G. Giorgi and A. Guerraggio, “The notion of invexity in vector optimization: smooth and nonsmooth case,” in Generalized Convexity, Generalized Monotonicity, J.-P. Crouzeix et al., Eds., Dordrecht: Kluwer Academic Publishers, pp. 389–405 (1998).
[30] G. Giorgi and A. Guerraggio, “Nonsmooth vector-valued invex functions and applications,” Journal of Information and Optimization Sciences, vol. 21, pp. 243–255 (2000).
[31] G. Giorgi, B. Jiménez, and V. Novo, “Some applications of invexity and generalized invexity to Pareto optimization problems,” International Journal of Optimization: Theory, Methods and Applications, vol. 1, pp. 1–14 (2009).
[32] G. Giorgi, B. Jiménez, and V. Novo, Basic Mathematical Programming Theory, Berlin: Springer (2023).
[33] G. Giorgi and S. Mititelu, Extremum Conditions in Quasi-Convex Programming, Paper A-102, Dipartimento di Ricerca Operativa e Scienze Statistiche, Università di Pisa (1983).
[34] G. Giorgi and E. Molho, “Generalized invexity: relationships with generalized convexity and applications to optimality and duality conditions,” in Generalized Concavity for Economic Applications, P. Mazzoleni, Ed., Pisa: A.M.A.S.E.S., University of Pisa, Faculty of Economics, pp. 53–70 (1992).
[35] G. Giorgi and G. N. Rueda, “η-pseudolinearity and efficiency,” International Journal of Optimization: Theory, Methods and Applications, vol. 1, no. 2, pp. 155–159 (2009).
[36] M. Guignard, “Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space,” SIAM Journal on Control, vol. 7, pp. 232–241 (1969).
[37] N. Hadjisavvas, S. Komlósi, and S. Schaible, Eds., Handbook of Generalized Convexity and Generalized Monotonicity, New York: Springer (2005).
[38] M. A. Hanson, “On sufficiency of the Kuhn-Tucker conditions,” Journal of Mathematical Analysis and Applications, vol. 80, pp. 545–550 (1981).
[39] M. A. Hanson, “Invexity and the Kuhn-Tucker theorem,” Journal of Mathematical Analysis and Applications, vol. 236, pp. 594–604 (1999).
[40] M. A. Hanson and B. Mond, “Further generalizations of convexity in mathematical programming,” Journal of Information and Optimization Sciences, vol. 3, pp. 25–32 (1982).
[41] M. A. Hanson and B. Mond, “Convex transformable programming problems and invexity,” Journal of Information and Optimization Sciences, vol. 8, pp. 201–207 (1987).
[42] M. A. Hanson and B. Mond, “Necessary and sufficient conditions in constrained optimization,” Mathematical Programming, vol. 37, pp. 51–58 (1987).
[43] G. Heal, “Equivalence of saddle-points and optima for non-concave programmes,” Advances in Applied Mathematics, vol. 5, pp. 398–415 (1984).
[44] M. R. Hestenes, Optimization Theory: The Finite-Dimensional Case, New York: J. Wiley (1975).
[45] R. Horst, Über mittelbar konvexe Optimierung, Doctoral dissertation, Technische Hochschule Darmstadt (1971).
[46] R. Horst, “Mittelbar konvexe Funktionen und Optimierungsaufgaben,” Operations Research Verfahren, vol. XII, Verlag Anton Hain, Meisenheim am Glan, pp. 213–228 (1972).
[47] R. Horst, “On the convexification of nonlinear programming problems: an applications-oriented survey,” European Journal of Operational Research, vol. 15, pp. 382–392 (1984).
[48] V. I. Ivanov, “Characterizations of pseudoconvex functions and semistrictly quasiconvex ones,” Journal of Global Optimization, vol. 57, pp. 677–693 (2013a).
[49] V. I. Ivanov, “Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities,” Journal of Optimization Theory and Applications, vol. 158, pp. 65–84 (2013b).
[50] V. I. Ivanov, “Characterizations of solution sets of differentiable quasiconvex programming problems,” Journal of Optimization Theory and Applications, vol. 181, pp. 144–162 (2019).
[51] V. Jeyakumar and X. Q. Yang, “On characterizing the solution sets of pseudolinear programs,” Journal of Optimization Theory and Applications, vol. 87, pp. 747–755 (1995).
[52] P. Kanniappan and P. Pandian, “On generalized convex functions in optimization theory: A survey,” Opsearch, vol. 33, pp. 174–185 (1996).
[53] R. N. Kaul and S. Kaur, “Optimality criteria in nonlinear programming involving nonconvex functions,” Journal of Mathematical Analysis and Applications, vol. 105, pp. 104–112 (1985).
[54] S. Ketabchi and E. Ansari-Piri, “On the solution set of convex problems and its numerical application,” Journal of Computational and Applied Mathematics, vol. 206, pp. 288–292 (2007).
[55] K. O. Kortanek and I. P. Evans, “Pseudo-concave programming and Lagrange regularity,” Operations Research, vol. 15, pp. 882–891 (1967).
[56] H. P. Künzi, W. Krelle, and W. Oettli, Nonlinear Programming, Waltham, MA: Blaisdell Publishing Co. (1966).
[57] C. S. Lalitha and M. Mehta, “Characterization of solution sets of mathematical programs in terms of Lagrange multipliers,” Optimization, vol. 58, pp. 995–1007 (2009).
[58] X. F. Li, J. L. Dong, and Q. H. Liu, “Lipschitz B-vex functions and nonsmooth programming,” Journal of Optimization Theory and Applications, vol. 93, pp. 557–574 (1997).
[59] P. O. Lindberg, “Power convex functions,” in Generalized Concavity in Optimization and Economics, S. Schaible and W. T. Ziemba, Eds., New York: Academic Press, pp. 153–165 (1981).
[60] O. L. Mangasarian, “A simple characterization of solution sets of convex programs,” Operations Research Letters, vol. 7, pp. 21–26 (1988).
[61] D. H. Martin, “The essence of invexity,” Journal of Optimization Theory and Applications, vol. 47, pp. 65–76 (1985).
[62] J. E. Martinez-Legaz, “What is invexity with respect to the same η?,” Taiwanese Journal of Mathematics, vol. 13, no. 2B, pp. 753–755 (2009).
[63] B. Martos, Nonlinear Programming: Theory and Methods, Amsterdam: North-Holland (1975).
[64] S. K. Mishra and G. Giorgi, Invexity and Optimization, Berlin: Springer-Verlag (2008).
[65] S. Mititelu, “Extremum conditions for nonlinear functions on convex sets,” R.A.I.R.O., vol. 8, no. V-2, pp. 113–118 (1974).
[66] S. Mititelu, “Optimality, minimax and duality in nonlinear programming,” Optimization, vol. 18, pp. 501–506 (1987).
[67] P. V. Moeseke, “Saddle point in homogeneous programming without Slater condition,” Econometrica, vol. 42, pp. 593–596 (1974).
[68] B. Mond, “Generalized convexity in mathematical programming,” Bulletin of the Australian Mathematical Society, vol. 27, pp. 185–202 (1983).
[69] A. Mukherji, “Quasi-concave optimization: Sufficient conditions for a maximum,” Economics Letters, vol. 30, pp. 341–343 (1989).
[70] R. Osuna-Gomez, A. Beato-Moreno, and A. Rufian-Lizana, “Generalized convexity in multiobjective programming,” Journal of Mathematical Analysis and Applications, vol. 233, pp. 205–220 (1999).
[71] R. Osuna-Gomez, A. Rufian-Lizana, and P. Ruiz-Canales, “Invex functions and generalized convexity in multiobjective programming,” Journal of Optimization Theory and Applications, vol. 98, pp. 651–661 (1988).
[72] H. X. Phu, “Is invexity weaker than convexity?,” Vietnam Journal of Mathematics, vol. 32, pp. 87–94 (2004).
[73] H. X. Phu, “On some badly-solved problems with invexity,” Acta Mathematica Vietnamica, vol. 29, pp. 89–106 (2004).
[74] H. X. Phu, “On a necessary optimality condition with invexity,” Acta Mathematica Vietnamica, vol. 29, pp. 141–148 (2004).
[75] R. Pini, “Invexity and generalized convexity,” Optimization, vol. 22, pp. 513–525 (1991).
[76] R. Pini and C. Singh, “A survey of recent [1985–1995] advances in generalized convexity with applications to duality theory and optimality conditions,” Optimization, vol. 39, pp. 311–360 (1997).
[77] L. Qi, “On an extended Lagrange claim,” Journal of Optimization Theory and Applications, vol. 108, pp. 685–688 (2001).
[78] N. G. Rueda, “Generalized convexity in nonlinear programming,” Journal of Information and Optimization Sciences, vol. 10, pp. 395–400 (1989).
[79] N. G. Rueda, C. Singh, and C. R. Bector, “Further properties of B-vex functions,” Journal of Information and Optimization Sciences, vol. 13, pp. 195–206 (1992).
[80] S. Schaible and W. T. Ziemba, Eds., Generalized Concavity in Optimization and Economics, New York: Academic Press (1981).
[81] T. Q. Son and D. S. Kim, “A new approach to characterize the solution set of a pseudoconvex programming problem,” Journal of Computational and Applied Mathematics, vol. 261, pp. 333–340 (2014).
[82] W. A. Thompson and D. W. Parke, “Some properties of generalized concave functions,” Operations Research, vol. 21, pp. 305–313 (1973).
[83] X. M. Yang, “On characterizing the solution sets of pseudoinvex extremum problems,” Journal of Optimization Theory and Applications, vol. 140, pp. 537–542 (2009).
[84] Z. Wu, “The convexity of the solution set of a pseudoconvex inequality,” Nonlinear Analysis, vol. 69, pp. 1666–1674 (2008).
[85] Z. L. Wu and S. Y. Wu, “Characterizations of the solution sets of convex programs and variational inequality problems,” Journal of Optimization Theory and Applications, vol. 130, pp. 339–358 (2006).
[86] C. Zalinescu, “A critical view on invexity,” Journal of Optimization Theory and Applications, vol. 162, pp. 695–704 (2014).
[87] C. Zalinescu, “On second-order generalized convexity,” Journal of Optimization Theory and Applications, vol. 168, pp. 802–829 (2016).
[88] I. Zang, “Concavifiability of C²-functions: a unified exposition,” in Generalized Concavity in Optimization and Economics, S. Schaible and W. T. Ziemba, Eds., New York: Academic Press, pp. 131–152 (1981).