Journal of Global Optimization

, Volume 55, Issue 3, pp 507–520 | Cite as

Asymptotic analysis in convex composite multiobjective optimization problems

  • Zhe Chen


In this paper, we present a unified approach for studying convex composite multiobjective optimization problems via asymptotic analysis. We characterize the nonemptiness and compactness of the weak Pareto optimal solution sets for a convex composite multiobjective optimization problem. Then, we employ the obtained results to propose a class of proximal-type methods for solving the convex composite multiobjective optimization problem, and carry out their convergence analysis under some mild conditions.


Convex composite multiobjective optimization Asymptotic analysis Proximal-type method Nonemptiness and compactness Weak Pareto optimal solution 

Mathematics Subject Classification

90C25 90C48 90C29 



The author thanks two anonymous referees for carefully reading the original submission and supplying many helpful suggestions, which greatly improved the paper. The author thanks Prof. X. Q. Yang, The Hong Kong Polytechnic University, for his teaching. The author also thanks Prof. J. Chen, Tsinghua University, for his some useful suggestions in the revised versions. This work is supported by the National Science Foundation of China (11001289) and the Key Project of Chinese Ministry of Education (211151), the National Science Foundation of Chongqing Science and Technology Commission (CSTC, 2011BB0118) and Research Grant of Education Committee of Chongqing (KJ110633).


  1. 1.
    Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, Berlin (2003)Google Scholar
  2. 2.
    Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15(4), 953–970 (2005)CrossRefGoogle Scholar
  3. 3.
    Bot, R., Vargyas, E., Wanka, G.: Conjugate duality for multiobjective composed optimization problems. Acta Mathematica Hungarica 116, 177–196 (2009)CrossRefGoogle Scholar
  4. 4.
    Burke, J.V., Ferris, M.C.: A Gauss–Newton method for convex composite optimization. Math. Program. 71, 179–194 (1995)Google Scholar
  5. 5.
    Chen, G.Y., Huang, X.X., Yang, X.Q.: Vector Optimization: Set-Valued and Variational Analysis, Lecture Notes in Economics and Mathematical Systems, 541. Springer, Berlin (2005)Google Scholar
  6. 6.
    Chen, Z., Huang, X.X., Yang, X.Q.: Generalized proximal point algorithms for multiobjective optimization problems. Appl. Anal. 90, 935–949 (2011)CrossRefGoogle Scholar
  7. 7.
    Chen, Z.: Generalized viscosity approximation methods in multiobjective optimization problems. Comput. Optim. Appl. 49, 179–192 (2011)CrossRefGoogle Scholar
  8. 8.
    Deng, S.: Characterzationa of nonemptiness and compactness of solutions sets in convex optimzation. J. Optim. Theory Appl. 96, 123–131 (1998)Google Scholar
  9. 9.
    Deng, S.: Characterizations of the nonemptiness and boundedness of weakly efficient solution sets of convex vector optimization problems in real reflexive Banach spaces. J. Optim. Theory Appl. 140, 1–7 (2009)CrossRefGoogle Scholar
  10. 10.
    Fletcher, R.: Practical Methods of Optimization. Wiley, New York (1987)Google Scholar
  11. 11.
    Flores-Bazan, F.: Ideal, weakly efficient solutions for vector problems. Math. Program. 93, 453–475 (2002)CrossRefGoogle Scholar
  12. 12.
    Huang, X.X., Yang, X.Q.: Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications. J. Math. Anal. Appl. 264, 270–287 (2001)CrossRefGoogle Scholar
  13. 13.
    Jahn, J.: Scalarization in multi-objective optimization. Math. Program. 29, 203–219 (1984)CrossRefGoogle Scholar
  14. 14.
    Jahn, J.: Vector Optimization: Theory. Applications and Extensions. Springer, Berlin (2004)Google Scholar
  15. 15.
    Jeyakumar, V.: Composite nonsmooth programming with Gateaux differentiability. SIAM J. Optim. 1, 31–40 (1991)CrossRefGoogle Scholar
  16. 16.
    Jeyakumar, V., Yang, X.Q.: Convex composite multi-objective nonsmooth programming. Math. Program. 59, 325–343 (1993)CrossRefGoogle Scholar
  17. 17.
    Jeyakumar, V., Yang, X.Q.: Convex composite minimization with C1,1 functions. J. Optim. Theory Appl. 86, 631–648 (1995)CrossRefGoogle Scholar
  18. 18.
    Jeyakumar, V., Luc, D.T., Tinh, P.N.: Convex composite non-Lipschitz programming. Math. Program. 92, 177–195 (2002)CrossRefGoogle Scholar
  19. 19.
    Luc, T.D.: Theory of Vector Optimization, Lecture Notes in Economics and Mathematical Systems, 319. Springer, Berlin (1989)Google Scholar
  20. 20.
    Phelps, R.R.: Convex Functions, Montone Operators and Differentiability, Lecture notes in Mathematics, 1364. Springer, Berlin (1988)Google Scholar
  21. 21.
    Reddy, L.V., Mukherjee, R.N.: Composite nonsmooth multiobjective programs with V-\(\rho \)-invexity. J. Math. Anal. Appl. 235, 567–577 (1999)CrossRefGoogle Scholar
  22. 22.
    Rockafellar, R.T.: Convex Anal. Princeton University Press, Princeton (1970)Google Scholar
  23. 23.
    Rockafellar, R.T., Wets, J.B.: Variational Analysis. Springer, Berlin (1998)Google Scholar
  24. 24.
    Sawaragi, Y., Nakayama, H., Tanino, T.: The Theory of Multiobjective Optimization. Academic Press, New York (1985)Google Scholar
  25. 25.
    Womersley, R.S.: Local properties of algorithms forminimizing nonsmooth composite functions. Math. Program. 32, 69–89 (1985)CrossRefGoogle Scholar
  26. 26.
    Yang, X.Q., Jeyakumar, V.: First and second-order optimality conditions for convex composite multi-objective optimization. J. Optim. Theory Appl. 95, 209–224 (1997)CrossRefGoogle Scholar
  27. 27.
    Yang, X.Q.: Second-order global optimality conditions for convex composite optimization. Math. Program. 81, 327–347 (1998)Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Research Center for Contemporary ManagementSchool of Economics and ManagementBeijingChina
  2. 2.Business SchoolSichuan UniversityChengduChina

Personalised recommendations