Skip to main content
Log in

An Algorithm for Vector Optimization Problems

  • Published:
Bulletin of the Malaysian Mathematical Sciences Society Aims and scope Submit manuscript

Abstract

In this paper, we consider of finding efficient solution and weakly efficient solution for nonconvex vector optimization problems. When X and Y are normed spaces, F is an anti-Lipschitz mapping from X to Y, and the ordering cone is regular, we present an algorithm to guarantee that the generated sequence converges to an efficient solution with respect to normed topology. If the domain of the mapping is compact, we prove that the generated sequence converges to an efficient solution with respect to normed topology without requiring that mapping is anti-Lipschitz. We also give an algorithm to guarantee that the generated sequence converges to a weakly efficient solution with respect to normed topology.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51, 479–494 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Drummond, L.M.G., Iusem, A.N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28, 5–30 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15, 953–970 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ceng, L.C., Yao, J.C.: Approximate proximal methods in vector optimization. Euro. J. Oper. Res. 183(1), 1–19 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen, Z., Zhao, K.: A proximal-type method for convex vector optimization problem in Banach spaces. Numer. Funct. Anal. Optim. 30, 1–12 (2009)

    Article  MathSciNet  Google Scholar 

  7. Chen, Z., Xiang, C.H., Zhao, K.Q., Liu, X.W.: Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems. Appl. Math. Comput. 211, 167–172 (2009)

    MathSciNet  MATH  Google Scholar 

  8. Jayswal, A., Choudhury, S.: An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity. J. Oper. Res. Soc. Chin. 2, 75–91 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jahn, J.: Mathematical Vector Optimization in Partially-Ordered Linear Spaces. Peter Lang, Frankfurt an Main (1986)

    MATH  Google Scholar 

  10. Deimling, K.: Nonlinear Functional Analysis. Springer-Verlag, Berlin (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xun-Hua Gong.

Additional information

Communicated by Anton Abdulbasah Kamil.

This research was partially supported by the National Natural Science Foundation of China (11061023, 11201216, 11471291).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gong, XH., Liu, F. An Algorithm for Vector Optimization Problems. Bull. Malays. Math. Sci. Soc. 40, 919–929 (2017). https://doi.org/10.1007/s40840-017-0455-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40840-017-0455-2

Keywords

Mathematics Subject Classification

Navigation