What is quasiconvex analysis?

Optimization

Volumn 47, Issue 1-2, 2000, Pages 35-110

  Penot, Jean Paul ^a  

^a UPRES A 5033 IPRA   (France)

Author keywords

Conjugacy; Duality; Gggeneralized convexity; Quasi duality; Quasiconvexity; Subdifferential

Indexed keywords

EID: 0007107394     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930008844469     Document Type: Article

References (318)

1. Amara, C. (1997). Directions de majoration d'une fonction auasiconvexe et applications, Serdica Math. J., 24, 289-306.
2. Amara, C. and Voile, M. (1997). Compleménts de duaiite quasiconvexe, to appear in Ann. Sci. Quebec, preprint Univ. Avignon.
3. Arrow, K. J. and Enthoven, A. (1961). Quasi-concave programming, Econometrics 29(4), 779-800.
4. Atteia, M. (1973). Analyse convexe projective, C.R. Acad. Sci. Paris Série A, 276, 795-798, ibidem 855-858.
5. Atteia, M. and Elqortobi, A. (1981). Quasi-convex duality, In: Optimization and optima! control, Proc. Conference Oberwolfach March 1980', Auslender, A. el ai. Eds., Lecture notes in Control and Inform. Sci., 30, Springer-Verlag, Berlin, 3-8.
6. Attouch, H. (1984). Variational convergence for functions and operators, Pitman, London.
7. Attouch, H. and Brézis, H. (1986). Duality for the sum of convex functions in general Banach spaces, In: Aspects of Mathematics and its applications, Barroso, J. A. Ed., Elsevier, pp. 125-133.
8. Aubin, J.-P. and Frankowska, H. (1990). Set-valued analysis, Birkhâuser, Basel.
9. Aussel, D., Théoremè de la valeur movenne et convexité généralisée en analyse non reguliere. Thesis, Univ. B. Pascal, Clermont, November 1994.
10. Aussel, D. (1998). Subdifferential properties of quasiconvex and pseudoconvex functions: a unified approach, J. Optim. Theory Appl., 97, 29-45.
11. Aussel, D., Corvellec, J.-N. and Lassonde, M. (1995). Mean value property and subdifferential criteria for lower semicontinuous functions, Trans. Amer. Math. Soc., 347, 41474161.
12. Aussel, D., Corvellec, J.-N. and Lassonde, M. (1994). Subdifierential characterization of quasi-convexity and convexity, J. Convex Anal, 1(2), 195-202.
13. Aussei, D., Corveiiec, J.-N. and Lassonde, M., Noasmooth constrained optimization and multidirectional mean value inequalities, preprint, Univ. Antilles-Guyane, Points-a-Pitre, September 1996.
14. Aussel, D. and Daniilidis, A. (1998). Normal characterizations of the main classes of quasiconvex functions, preprint, Univ. of Pau and Perpignan.
15. Avriel, M. (1976). Nonlinear programming. Analysis and methods, Prentice Hall, Englewood Cliffs, New Jersey.
16. Avriel, M. and Schaible, S. (1978). Second order characterizations of pseudoconvex functions, Math. Prog., 14, 170-185.
17. Avriel, M., Diewert, W. E., Schaible, S. and Zang, I. (1988). Generalized Concavity, Plenum Press, New York and London.
18. Azé, D. and Penot, J.-P. (1995). Uniformly convex and uniformly smooth convex function, Ann. Fac. Sci. Toulouse, 4(4), 705-730.
19. Azé, D. and Voile, M. (1990). A stability result in quasi-convex programming, J. Optim. Th. Appl., 67(1), 175-184.
20. Balder, E. J. (1977). An extension of duality-stability relations to non-convex optimization problems, SIAM J. Control Opt., 15, 329-343.
21. Bardi, M. and Evans, L. C. (1984). On Hopf's formulas for solutions of Hamilton-Jacobi equations, Nonlin. Anal. Th. Meth. Appl., 8(11), 1375-1381.
22. Barles, G. (1994). Solutions de viscosite des equations de Hamilton-Jacobi, Math, et Appl. #17, Springer, Berlin.
23. Barron, E. N. and Liu, W. (1997). Calculus of variations in L°°, Applied Math. Ont., 35, 237-243.
24. Barron, E. N., Jensen, R. and Liu, W. (1996). Hopf-Lax formula for u, + H(u, Du) = 0, J. Differ. Eg., 126, 48-61.
25. Barron, E. N., Jensen, R. and Liu, W. (1998). Applications of Hopf-Lax formula for u, + H(u,Du) = 0, SIAM J. Math. Anal., 29(4), 1022-1039.
26. Barron, E. N., Jensen, R. and Liu, W. (1997), Hopf-Lax formula for u + H{u,Du) = 0 n, Comm. P.D.E., 22, 1141-1160.
27. Barros, A. I. (1998). Discrete and fractional programming techniques for location models Kiuwer Dordrccht.
28. Bector. C. R. and Singh, C. (1991). B-vex functions, J. Optim. Th. Appl., 71(2), 237-254.
29. Bector, C. R., Chandra, S. and Kumar, V. (1998). Fenchel duality in generalized fractional programming, In: "Generalised convexity, generalized monotonicity recent results", Crouzeix, J.-P., Martinez-Leg-J. E. and Voiie, Xi. jESs.), Kluwer, Dordrecht, pp. 373-386
30. Beer, G. and Lucchetti, R. (1989). Minima of quasiconvex functions, Optimiza-tion, 20, 581-596.
31. Beer, G., Rockafellar, R. l. and Wets, R. j.-B. (1992). A characterization of epi-convergence in terms of convergence of level sets, Proc. Amer, Math. Soc., 116(3), 753-762.
32. Ben Israel, A. and Mond, B. (1986). What is invexity?, J. Aust. Math. Soc. Ser. B, 28,1-9.
33. Benson, H, P. (1995). Concave minimization theory. Applications and algo rithms, In: Handbook of Global Optimization, Horst, R. and Pardaios, P. M. Eds., Kluwer, Dordrecht, Netherlands, pp. 43-148.
34. Bhatia, D. and Jain, P. (1995). Nondifferentiable pseudo-convex functions and duality for minimax programming problems, Optimization, 35(3), 207-214.
35. Bhatia, D. and Kumar, P. (1996). Duality for variational problems with B-vex functions. Optimization, 36(4), 347-360.
36. Bianchi, M. (1996). Generalized quasimonotonicity and strong pseudo-mono-tomcity of bi{dotless}functtons, Optimization, 36(1), 1-10.
37. Birkhoff, G. (1966). Lattice Theory, Amer. Math. Soc., Providence.
38. Boncomte, M. and Martinez-Legaz, J. E. (1991). Fractional programming by lower subdifferentiability techniques, J. Opt. 'l'h. Appl., 68(1), 95-116.
39. Borde, J. (1985). Quelques aspects theoriques et algorithmiques en quasi-convexste', Thesis, Univ. Clermont II, Aubiere.
40. Borde, J. and Crouzeix, J.-P. (1990). Continuity properties of the normal cone to the level sets of a quasiconvex function, J. Opt. Th. Appl, 66, 415-429.
41. Borwein, J. M. and Zhu, Q. J. (1996). Viscosity solutions and viscosity subderivatives in smooth Banach spaces with application to metric regularity, SIAM J. Control and Opt., 34, 1568-1591.
42. Cambini, A., Castagnoli, E., Martein, L., Mazzoleni, P. and Schaible, S. (Eds.), Generalized Convexity and fractional programming with economic applications, Proc. Pisa, 1988, Lecture Notes in Economics and Math. Systems 345, Springer Verlag, Berlin, 1990.
43. Cambini, A. and Martein, L, (1985). On the Fenehel-like and Lagrangian duality in fractional programming, Methods of Oper. Res., 53, 21-32.
44. Cambini, A. and Martein, L, Generalized concavity and optimality conditions in vector and scalar optimization, In: "Generalized convexity", Komlosi, S., Racsâk, T. and Schaible, S., Eds., Springer Verlag, Berlin, pp. 337-357.
45. Cambini, R. (1996). Some new classes of generalized concave vector-valued functions. Optimization, 36(1), 11-24.
46. Chabrillac, Y. and Crouzeix, J.-P. (1987). Continuity and differentiability properties of monotone real variables, Math. Prog. Study, 30, 1-16.
47. Clarke, F. H. (1983). Optimization and Nonsmooth Analysis, Wiley-Interscience, New-York.
48. Clarke, F. H., Stem, R. J. and Wolenski, P. R. (1993). Subgradient criteria for monotonicity, the Lipschitz condition and monotonicity, Canadian J. Math., 45, 1167-1183,
49. Contesse, L. and Penot, J.-P. (1991). Continuity of the Fenchel correspondence and continuity of polarities, J. Math. Anal. Appl., 156, 305-328.
50. Correa, R., Jofre, A. and Thibault, L. (1992). Characterization of lower semi-continuous convex functions, Proc. Amer, Math, Soc., 116. 67-72.
51. Correa, R., Jofre, A. and Thibault, L. (1984). Subdifferential monotonicity as a characterization of convex functions, Numer. Fund. Anal. Opt., 15, 531-535.
52. Crandall, M. G. and Lions, P. L. (1983). Viscosity solutions to Hamilton-Jacobi equations, Trans. Amer. Math. Soc., 277, 1-42.
53. Craven, B. D. (1981). Invex functions and constrained local minima. Bull. Aust. Math. Soc., 24, 357-366.
54. Craven, B. D. and Giover, B. M. (1985). Invex functions and duality, J. Aust. Math. Soc. Ser. A, 39, 1-20.
55. Craven, B. D, Ralph, D. and Giover, B. M. (1995). Small convex-valued subdifferentials in mathematical programming, Optimization, 32(1), 1-22.
56. Crouzeix, J.-P. (1974). Polaires quasi-convexes et dualite, C.R. Acad. Sci. Paris Série A, 279, 955-958.
57. Crouzeix, J.-P. (1977). Contribution a l'étude des fonctions quasi-convexes, These d'Etat, Univ. de Clermont II.
58. Crouzeix, J.-P. (1980). Condition for convexity of a quasiconvex function, Math. Oper. Res., 5(1), 120-125.
59. n, In: "Optimization and optimal control, Proceedings Conference Oberwolfach 1980, Auslender, A., Oettli, W. and Stoer, J., Eds., Lecture Notes in Control and Information Sciences 30, Springer-Verlag, pp. 89-104.
60. n, In: "Generalized concavity in optimization and economics", Schaible, S. and Ziemba, W. T., Eds., Academic Press, New York, pp. 109-130.
61. Crouzeix, J.-P. (1982). About differentiability of order one of quasiconvex functions on &?", J. Optim. Th. Appl., 36, 367-385.
62. Crouzeix, J.-P. (1983). Duality between direct and indirect utility functions, J. Math. Econ., 12, 149-165
63. Crouzeix, J.-P. (1998). Characterization of generalized convexity and generalized monotonicity, a survey In: Generalised convexity, generalised monotonicity: recent results", Crouzeix, J.-P. Martinez-Legaz, J. E. and Voile, M. (Eds.), Kluwer, Dordrecht, pp. 237-257.
64. Crouzeix, J.-P. (1998). Some properties of Dini-derivatives of quasi-convex functions, In: "New trends in mathematical programming, Giannessi, F. et al. (Eds.), Kluwer, Dordrecht, pp. 41-57.
65. Crouzeix, J.-P. and Ferland, J. A. (1982). Criteria for quasiconvexity and pseudoconvexity: relationships and comparisons, Math. Programming, 23,193-205.
66. Crouzeix, J.-P. and Ferland, J. A. (1996). Criteria for differentiable generalized monotone maps, Math. Programming, 75, 399-406.
67. Crouzeix, J.-P., Ferland, J. A. and Schaible, S. (1992). Generalized convexity of affine subspaces with an application to potential functions, Math. Programming, 56, 223-232.
68. Crouzeix, J.-P., Ferland, J. A. and Zâlinescu, C. (1997). a-convex sets and strong quasiconvexity, Math. Oper. Res., 22, 998-1022.
69. Crouzeix, J.-P. and Lindberg, P. O. (1986). Additiveiy decomposed quasiconvex functions, Math. Prog., 35, 42-57.
70. Dal Maso, G. (1993)., Birkhâuser, Basel.
71. Danao, R. A. (1992). Some properties of explicitely quasiconcave functions, J. Optim. Th. Appl., 74(3), 457-468.
72. Daniilidis, A. and Hadjisawas, N. (1998). On the subdifferentials of generalized convex functions and cyclicity, Technical note 98-01, Univ. of the Aegean, Samos, Greece to appear in J. Math. Anal. Appl.
73. Daniilidis, A. and Hadjisawas, N. (1998). Characterization of nonsmooth semi-strictly quasiconvex functions and strictly quasiconvex functions, Technical note 98-03, Univ. of the Aegean, Samos, Greece, to appear in J. Opt. Th. Appl.
74. Daniilidis, A. and Hadjisawas, N. (1994). Existence theorems for vector variational inequalities, Bull. Austral. Math. Soc., 54, 473-481.
75. Debreu, G. and Koopmans, T, C. (1982). Additively decomposed quasiconvex functions, Math. Prog., 23, 193-205.
76. Deumlich, R. (1992). On duality concepts in fractional programming (Part I), Optim., 25(1), 25-46.
77. Deumlich, R. and Elster, K.-H. (1980). Φ-conjugation and nonconvex optimization. A survey-Part I, Math. Operationsforsch. Stat. Ser. Optim., 14(1), 125-149.
78. Deumlich, R. and Elster, K.-K. (1980). Φ-conjugation and nonconvex optimization. A survey-Part II, Math. Operationsforsch. Stat. Ser. Optim., 15(2), 499-515.
79. Deumlich, R. and Eister, K.-H. (1980). Φ-conjugation and nonconvex optimization. A survey-Part III, Optim., 16(6), 789-803.
80. Diewert, W. E. (1981). "Alternative characterizations of six kinds of quasi-concavitv in the non-differentiable case with applications to nonsmooth programming", In: Schaible, S. and Ziemba, W. T. (Eds.), Generalized Concavity in Optimization and Economics, Academic Press, New-York,
81. Diewert, W. E., Duality approaches to microeconomics theory. In: Handbook of Mathematical Economics, 2, Arrow, K. J. and Intriligator, M. D., Eds., North Holland, Amsterdam, 1982, 535-599.
82. Dinkelbach, W. (1967). On nonlinear fractional programming, Management Sci., 13, 492-498.
83. Dolecki, S. (1991). Γ-inequalities and stability of generalized external convolu-tions, Math. Nachr., 152, 299-323.
84. Dolecki, S. and Kurcyusz, S. (1978). On Φ-convexity in external problems, SIAM J. Control Optim., 16, 277-300.
85. Dontcnev, A. L. and Zolezzi, T., Well-posed optimization problems. Lecture Notes in Maths # 1543, Springer Verlag. Berlin, 1993.
86. Duîta, J., Vetrivel, V. and Nanda, S. (1997). Semi-invex functions and their subdifferentials, Bull. Austral. Math. Soc., 56, 385-393.
87. Eberhard, A. and Nyblom, M., Generalized convexity, proximal normality and differences of functions, preprint, Royal Melbourne Institute of Technology, Melbourne, Dec. 1995.
88. Eberhard, A., Nyblom, M. and Ralph, D. (1998). Applying generalized convexity notions to jets, In: "Generalized convexity, generalized monotonicity: recent results, Crouzeix, J.-P., Martinez-Legaz, J. E. and Voile, M. (Eds.), Kluwer, Dordrecht, pp. 110-157.
89. Ellaia, R. and Hassouni, H. (1991). Characterization of nonsmooth functions through their generalized gradients, Optimization, 22, 401-416.
90. Elqortobi, A. (1992). Inf-convolution quasi-convexe des fonctionnelles positives, Re ch. Oper., 26, 301-311.
91. Elqortobi, A. (1993). Conjugation quasi-convexe des fonctionnelles positives, Annales Sci. Math. Quebec, 17(2), 155-167.
92. Elster, K.-H, and Nehse, R. (1974). Zur theorie der polarfunktionale, Math. Oper.Stat., 5, 3-21.
93. Elster, K.-H. and Thierfelder, J. (1988). Abstract cone approximations and generalized differentiability of in nonsmooth optimization, Optimization, 19, 351-141
94. Elster, K.-H. and Wolf, A. (1988). Recent results on generalized conjugate functions, In: Trends in Mathematical Optimization, Hoffmann, K. H. el al., Eds., Int. Series. Numer. Math., 84, Birkhauser, Basel, 67-78.
95. Evans, L. C. (1984). Some max-min methods for Hamilton-Jacobi equations, Indiana Univ., Math. J., 33, 31-50.
96. Evans, L. C. (1998). Partial differential equations, Graduate Studies in Math. # 19, Amer. Math. Soc., Providence.
97. Everett, C. J. (1944). Closure operators and Galois theory in lattices, Trans. Amer. Math. Soc., 55, 514-525.
98. Evers, J. J. M. and van Maaren, H. V. (1981). Duality principles in mathematics and their relations to conjugate functions, memorandum 336 Univ. Twente.
99. Fenchel, W. (1949). On conjugate convex functions, Canadian J. Math., 1,73-77.
100. Flachs, F. and Pollatschek, M. A. (1979). Duality theorems for certain programs involving minimum or maximum operators, Math. Programming, 16, 348-370.
101. Fiores-Bazán, F. (1995). On a notion of subdifferentiabiiity for non-con vex functions, Optimization, 33, 1-8.
102. Flores-Bazán, F. and Martinez-Legaz, J. E. (1998). Simplified global optimality conditions in generalized conjugation theory, In: "Generalised convexity, generalized monotonicity, recent results", Crouzeix, J.-P. Martmez-Legaz, J. E. and v'o'lie, M. (Eds.), Kluwer, Dordrecht, pp. 305-329.
103. Frankowska, H. (1983). Inclusions adjointes associees aux trajectoires minimales d'inclusions diffeiendelles, C.R. Acad. Sci. Paris, Serie I, 297, 461-464.
104. Frankowská H, (1989). Hamilton-Jacobi equations: viscosity solutions and generalized gradients, J. Math. Anal. Appl., 141, 21-26.
105. Frenk, J. G. B., Dias, D. M. L. and Gromicho, J. (1994). Duality theory for convex/quasiconvex functions and its application to optimization, In: Generalized convexity, Proceedings, Pecs, Hungary, 1992, Komlosi, S., Rapcsâk, T. and Schaible, S. (Eds.), Lecture Notes in Economics and Math. Systems # 405, Springer Verlag, Berlin, pp. 153-170.
106. Georgiev, P. (1997). Submonotone mappings in Banach spaces and applications, Set-Valued And., 5(1), 1-35.
107. Ginn, E. (1981). Ensembles ei functions etoilees; applications â '/optimisation et au calcul differcntiel generalise, manuscript, Toulouse.
108. Giorgi, G. and Komlosi, S. Dini derivatives in optimization. Part I, Revista di Mat. per le sc. econ. e sociali, 15(1), 1993, 3-30, Part 11, idem, 15(2) (1993), 3-24, Part III, idem, 18(1) (1996), 47-63.
109. Giorgi, G. and Mituteiu, S. (1993). Convexites generalises et proprietes, Revue Roumaine Math. Pures Appl., 38(2), 125-142.
110. Glover, B. M. (1984). Generalized convexity in nondifferentiable programming, Bull. Australian Math. Soc., 30, 193-218.
111. Glover, B. M. (1991). Optimality and duality results in nonsmooth programming, preprint, Ballarat Univ. College.
112. Glover, B. M. and Jeyakumar, V. (1994). Abstract nonsmooth nonconvex programming, In: Generalized convexity, Proceedings, Pecs, Hungary, 1992, Komlosi, S., Rapcsâk, T. and Schaible, S. (Eds.), Lecture Notes in Economics and Math. Systems # 405, Springer Verlag, Berlin, pp. 186-210.
113. Gondran, M. (1996). Analyse MINPLUS, C.R. Acad. Sci. Paris Serie I, 323, 371-375.
114. Gondran, M. (1996). Analyse MINMAX, C.R. Acad. Sci. Paris Serie I, 323, 1249-1252.
115. Greenberg, H. P. and Pierskaiia, W. P. (1973). Quasiconjugate function and surrogate duality, Cahiers du Centre d'Etude de Recherche Oper., 15, 437-448.
116. Gutierrez, J. M. (1984). Infragradientes y direcciones de decreeimiento, Rev. Real Acad. C. Ex., Fis. y. Nat. Madrid, 78, 523-532.
117. Gutierrez, J. M. (1997). A generalization of the quasiconvex optimization problem, J. Convex Anal., 4(2), 281-288.
118. Gwinner, J. (1981). Bibliography on non-dififerentiable optimization and nonsmooth analysis, J. Comp. Appl. Math., 7, 277-285.
119. Hackman, S. and Passy, U, (1988). Projectively-convex sets and functions, J. Math. Econ., 17, 55-68.
120. Hadjisawas, N. (1994). Continuity properties of quasiconvex functions in infinite dimensional spaces, preprint 94-03 Univ. of California, Riverside.
121. Hanson, M. A. (1981). On sufficiency of the Kuhn-Tucker conditions, J. Math. Anal. Appl., 80, 545-550.
122. Hartwig, H. (1983). On generalized convex functions, Optimization, 14, 49-60.
123. Hartwig, H. (1992). Local boundedness and continuity of generalized convex functions, Optimization, 26, i-13.
124. Hassouni, A. (1983). Sous-differentiel des fonctions quasi-convexes, thèse de traisieme cycle, Univ. P. Sabatier, Toulouse.
125. Hinderer, K. and Stiegglitz, M. (1996). Minimization of quasi-convex symmetric and of discretely quasi-convex symmetric functions, Optimization, 36(4), 321-332.
126. Hiriart-Urruty, J.-B. and Lemarechal, C. (1993). Convex analysis and minimization algorithms, I, II, Springer, Berlin.
127. Hiriart-Urruty, J.-B. and Lewis, A., The Clarke and Michel-Penot subdifferentials of the eigenvalues of a symmetric matrix, to appear in Computational Optimization and Applications, a volume in honor of Mangasarian, O. L. and Pang, J. S., Eds.
128. Hopf, E. (1965). Generalized solutions to non linear equations of first order, J. Math. Mech., 14, 951-974.
129. Horst, R. and Pardalos, P. M. (Eds.) (1995). Handbook of global optimization, Kluwer, Dordrecht.
130. Horst, R. and Pardalos, P. M. and Thoai, N. V. (1995). Introduction to global optimization, Kluwer, Dordrecht.
131. Horst, R. and Tuy, H. (1990). Global optimization, deterministic approaches. Springer Verlag, Berlin.
132. Horvarth, Ch. (1998). Minimax inequalities and connectedness as a substitute for convexity, preprint Univ. Perpignan.
133. Ivanov, E. H. and Nehse, R. (1982). Relations between generalized concepts of convexity and conjugacy. Math, Over. Stat. Optimization, 13, 9-18.
134. Jagannathan, R. and Schaible, S. (1983). Duality in generalized fractional programming via Farkas lemma, J. Opt. Th. Appl., 41, 417-424.
135. Janin R. (1973). Sur une classe de fonctions sous-linearisables, C.R. Acad. Sci. Paris A, 277, 265-267.
136. Janin, R. (1973). Sur la dualite en programmation dynamique. C.R. Acad. Sci. Paris A, in, 1195-1197.
137. Jeyakumar, V. (1987). Nondifferentiable programming and duality with modified convexity, Bull. Australian Math. Soc., 35, 309-313.
138. Jeyakumar, V., Oettli, W. and Natividad, M. (1993). A solvability theorem for a class of quasiconvex mappings with applications to optimization, J. Math. Anal. Appl., 179, 537-546.
139. Jeyakumar, V. and Demyanov, V. F. (1996). A mean value theorem and a characterization of convexity using convexificators, preprint, Univ. New South Wales, Sydney.
140. John, R., Demand-supply systems, variational inequlities and (generalized) monotone functions, preprint Univ. Bonn, August 1996.
141. Jouron, C. (1979). On some structural design problems, In: "Analyse non convexe, Pau, 1979, Bull. Soc. Math., France, Memoire # 60, pp. 87-93.
142. Karamardian, S. (1976). Complementarity over cones with monotone and pseudomonotone maps, J. Optim. Theory Appl, 18, 445-454.
143. Karamardian, S. and Schaible, S. (1990). Seven kinds of monotone maps, J. Optim. Theory Appl., 66, 37-46.
144. Karamardian, S., Schaible, S. and Crouzeix, J.-P. (1993). Characterizations of generalised monotone maps, J. Opt. Th. Appl., 76(3), 399-413.
145. Kiwiel, K. (1985). Methods of descent for nondifferentiable optimization, Lecture Notes in Math. # 1133, Berlin.
146. Kiwiel, K. (1998). Convergence and efficiency of subgradient methods for quasiconvex minimization, preprint, Systems Research Institute, Warsaw.
147. Kiwiel, K. C. and Murty, K. (1996). Convergence of the steepest descent method for minimizing quasi-convex functions, J. Optim. Th. Appl., 89, 221-226.
148. Komlosi, S. (1990). On a possible generalization of Pshenichnyi's quasidifferentiability, Optimization, 21, 3-11.
149. Komlosi, S. (1983). Some properties of nondifferentiable pseudoeonvex functions, Math. Programming, 26, 232-237.
150. Komlosi, S. (1993). On generalized upper quasidifferentiability. In: Giannessi, F. (Ed.) "Nonsmooth Optimization: Methods anu Applications", Gordon and Breach, London, pp. 189-200.
151. Komlosi, S. (1993). Quasiconvex first order approximations and Kuhn-Tucker type optimality conditions, European J. Opt. Res., 65, 327-335.
152. Komlosi, S. (1994). Generalized monotoniciiy in nonsmooth analysis, In: Generalized convexity, Proceedings, Pecs, Hungary, 1992, Komlosi, S., Rapcsâk, T. and Schaible, S. (Eds.). Lecture Notes in Economics and Math. Systems # 405, Springer Verlag, Berlin, pp. 263 275.
153. Komlosi, S. (1995). Generalized monotonicity and generalized convexity, J. Opt. Theory Appl., 84, 361-376.
154. Komlosi, S. (1995). Monotonicity and quasimonotonicity in nonsmooth analysis, In: "Recent Advances in Nonsmooth Optimization, Du, D. Z., Qi, L. and Womersley, R. S. (Eds.) World Scientific Publishers, Singapore, pp. 193-214.
155. Laurent, P.-J. (1972). Approximation et optimisation, Hermann, Paris.
156. Lax, P. D. (1957). Hyperbolic systems of conservation laws II, Commun. Pure Appl. Math., 18, 537-566.
157. Lemaire, B. and Voile, M. (1998). Duality in DC programming, In: "Generalized convexity, generalized monotonicity: recent results", Crouzeix, J.-P., Martinez-Legaz, J. E. and Voile, M. (Eds.) kluwer, Dordrecht, pp. 331-345.
158. Lemaire, B. and Voile, M. (1998). A general duality scheme for nonconvex minimization problems with a strict inequality constraint. Global Qpi., 13(3), 317-327.
159. Lindberg, P. O. (1979). A generalization of Fenchel conjugation giving generalized lagrangians and symmetric nonconvex duality, Survey of Mathematical Programming (Proc. 9th Intern. Progr. Symposium) Akad. Kiado and North Holland, 1, 249-268.
160. Lions, P.-L. (1982). Generalized solutions of Hamilton-Jacobi equations, Research Notes in Math. #69, Pitman, London.
161. Lions, P.-L. and Rochet, C. (1980). Hopf formula and multi-time Hamilton-Jacobi equations, Proc. Amer, Math. Soc., 90, 79-84.
162. Liu, J. C, (1996). Optimization and duality for multiobjective fractional programming involving nonsmooth pseudoconvex functions, Optimization, 36(4), 333-346.
163. Liu, J. C. (1996). Optimization and duality for multiobjective fractional programming involving nonsmooth pseudoeonvex functions, Optimization, 37(1), 27-40.
164. Luc, D. T. (1994). On generalised convex nonsmooth functions, Bull. Aust. Math. SOC., 49, 139-149
165. Luc, D. T. (1993). Characterizations of quasiconvex functions, Bull. Austral. Math. Soc., 48, 393-405.
166. Luc, D. T. and Schaible, S. (1996). Generalized monotone nonsmooth maps, J. Convex Anal., 3(2), 195-206.
167. Luc, D. T. and Swaminathan, S. (1993). A characterization of convex functions, Nonlinear Analysis, Theory, Methods and Appl., 30, 697-701.
168. Luc, D. T. and Voile, M., Level set under infimal convolution and level addition, J. Opt. Th. Appl.
169. Lyall, V., Suneja, S. and Aggarval, S. (1997). Optimality and duality in fractional programming involving semilocally convex and related functions. Optim., 41, 237-255.
170. Makarov, V. L. and Rubinov, A. M. (1970). Superlinear point-set maps and models of economic dynamics, Russ. Math. Surveys, 25(5), 125-170.
171. Mâkelâ, M. M. and Neittaanmaki, P. (1992). Nonsmooth optimization. Analysis and algorithms with applications to optimal control. World Scientific, Singapore.
172. Mangasarian, O. L. (1965). Pseudoconvex functions, SIAM J. Control, 3, 281-290.
173. Mangasarian, O. L., Nonlinear Programming, McGraw-Hill, Nr*-York. 1969.
174. Martin, D. H. (1985). The essence of invexity, J. Opt. Th. Appl, 47, 65-76.
175. Martinet, B. (1972). Aigorithmes pour la resolution de problemes d' optimisation et de tninimax, Thesis, Univ. Grenoble.
176. Martinez-Legaz, J.-E, (1981). Un concepto generalizado de conjugation. Application a las functiones quasiconvexas, Thesis, Univ. Barcelona.
177. Martinez-Legaz, J.-E. (1983). A generalized concept of conjugation methods, In: Optimization, theory and algorithms, Hiriart-Urruty, J.-B., Oettli, W. and Stoer, J. (Eds.), Dekker, New York, pp. 45-49.
178. Martinez-Legaz, J.-E. (1987) Level sets and the minimal time function of linear control processes, Numer. Fund. Anal. Optim., 9(1-2), 105-129.
179. Martinez-Legaz, J.-E. (1988). On lower subdifferentiable functions, In: Trends in Mathematical Optimization, Hoffmann, K. H. et at. (Eds.), Int. Series Numer. Math. 84 Birkhauser, Basel, pp. 197-232,
180. Martinez-Legaz, J.-E. (1988). Quasiconvex duality theory by generalized conjugation methods, Optimization, 19, 603-652.
181. Martinez-Legaz, J.-E. (1990). Generalized conjugation and related topics, In: "Generalized convexity and fractional programming with economic applications, Proceedings Symp. Fisa, Cambini, A. et al. (Eds.), Lecture Notes in Economics and Math. Systems 345, Springer-Verlag, Berlin, pp. 168-197.
182. Martinez-Legaz, J.-E. (1990). Weak lower subdifferentials and applications, Optimization, 21, 321-341.
183. Martinez-Legaz, J.-E. (1990). A characterization of Lagrangian dual problems, Note di Mat., 10 Suppl. 2, 389-394.
184. Martinez-Legaz, J.-E. (1991). Duality between direct and indirect utility functions under minimal hypothesis, J. Math. Econ., 20, 199-209.
185. Martinez-Legaz, J.-E. (1995). Fenchel duality and related properties in generalized conjugaison theory, S.E.A. Bulletin Math., 19(2), 99-106.
186. Martinez-Legaz, J.-E. (1995). On convex and quasiconvex spectral functions, In: "Proceedings of the second Catalan days on Applied Mathematics", Sofonea, M. and Corvellec, J.-N. (Eds.), Presses Univ. Perpignan, pp. 199-208.
187. Martinez-Legaz, J.-E. (1996). Dual representation of cooperative games based on Fenchel-Moreau conjugation, Optim., 36(4), 291-320.
188. Martinez-Legaz, J.-E. and Romano-Rodriguez (1993), Lower subdifferentiability of quadratic functions, Math. Prog., 60, 93-113.
189. Martinez-Legaz, J.-E. and Romano-Rodriguez, S. (1993). a-lower subdifferentiabie functions, SIAM J. Optim., 3(4), 800-825.
190. Martinez-Legaz, J.-E. and Sach, P. H. (1995). A new subdifferentiai in quasiconvex analysis, preprint 95/9, Hanoi Institute of Math., to appear, J. Convex Anal.
191. Martinez-Legaz, J.-E, and Santos, M. S. (1993). Duality between direct and indirect preferences, Econ. Theory, 3, 335-351.
192. Martinez-Legaz, J.-E. and Singer, I. (1990). Dualities between complete lattices, Optim., 21, 481-508.
193. Martinez-Legaz, J.-E. and Singer, I. (1991). Some characterizations of ip-Lagrangian dual problems, Optim., 22, 835-843,
194. Martinez-Legaz, J.-E. and Singer, I. (1991). V-dualities and JL-dualities, Optim., 22,483-511.
195. Martinez-Legaz, J.-E. and Singer, I. (1994). *-Dualities, Optim., 30, 295-315.
196. Martinez-Legaz, J.-E. and Singer, I. (1995). Dualities associated to binary operations on R, J. Convex Anal., 2(1-2), 185-209.
197. Martinez-Legaz, J.-E. and Singer, I. (1995). Subdifferentials with respect to dualities, ZOR-Math. Methods Oper. Res., 42, 109-125.
198. Martinez-Legaz, J.-E. and Singer, I. (1997). An extension of D.C. duality theory, with an appendix on «-subdiflerentiais, Optim., 42, 9-37.
199. Martinez-Legaz, J.-E. and Singer, I. (1998). On $-coovexity of convex functions, Linear Alg. AppL, 278, 163-181.
200. Marios S., Nonlinear programming, theory and methods, North Holland, Amsterdam, 1975.
201. Mazzoleni, P., Generalized concavity for economic applications, troc. Workshop Pisa, 1992, Univ. Verona.
202. Michel, Ph. and Penot, J.-P. (1992). A generalized derivative for calm and stable functions, Differential and Integral Equations, 5(2), 433-454.
203. Moreau, J.-J. (1970). Inf-convolution, sous-additivite, convcxite des fonctions numeriques, J. Math. Pures et Appl., 49, 109-154.
204. Nesterov, Yu. E. (1984). Minimization methods for nonsmooth convex and quasiconvex functions, Ekonom. i Mat. Metody, 20 (1984), 519-531 (in Russian). English transl. in Matekon, 29(3), 519-531.
205. Newman, P. (1969). Some properties of concave functions, J. Econ. Th., 1, 291-314.
206. Ore, O. (1944). Galois connexions, Trans. Amer. Math. Soc., 55, 493-513.
207. Paiiaschke, D. and Roiewicz, S. (1998). Foundations of mathematical optimization. Convex analysis without linearity. Maths, and its appl., Vo I, 3S3, Kluwer,
208. Passy, U. and Prisman, E. Z. (1985). A convexlike duality scheme for quasiconvex programs, Math. Programming, 32, 278-300.
209. Pchenitchny, B. N. and Daniline, Y. (1975). Methodes numeriques dans les problemes d'extrimum, Mir, French transl. Moscow.
210. Penot, J.-P. (1983). Compact nets, filters and relations, J. Math. Anal. Appl, 93(2), 400-417.
211. Penot, J.-P. (1985). Variations on the theme of nonsmooth analysis: another subdifferential, In: "Nondifferentiable optimization', motivations and applications", Demyanov, V. L. and Paiiaschke, D. (Eds.), Lecture Notes in Economics and Math. Systems # 255, Springer, Berlin, pp. 41-54.
212. Penot, J.-P. (1985). Modified and augmented Lagrangian theory revisited and augmented, unpublished lecture, Fermat Days 85, Toulouse.
213. Penot, J.-P. (1995). Conditioning convex and nonconvex problems, Optim. Th. App'l., 90(3), 539-558.
214. Penot, J.-P. (1995), Generalized convexity in the light of nonsmooth analysis, Recent Developments in Optimization, Durier, R. and Michelot, C. (Eds.), Lecture Notes in Economics and Math. Systems # 429, Springer Verlag, Berlin, pp. 269-290.
215. Penot, J.-P. (1996). Favorable classes of mappings and muitimappmgs in nonlinear analysis and optimization, J. Convex Anal., 3(1), 97-116.
216. Penot, J.-P. (1996). Starshaped functions and conjugacy, preprint Univ. of Pau.
217. Penot, J.-P. (1998). Are generalized derivatives useful for generalized convex functions?, In: Generalized convexity, generalized monotonicity, recent results, Crouzeix, J.-P., Martinez-Legaz, J. E. and Voile, M. (Eds.), Kluwer, Dordrecht, pp. 3-59.
218. Penot, J.-P. (1997). Duality for radiant and shady programs, Acta Math. Vietnamica, 22(2), 541-566.
219. Penot, J.-P., Duality for anticonvex programs, preprint Univ. of Pau, 1997.
220. Penot, J.-P. (1998). Well-behavior, well-posedness and nonsmooth analysis, Pliska Stud. Math. Bulgar., 12, 141-190.
221. Penot, J.-P. (1998). Some links between approximation, nonsmooth analysis, penalization and regularization, preprint, Univ. Pau.
222. Penot, J.-P. (1998). Characterization of solution sets of quasiconvex programs, preprint, Univ. of Pau.
223. Penot, J.-P., Explicit solutions to Hamilton-Jacobi equations, in preparation.
224. Penot, J.-P. and Quang, P. H. (1997). On generalized convex functions and generalized monotonicity of set-valued maps, J. Opt. Th. Appl, 92(2), 343-346.
225. Penot, J.-P. and Quang, P. H., On the cutting plane algorithm, preprint Univ. of Pau.
226. Penot, J.-P. and Sach, P. H. (1997). Generalized monotonicity of subdifferentials and generalized convexity, J. Öpli{dotless}m. Theory Appl., 64(1), 251-262.
227. Penot, J.-P. and Terpolilii P. (1983). Cones tangents et singularites, C. R. Acad. Sc. Paris Serie, 296, 721-724.
228. penot, J.-P. and Voile, M. (1987). Dualiie de Fenchel et quasi-convexite, C. R. Acad. Sc. Paris Serie J, 304(13), 269-272.
229. Penot, J.-P. and Voile, M. (1990). Inversion of real-valued functions and applications, ZOR Methods of Oper. Res., 34, 117-141.
230. Penot, J.-P. and Voile, M. (1990). On quasi-convex duality, Math. Operat.' Research, 15(4), 597-625.
231. Penot, J.-P. and Voile, M. (1988). Another duality scheme for quasiconvex problems, In: Trends in Mathematical Optimization, Hoffmann, K. H. et at. (Eds.), Int. Series Number. Math. 84, Birkhauser. Basel, pp. 259-275.
232. Penot, J.-P. and Voile, M., On strongly convex and paraconvex dualities, In: "Generalized convexity and fractional programming with economic applications, proceedings Symp. Pisa, Cambini, A. et at. (Eds.), Lecture Notes in Economics and Math. Systems 345, Springer-Verlag, Berlin, 1990, pp. 198-218.
233. Penot, J.-P. and Voile, M. (1997). Surrogate duality in quasiconvex programming, preprint Univ. of Pau and Avignon.
234. Penot, J.-P. and Voile, M., Hamilton-Jacobi equations under mild continuity and convexity assumptions, submitted.
235. Penot, J.-P. and Zalinescu, C. (1999). Harmonic sum and duality, preprint, Univ. Pau.
236. Penot, J.-P. and Zalinescu, C. (1998). Elements of quasiconvex subdifferential calculus, preprint, Univ. Pau, to appear in J. Convex Anal.
237. Penot, J.-P. and Zalinescu, C., Regularization of quasiconvex functions, in preparation.
238. Phelps, R. (1989). Convex Functions, Monotone Operators and Differentiability, Lecture Notes in Mathematics # 1364, Springer Verlag, Berlin, Germany.
239. Phu, H. X., Six kinds of roughly convex functions, J. Opt. Th. Appl., 92(2), 357-376.
240. Phu, H. X. (1995). Some properties of globally δ-convex functions, Optimization, 35, 23-41.
241. Phu, H. X. (1993). 7-subdifferential and 7-convexity of functions on the real line, Applied Math. Optim., 27, 145-160.
242. Phu, H. X. (1995). 7-subdifferential and 7-convexity of functions on a normed vector space, J. Optim. Th. Appl., 85, 649-676.
243. Phu, H. X. and An, P. T. (1996). Stable generalization of convex functions. Optimization, 38(4), 309-318.
244. Pickert, G. (1952). Bemerkungen iiber Galois-verbindungen, Arch. Math., 3, 285-289.
245. Pini, R. and Singh, C. (1997). A survey of recent advances in generalized convexity with applications to duality theory and optimality conditions (1985-1995), Optim., 39(4), 311-360.
246. Piastria, F. (1985). Lower subdifferentiable functions and their minimization by cutting plane, J. Opt. Th. Appl., 46(1), 37-54.
247. Poliquin, R. A. (1990), Subgradient monotonicity and convex functions, Nonlinear Analysis, Theory, Meth. and Appl., 14, 305-317.
248. Ponstein, J. (1967). Seven kinds of convexity, SIAM Review, 9, 115-119.
249. Pshenichnyi, B. N., Necessary conditions for an extremum, Dekker, New York, 1971.
250. Rabier, P. (1985). Definition and properties of a particular notion of convexity, Numer. Funct. Ana!. Appl., 7(4), 279-302.
251. Rockafeiiar, R. T. (1970). Convex analysis, Princeton Univ. Press, Princeton.
252. Rockafeiiar, R. T. (1976). Conjugate duality and optimization, CBMS-NSF Regional Conference Series in Applied Math. 16, SIAM, Philadelphia.
253. Rockafeiiar, R. T. (1976). Augmented Lagrangians and the proxima! point algorithm in convex programming. Math. Oper. Res., I, 97-116.
254. Rockafeiiar, R. T. (1974). Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM J. Control and Opt., 12, 268-285.
255. Rockafeiiar, R. T. (1982). Favorable classes of Lipschitz continuous functions in subgradient optimization, In: Progress in nondifferentiable optimization, Nurminski, E. (Ed.) IIASA, Laxenburg, pp. 125-144.
256. Rockafeiiar, R. T. and Wets, R. J.-B. (1984). Variational systems, an introduction, In:Muitifunctions and Integrands, Proc. Conf. Catania, 1983, Salinetti, G. (Ed.), Lecture Notes in Maths # 1091, Springer-Verlag, Berlin, pp. 112-129.
257. Rockafeiiar, R. T. and Wets, R. J.-B., Variational Analysis, Springer-Verlag, Berlin, 1997.
258. Rolewicz, S. (1979). On paraconvex multifunctions, Opsr. Research Verf. (.Methods of Oper. Res.), 31, 293-300.
259. Rolewicz, S, (1979). On-»-paraconvex multifunctions. Math. Japonica, 24(3), 415-430.
260. Rubinov, A. (1995), Antihomogeneous coniugacy operators in convex analysis, J. Convex Anal., 2, 291-307.
261. Rubinov, A. M. and Andramonov, M. Yu. (1999). Minimizing increasing starshaped functions based on abstract convexity, preprint, Univ. of Ballarat.
262. Rubinov, A. M. and Glover, B. M. (1997). On generalized quasiconvex conjugation, Contemporary Math., 204, 199-216.
263. Rubinov, A. M. and Glover, B. M. (1998). Quasiconvexity via two steps functions, In: "Generalized convexity, generalized monotonicity: recent results", Crouzeix, J.-P., Martinez-Legaz, J. E. and Voile, M. (Eds.), Kluwer, Dordrecht, pp. 159-183.
264. Rubinov, A. M. and Simsek, B. (1995). Conjugate quasiconvex nonnegative functions, Optim., 35, 1-22.
265. Rubinov, A. M. and Simsek, B. (1995). Dual problems of quasiconvex maximization, Bull. Aust. Math. Soc., 51, 139-144.
266. Ruys, P. H. M. and Weddepohl, H. N. (1979). Economic theory and duality, Lecture notes in Econ. and Math. Systems # 168, Springer Verlag, pp. 49-72.
267. Sach, P. H. and Penot, J.-P. (1998). Characterizations of generalized convexities via generalized directional derivatives, Numer. Funct. Anal., 19(5-6).
268. dos Santos Gromicho, J. A. (1998). Quasiconvex optimization and location theory, Kluwer, Dordrecht.
269. Schaible, S. (1976). Fractional programming, I, Duality, Management Sci., 22: 858-867.
270. Schaible, S. (1977). Second-order characterizations of pseudoeonvex quadratic functions, J. Opt. Th. Appl., 21(1), 15-26.
271. Schaible, S. (1992). Generalized monotone maps. In: Giannessi, F. (Ed.), Nonsmooth optimization: Methods and Applications, Proc. Symp. Erice, June 1991, Gordon and Breach, Amsterdam, pp. 392-408.
272. Schaible, S. (1994). Generalized monotonicity-a survey, In: "Generalized convexity" Proc. Pecs, Hungary 1992, Lecture Notes in Economics and Math. Systems # 405, Komlosi, S., Rapscâk, T. and Schaible, S. (Eds.), Springer-Verlag, Berlin, pp. 229-249.
273. Schaible, S., Generalized monotonicity-concepts and uses. In: "Variational inequalities and network equilibrium problems, Proc. 19th course, Int. School of Math. Erice, June 1994, Giannessi, F. and Maugeri, A. (Eds.), Plenum, New York, 1995, pp. 289-299.
274. Schaibie, S. and Ziemba, W. T. (Eds.) Generalized Concavity in Optimization and Economics, Academic Press, New-York, 1981.
275. Seeger, A. and Voile, M. (1995). On a convolution operation obtained by adding level sets: classical and new results, Oper. Res., 29(2), 131-154.
276. Simons, S. (1995). Minimax theorems and their proofs, In: "Minimax and applications, Ding-Zhu Du and Panos M. Pardalos (Eds.), Kluwer Academic Publishers, Dordrecht, Boston, pp. 1-23.
277. Simons, S. (1998). Minimax and monotonicity, Lecture Notes in Maths # 1693 Springer, Berlin.
278. Simsek, B. and Rubinov, A. M, (1995). Duai problems of quasiconvex maximization, Bull. Aust, Math. Soc., 51, 139-144.
279. Singer, I. (1986). Some relations between dualities, polarities, coupling functions and conjugations, J. Math. Anal. Appl., 15, 1-22.
280. Singer, I. (1997). Abstract convex analysis, Wiley, New York.
281. Sion, M. (1958). On general minimax theorems, Pacific J. Math., 8, 171-176.
282. Spingam, J. E. (1981). Submonotone subdifferentials of Lipschitz functions, Trans. Amer, Math. Soc., 264(1), 77-89.
283. Suneja, S. K. and Gupta, S. (1993). Duality in nonlinear programming involving semiiocaily convex and related functions, Optim., 28, 17-29.
284. Sutti, C. (1993). Quasidifferentiability of nonsmooth quasiconvex functions. Optimization, 27(4), 313-320.
285. Sutti, C. (1993). Quasidifferential analysis of positively homogeneous functions, Optimization, 27(1/2), 43-50.
286. Tanaka, Y. (1990). Note on generalized convex functions, J. Optim. Th. Appl., 66(2), 345-349.
287. Tao, P. D. and El Bemoussi, S., Duality in D.C. (difference of convex functions). Optimization. Subgradient methods. Trends in Mathematical Optimization, Hoffmann, K. H. et al. (Eds.), Int. Series Numer. Math., # 84, Birkhauser, Basel, 1988, pp. 277-293.
288. Tao, P. D. and El Bemoussi, S., Numerical methods for solving a class of global nonconvex optimization problems, New methods in optimization and their industrial uses, Penot, J.-P. (Ed.), Int. Series Numer. Math., # 97 Birkhauser, Basel, 1989, pp. 97-132.
289. Tao, P. D. and Le Thi Hoai An (1997). Convex analysis approach to D.C. programming: theory, algorithms and applications, Acta Math. Vietnamica, 22(1), 289-355.
290. Thach, P. T. (1991). Quasiconjugate of functions, duality relationships between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint and application, J. Math. Anal. Appl., 159, 299-322.
291. Thach, P. T. (1993). Globa! optimality criterion and a duality with a zero gap in nonconvex optimization, SIAM J. Math. Anal., 24(6), 1537-1556.
292. Thach, P. T. (1994). A nonconvex duality with zero gap and applications, SIAM J. Optim., 4(1), 44-64.
293. Thibault, L. and Zagrodny, D. (1995). Integration of subdifferentials of lower semi-continuous functions on Banach spaces, J. Math. Anal, and Appl., 189, 33-58.
294. Thompson, W. A. Jr. and Parke, D. W. (1974). Some properties of generalized concave functions, Oper. Research, 21(1), 305-313.
295. Traore, S. and Voile, M. (1995). Quasi-convex conjugation and Mosco convergence, Richerche di Mat., 44(2), 369-388.
296. Traore, S. and Voile, M. (1995). Subdifferentiability, lower semicontinuity and exactness of the level sum of two convex functions on locally convex spaces, In: Recent Developments in Optimization, Durier, R. and Michelot, C. (Eds.), Lecture Notes in Economics and Mathematical Systems 429, Springer Verlag, Berlin, pp. 269-290.
297. Traore, S. and Voile, M. (1996). Ön the level sum of two convex functions on Banach spaces, J. of Convex Anal., 3(1), 141-151.
298. Traore, S. and Voile, M. (1996). Epiconvergence d'une suite de sommes en niveaux de fonctions convexes, Serdi{dotless}ca Math. J., 22, 293-306.
299. Traore, S. and Voile, M. (1996). Dualite pour la minimization du maximum de deux fonctions convexes: applications â la somme en niveaux des fonctions convexes, preprint, Univ. of Avignon.
300. Tuy, H. (1987). Convex programs with an additional reverse convex constraint, J. Optim. Theory Appl, 52, 463-486.
301. Tuy, H. (1995). D.C. optimization: theory, methods and algorithms, In: Handbook of Global Optimization, Horst, R. and Pardalos, P. M. (Eds.), Kluwer, Dordrecht, Netherlands, pp. 149-216.
302. Tuy, H. (1992). On nonconvex optimisation problems with separated nonconvex variables, J. Global Optim., 2, 133-144.
303. Tuy, H. (1998). Convex Analysis and Global Optimization, Kluwer, Dordrecht.
304. Vial, J.-P. (1983). Strong and weak convexity of sets and functions, Math. Oper. Res., 8(2), 231-259.
305. Voile, M. (1984). Convergence en niveaux et cn ûpigraphes, C. R. Acad. Sci. Paris. 299(8), 295-298.
306. Voile, M. (1985). Conjugaison par tranches, Annali Mat. Pura Appl., 139,279-312.
307. Voile, M. (1986). Contributions â la dualite en optimisation et a repiconvergence, Thesis, Univ. Pau.
308. Voile, M. (1987). Conjugaison par tranches et dualite de Toland, Optimization, 18, 633-642.
309. Voile, M. (1997). Quasiconvex duality for the max of two functions, In: Recent advances in optimization, Gritzmann, P., Horst, R., Sachs, E. and Tichatschke, R. (Eds.), Lecture Notes in Economics and Math. Systems, 452, 365-379.
310. Voile, M. (1997). Conditions initiales quasiconvexes dans les equations de Hamilton-Jacobi, C.R. Acad. Sci. Paris Serie I, 325, 167-170.
311. Voile, M. (1998). Duality for the level sum of quasiconvex functions and applications, ESAIM: Control, Optimisation and Calculus of Variations, http://www.emath.fr/cocv/, 3, 329-343.
312. Wets, R. J.-B. (1983). A formula for the level sets of epi-limits and some applications, In: " Theories of Optimization. Proceedings 1981" Cecconi, J. P. and Zolezzi, T. (Eds.), Lecture Notes in Maths # 979, pp. 256-268.
313. Yang, X. M. (1994). Semistrictly convex functions, Opsearch, 31, 15-27.
314. Yang, X. Q. (1993). Generalized convex functions and vector variational inequalities, J. Opt. Th. and Appl., 79, 563-580.
315. Yang, X. Q. (1994). Generalized second-order characterizations of convex functions, J. Opt. Th. and Appl., 82, 173-180.
316. Yang, X. Q., Continuous generalized convex functions and their characterizations, Preprint. University of Western Australia, Australia, 1997.
317. Zagrodny, D. (1992). General sufficient conditions for the convexity of a function, Zeitschrift fur Anal. Anwendungen, 11, 277-283.
318. Zǎlinescu, C. (1998). Mathematical programming in infinite dimensional normed linear spaces (Rumanian) Editura Academiei, Bucharest, French translation to appear.