Farkas-type results for inequality systems with composed convex functions via conjugate duality

Journal of Mathematical Analysis and Applications

Volumn 322, Issue 1, 2006, Pages 316-328

  Boţ, Radu Ioan ^a   Hodrea, Ioan Bogdan ^a   Wanka, Gert ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Composed convex functions; Conjugate duality; Conjugate functions; Farkas type results

Indexed keywords

EID: 33646714129     PISSN: 0022247X     EISSN: 10960813     Source Type: Journal    
DOI: 10.1016/j.jmaa.2005.09.007     Document Type: Article

References (19)

1. R.I. Boţ, S.-M. Grad, G. Wanka, A new constraint qualification and conjugate duality for composed convex optimization problems, preprint 2004-15, Chemnitz University of Technology, 2004
2. Boţ R.I., Kassay G., and Wanka G. Strong duality for generalized convex optimization problems. J. Optim. Theory Appl. 127 (2005)
3. Boţ R.I., and Wanka G. Duality for composed convex functions with applications in location theory. In: Habenicht W., Scheubrein B., and Scheubrein R. (Eds). Multi-Criteria- und Fuzzy-Systeme in Theorie und Praxis (2003), Deutscher Universitäts-Verlag, Wiesbaden 1-18
4. Boţ R.I., and Wanka G. Farkas-type results with conjugate functions. SIAM J. Optim. 15 (2005) 540-554
5. R.I. Boţ, G. Wanka, Farkas-type results for max-functions and applications, preprint 2004-16, Chemnitz University of Technology, 2004
6. Combari C., Laghdir M., and Thibault L. Sous-différentiels de fonctions convexes composées. Ann. Sci. Math. Québec 18 (1994) 119-148
7. Elster K.-H., Reinhardt R., Schäuble M., and Donath G. Einfürung in die Nichtlineare Optimierung, Math.-Naturw. Bibliothek (1977), Teubner, Leipzig
8. Hiriart-Urruty J.-B., and Lemaréchal C. Convex Analysis and Minimization Algorithms II, Advanced Theory and Bundle Methods (1993), Springer-Verlag, Berlin
9. Hiriart-Urruty J.-B., and Martínez-Legaz J.-E. New formulas for the Legendre-Fenchel transform. J. Math. Anal. Appl. 288 (2003) 544-555
10. Jeyakumar V. Characterizing set containments involving infinite convex constraints and reverse-convex constraints. SIAM J. Optim. 13 (2003) 947-959
11. Jeyakumar V. Composite nonsmooth programming with Gâteaux differentiability. SIAM J. Optim. 1 (1991) 30-41
12. 1, 1 functions. J. Optim. Theory Appl. 86 (1993) 631-648
13. Kutateladže S.S. Changes of variables in the Young transformation. Soviet Math. Dokl. 18 (1977) 1039-1041
14. Lemaire B. Application of a subdifferential of a convex composite functional to optimal control in variational inequalities. Lecture Notes in Econom. and Math. Systems vol. 255 (1985), Springer-Verlag, Berlin 103-117
15. Levin V.L. Sur le sous-différentiel de fonctions composeé. Dokl. Akad. Nauk 194 (1970) 28-29
16. Rockafellar R.T. Convex Analysis (1970), Princeton Univ. Press, Princeton
17. Wanka G., and Boţ R.I. On the relations between different dual problems in convex mathematical programming. In: Chamoni P., Leisten R., Martin A., Minnermann J., and Stadtler H. (Eds). Operations Research Proceedings 2001 (2002), Springer-Verlag, Berlin 255-262
18. G. Wanka, R.I. Boţ, E. Vargyas, On the relations between different dual problems assigned to a composed optimization problem, 2004, submitted for publication
19. Yang X.Q., and Jeyakumar V. First and second-order optimality conditions for convex composite multiobjective optimization. J. Optim. Theory Appl. 95 (1997) 209-224