Skip to main content


Log in

A barrier method in convex vector optimization with generalized inequality constraints

  • Original paper
  • Published:
Optimization Letters Aims and scope Submit manuscript


In this note we present a barrier method for vector optimization problems with inequality constraints. To this aim, we firstly investigate some constraint qualification conditions and we compare them to the corresponding ones in literature. Then, we define a barrier function and observe that its basic properties do work for fairly general situations, while for meaningful convergence results of the associated barrier method we should restrict ourselves to convex case and finite dimensional setting.

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


  1. Bonnans, F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)

    Book  Google Scholar 

  2. Durea, M.: Estimations of the Lagrange multipliers’ norms in set-valued optimization. Pac. J. Optim. 2, 487–501 (2006)

    MathSciNet  MATH  Google Scholar 

  3. Durea, M., Strugariu, R.: Optimality conditions and a barrier method in optimization with convex geometric constraint. Optim. Lett. 12, 923–931 (2018)

    Article  MathSciNet  Google Scholar 

  4. Dutta, J.: Barrier method in nonsmooth convex optimization without convex representation. Optim. Lett. 9, 1177–1185 (2015)

    Article  MathSciNet  Google Scholar 

  5. Dutta, J., Lalitha, C.S.: Optimality conditions in convex optimization revisited. Optim. Lett. 7, 221–229 (2013)

    Article  MathSciNet  Google Scholar 

  6. Göpfert, A., Riahi, H., Tammer, C., Zălinescu, C.: Variational Methods in Partially Ordered Spaces. Springer, Berlin (2003)

    MATH  Google Scholar 

  7. Lasserre, J.B.: On representation of the feasible set in convex optimization. Optim. Lett. 4, 1–5 (2010)

    Article  MathSciNet  Google Scholar 

  8. Lasserre, J.B.: On convex optimization without convex representation. Optim. Lett. 5, 549–556 (2011)

    Article  MathSciNet  Google Scholar 

  9. Lasserre, J.B.: Erratum to: On convex optimization without convex representation. Optim. Lett. 8, 1795–1796 (2014)

    Article  MathSciNet  Google Scholar 

  10. Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, Vol. I: Basic Theory, II: Applications. A Series of Comprehensive Studies in Mathematics, vol. 330 and 331. Sringer, Berlin (2006)

    Book  Google Scholar 

  11. Mordukhovich, B.S., Shao, Y.: Nonsmooth sequential analysis in Asplund spaces. Trans. Am. Math. Soc. 348, 1235–1280 (1996)

    Article  MathSciNet  Google Scholar 

  12. Zălinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)

    Book  Google Scholar 

Download references


This work was supported by a grant of Romanian Ministry of Research and Innovation, CNCS-UEFISCDI, project number PN-III-P4-ID-PCE-2016-0188, within PNCDI III.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Marius Durea.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Durea, M., Strugariu, R. A barrier method in convex vector optimization with generalized inequality constraints. Optim Lett 14, 759–769 (2020).

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: