Skip to main content
Log in

Stationarity in Nonsmooth Optimization with Switching Constraints

  • Research Paper
  • Published:
Iranian Journal of Science and Technology, Transactions A: Science Aims and scope Submit manuscript

Abstract

This paper is devoted to the study of nonsmooth mathematical programming problems with switching constraints in which all emerging functions are assumed to be locally Lipschitz. We introduce some Abadie type constraint qualifications which are based on the Mordukhovich subdifferential. Then, we investigate the interrelations between these constraint qualifications and derive several necessary stationary conditions at optimal solutions to the considered problems.

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.

Fig. 1

Similar content being viewed by others

References

  • Bazaraa MS, Shetty CM (1979) Nonlinear programming, theory and algorithms. Wiley, New York

    MATH  Google Scholar 

  • Clarke FH (1983) Optimization and nonsmooth analysis. Wiley Interscience, Hoboken

    MATH  Google Scholar 

  • Kanzow C, Mehlitz P, and Steck D (2019) Relaxation schemes for mathematical programmes with switching constraints. Optim Methods Softw 1-36

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Li G, Guo L (2019) Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications. Technical report, Optimization Online

  • Liang YC, Ye JJ (2021) Optimality conditions and exact penalty for mathematical programs with switching constraints. Theory Optim Theory Appl 190:1–31

    Article  MathSciNet  Google Scholar 

  • Mordukhovich BS (2006) Variational analysis and generalized differentiation I: basic theory. Springer, Berlin

    Book  Google Scholar 

  • Mishra SK, Upadhyay BB, Thi Hoai L, An, (2014) Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems. J Optim Theory Appl 160:763–777

    Article  MathSciNet  Google Scholar 

  • Mehlitz P (2020) Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. Math Program 180:149–186

    Article  Google Scholar 

  • Rockafellar RT, Wets B (1998) Variational analysis. Springer, Berlin

    Book  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the referees for their constructive comments, specially for having suggested the definition of \(\mathcal {L}^{MPSC}(\hat{x})\) and MPSC-ACQ.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nader Kanzi.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Funding

No funding was secured for this manuscript.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shabankareh, F.G., Kanzi, N., Fallahi, K. et al. Stationarity in Nonsmooth Optimization with Switching Constraints. Iran J Sci Technol Trans Sci 46, 907–915 (2022). https://doi.org/10.1007/s40995-022-01289-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40995-022-01289-3

Keywords

Navigation