Skip to main content
SpringerLink
Log in

Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we first derive several characterizations of the nonemptiness and compactness for the solution set of a convex scalar set-valued optimization problem (with or without cone constraints) in which the decision space is finite-dimensional. The characterizations are expressed in terms of the coercivity of some scalar set-valued maps and the well-posedness of the set-valued optimization problem, respectively. Then we investigate characterizations of the nonemptiness and compactness for the weakly efficient solution set of a convex vector set-valued optimization problem (with or without cone constraints) in which the objective space is a normed space ordered by a nontrivial, closed and convex cone with nonempty interior and the decision space is finite-dimensional. We establish that the nonemptiness and compactness for the weakly efficient solution set of a convex vector set-valued optimization problem (with or without cone constraints) can be exactly characterized as those of a family of linearly scalarized convex set-valued optimization problems and the well-posedness of the original problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aubin J.P., Ekeland I.: Applied Nonlinear Analysis. Wiley, New York (1984)

    Google Scholar 

  2. Auslender A., Cominetti R., Haddou M.: Asymptotical analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22, 43–62 (1997)

    Article  Google Scholar 

  3. Benoist J., Popovici N.: Characterizations of convex and quasiconvex set-valued maps. Math. Methods Oper. Res. 57, 427–435 (2003)

    Google Scholar 

  4. Borwein J.M.: Multivalued convexity and optimization: a unified approach to inequality and equality constraints. Math. Program. 13, 183–199 (1977)

    Article  Google Scholar 

  5. Chen G.Y., Huang X.X., Yang X.Q.: Vector Optimization: Set-Valued and Variational Analysis, Lecture Notes in Economics and Mathematical Systems, vol. 541. Springer, Berlin (2005)

    Google Scholar 

  6. Chinchuluun A., Pardalos P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154, 29–50 (2007)

    Article  Google Scholar 

  7. Chinchuluun, A., Pardalos, P.M., Migdalas, A., Pitsoulis, L. (eds): Pareto Optimality, Game Theory and Equilibria. Springer, Berlin (2008)

    Google Scholar 

  8. Cominetti, R.: Nonlinear averages and convergence of penalty trajectories in convex programming. In: Ill-posed Variational Problems and Regularization Techniques (Trier, 1998), 65–78. Lecture Notes in Econom. and Math. Systems, 477. Springer, Berlin (1999)

  9. Corley H.W.: An existence result for maximizations with respect to cones. J. Optim. Theory Appl. 31, 277–281 (1980)

    Article  Google Scholar 

  10. Corley H.W.: Existence and Lagrange duality for maximizations of set-valued functions. J. Optim. Theory Appl. 54, 489–501 (1987)

    Article  Google Scholar 

  11. Corley H.W.: Optimality conditions for maximizations of set-valued functions. J. Optim. Theory Appl. 58, 1–10 (1988)

    Article  Google Scholar 

  12. Deng S.: Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization. J. Optim. Theory Appl. 96, 123–131 (1998)

    Article  Google Scholar 

  13. Dontchev A.L., Zolezzi T.: Well-Posed Optimization Problems, Lecture Notes in Mathematics, vol. 1543. Springer, Berlin (1993)

    Google Scholar 

  14. Flores-Bazan F.: Ideal, weakly efficient solutions for vector optimization problems. Math. Program. Ser. A. 93, 453–475 (2002)

    Article  Google Scholar 

  15. Flores-Bazan F., Vera C.: Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization. J. Optim. Theory Appl. 130, 185–207 (2006)

    Article  Google Scholar 

  16. Gotz A., Jahn J.: The Lagrange multiplier rule in set-valued optimization. SIAM J. Optim. 10, 331–344 (1999)

    Article  Google Scholar 

  17. Hiriart-Urruty J.B., Lemarechal C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)

    Google Scholar 

  18. Huang X.X., Yang X.Q.: Characterizations of the nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications. J. Math. Anal. Appl. 264, 270–287 (2001)

    Article  Google Scholar 

  19. Huang, X.X., Yang, X.Q.: Further study on the Levitin-Polyak well-posedness of constrained convex optimization problems. Nonliear Anal. Theory Methods Appl. 75, 1341–1347 (2012)

    Google Scholar 

  20. Huang X.X., Yang X.Q.: Generalized Levitin-Polyak well-posedness in constrained optimization. SIAM J. Optim. 17, 243–258 (2006)

    Article  Google Scholar 

  21. Huang X.X., Yang X.Q.: Levitin-Polyak well-posedness of constrained vector optimization problems. J. Glob. Optim. 37, 287–304 (2007)

    Article  Google Scholar 

  22. Huang X.X., Teo K.L., Yang X.Q.: Calmness and exact penalization in vector optimization with cone constraints. Comput. Optim. Appl. 35, 47–67 (2006)

    Article  Google Scholar 

  23. Huang X.X., Yang X.Q., Teo K.L.: Characterizing the nonemptiness and compactness of solution set of a convex vector optimization problem with cone constraints and applications. J. Optim. Theory Appl. 123, 391–407 (2004)

    Article  Google Scholar 

  24. Huang X.X., Yang X.Q., Teo K.L.: Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints. J. Glob. Optim. 36, 637–652 (2006)

    Article  Google Scholar 

  25. Kort B.W., Bertsekas D.P.: Combined primal-dual and penalty methods for convex programming. SIAM J. Control Optim. 14, 268–294 (1976)

    Article  Google Scholar 

  26. Konsulova A.S., Revalski J.P.: Constrained convex optimization problems-well-posedness and stability. Numer. Funct. Anal. Optim. 15, 889–907 (1994)

    Article  Google Scholar 

  27. Levitin E.S., Polyak B.T.: Convergence of minimizing sequences in conditional extremum problems. Sov. Math. Dokl. 7, 764–767 (1966)

    Google Scholar 

  28. Loridan P.: Well-Posed Vector Optimization, Recent Developments in Well-Posed Variational Problems, Mathematics and its Applications, vol. 331. Kluwer, Dordrecht (1995)

    Google Scholar 

  29. Luc D.T.: Contingent derivatives of set-valued maps and applications to vector optimization. Math. Program. 50, 99–111 (1991)

    Article  Google Scholar 

  30. Luc D.T.: Theory of Vector Optimization. Springer, Berlin (1989)

    Book  Google Scholar 

  31. Pardalos, P.M., Siskos, Y., Zopounidis, C. (eds): Advances in Multicriteria Analysis. Kluwer, New York (1995)

    Google Scholar 

  32. Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)

    Google Scholar 

  33. Rockafellar R.T., Wets R.J.B.: Variational Analysis. Springer, Berlin (1998)

    Book  Google Scholar 

  34. Sawaragi Y., Nakayama H., Tanino T.: Theory of Multiobjective Optimization. Academic Press, New York (1985)

    Google Scholar 

  35. Tykhonov A.N.: On the stability of the functional optimization problem. USSR Compt. Math. Math. Phys. 6, 28–33 (1966)

    Article  Google Scholar 

  36. Yang X.Q., Huang X.X.: A nonlinear Lagrangian approach to constrained optimization problems. SIAM J. Optim. 11, 1119–1144 (2001)

    Article  Google Scholar 

  37. Zopounidis, C., Pardalos, P.M. (eds): Handbook of Multicriteria Analysis. Springer, New York, NJ (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Economics and Business Administration, Chongqing University, Chongqing, 400030, China

    X. X. Huang

  2. Center for General Education, Kaohsiung Medical University, Kaohsiung, 807, Taiwan

    J. C. Yao

Authors
  1. X. X. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. C. Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to X. X. Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X.X., Yao, J.C. Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems. J Glob Optim 55, 611–626 (2013). https://doi.org/10.1007/s10898-012-9846-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9846-y

Keywords

Search

Navigation