Skip to main content
Log in

On stationarity for nonsmooth multiobjective problems with vanishing constraints

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

Abstract

The aim of this paper is to develop first-order necessary and sufficient optimality conditions for nonsmooth multiobjective optimization problems with vanishing constraints. First of all, we introduce some data qualifications for the problem, and derive the comparisons between them. Secondly, based on the mentioned qualifications, we demonstrate some necessary optimality conditions, named strongly stationary conditions, at weakly efficient and efficient solutions of considered problem. Then, we show that the strongly stationary conditions are also sufficient for optimality. Finally, using the tightened problems, we establish other classes of qualifications and stationary conditions.

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. Achtziger, W., Kanzow, C.: Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications. Math. Program. 114, 69–99 (2007)

    Article  MathSciNet  Google Scholar 

  2. Ansari Ardali, A., Movahedian, N., Nobakhtian, S.: Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators. Optimization 65, 67–85 (2016)

    Article  MathSciNet  Google Scholar 

  3. Caristi, G., Kanzi, N.: Karush–Kuhn–Tuker type conditions for optimality of non-smooth multiobjective semi-infinite programming. Int. J. Math. Anal. 39, 1929–1938 (2015)

    Article  Google Scholar 

  4. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  5. Giorgi, G., Gwirraggio, A., Thierselder, J.: Mathematics of Optimization. Smooth and Nonsmooth Cases. Elsivier, Amsterdam (2004)

    Google Scholar 

  6. Guu, S.M., Singh, Y., Mishra, S.K.: On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints. J. Ineq. Appl. 282, 9–20 (2017)

    MathSciNet  MATH  Google Scholar 

  7. Halkin, H.: Implicit functions and optimiation problems without continuous differentiability of the data. SIAM J. Control. 12, 229–236 (1974)

    Article  MathSciNet  Google Scholar 

  8. Hoheisel, T., Kanzow, C.: First- and second-order optimality conditions for mathematical programs with vanishing. Appl. Math. 52, 495–514 (2007)

    Article  MathSciNet  Google Scholar 

  9. Hoheisel, T., Kanzow, C.: Stationarity conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J. Math. Anal. Appl. 337, 292–310 (2008)

    Article  MathSciNet  Google Scholar 

  10. Hoheisel, T., Kanzow, C.: On the Abadie and Guignard constraint qualifications for mathematical programs with vanishing constraints. Optimization 58, 431–448 (2009)

    Article  MathSciNet  Google Scholar 

  11. Kanzi, N., Soleymani-damaneh, M.: Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems. J. Math. Anal. Appl. 434, 638–651 (2016)

    Article  MathSciNet  Google Scholar 

  12. Kanzi, N.: Karush–Kuhn–Tucker types optimality conditions for non-smooth semi-infinite vector optimization problems. J. Math. Ext. 9, 45–56 (2015)

    MathSciNet  MATH  Google Scholar 

  13. Kanzi, N., Shaker Ardekani, J., Caristi, G.: Optimality, scalarization and duality in linear vector semi-infinite programming. Optimization 67, 523–536 (2018)

    Article  MathSciNet  Google Scholar 

  14. Kanzi, N.: Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems. Iran J. Sci. Technol. Trans. Sci. 42, 1537–1544 (2018)

    Article  MathSciNet  Google Scholar 

  15. Kazemi, S., Kanzi, N.: Constraint qualifications and stationary conditions for mathematical programming with nondifferentiable vanishing constraints. J. Optim. Theory Appl. 179, 800–819 (2018)

    Article  MathSciNet  Google Scholar 

  16. Kazemi, S., Kanzi, N., Ebadian, A.: Estimating the Fréchet normal cone in optimization problems with nonsmooth vanishing constraints. Iran. J. Sci. Technol. Trans. Sci. 43, 2299–2306 (2019)

    Article  MathSciNet  Google Scholar 

  17. Li, X.F.: Constraint qualifcations in nonsmooth multiobjective optimization. J. Optim. Theory Appl. 106, 73–398 (2000)

    Google Scholar 

  18. Mishra, S.K., Singh, V., Laha, V.: On duality for mathematical programs with vanishing constraints. Ann. Oper. Res. 243, 249–272 (2016)

    Article  MathSciNet  Google Scholar 

  19. Mishra, S.K., Singh, V., Laha, V., Mohapatra, R.N.: On constraint qualifications for multiobjective optimization problems with vanishing constraints. In: Optimization Methods, Theory and Applications, Springer, Heidelberg, pp. 95–135 (2015)

  20. Mishra, S.K., Upadhyay, B.B., Le Thi Hoai, A.: Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems. J. Optim. Theory Appl. 160, 763–777 (2014)

    Article  MathSciNet  Google Scholar 

  21. Mokhtavayi, H., Heydari, A., Kanzi, N.: First-order optimality conditions for lipschitz optimization problems with vanishing constraints. Iran J. Sci. Technol. Trans. Sci. 44, 1853–1861 (2020)

    Article  MathSciNet  Google Scholar 

  22. Movahedian, N.: Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints. J. Global Optim. 67, 829–850 (2017)

    Article  MathSciNet  Google Scholar 

  23. Movahedian, N., Nobakhtian, S.: Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints. Nonlinear Anal. 72, 2694–2705 (2010)

    Article  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  25. Shaker Ardakani, J., Farahmand Rad, S.H., Kanzi, N., Reihani Ardabili, P.: Necessary stationary conditions for multiobjective optimization problems with nondifferentiable convex vanishing constraints. Iran. J. Sci. Technol. Trans. Sci. 43, 2913–2919 (2019)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to express their gratitude to anonymous referee for helpful comments on this paper. This research was in part supported by a Grant from “Iran National Science Foundation: INSF” (No. 98021095).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nader Kanzi.

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

Sadeghieh, A., Kanzi, N., Caristi, G. et al. On stationarity for nonsmooth multiobjective problems with vanishing constraints. J Glob Optim 82, 929–949 (2022). https://doi.org/10.1007/s10898-021-01030-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-021-01030-1

Keywords

Mathematics Subject Classification

Navigation