Skip to main content
SpringerLink
Log in

Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several stationary conditions of type Karush/Kuhn–Tucker.

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

Fig. 1

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. Hoheisel, T., Kanzow, C.: First- and second-order optimality conditions for mathematical programs with vanishing constraints. Appl. Math. 52, 495–514 (2007)

    Article  MathSciNet  Google Scholar 

  3. 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 

  4. Kanzi, N., Nobakhtian, S.: Nonsmooth multiobjective semi-infinite problems with mixed constraints. Pac. J. Optim. 13, 43–53 (2017)

    MathSciNet  MATH  Google Scholar 

  5. Pandey, Y., Mishra, S.K.: Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators. J. Optim. Theory Appl. 171, 694–707 (2016)

    Article  MathSciNet  Google Scholar 

  6. Bigi, G., Pappalardo, M., Passacantando, M.: Optimization tools for solving equilibrium problems with nonsmooth data. J. Optim. Theory Appl. 171, 887–905 (2016)

    Article  MathSciNet  Google Scholar 

  7. Chieu, N.H., Lee, G.M.: Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property. J. Optim. Theory Appl. 163, 755–776 (2014)

    Article  MathSciNet  Google Scholar 

  8. 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 

  9. Luu, D.V.: Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications. J. Optim. Theory Appl. 171, 643–665 (2016)

    Article  MathSciNet  Google Scholar 

  10. 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 

  11. 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 

  12. Hoheisel, T., Kanzow, C., Outrata, J.: Exact penalty results for mathematical programs with vanishing constraints. Nonlinear Anal. 72, 2514–2526 (2010)

    Article  MathSciNet  Google Scholar 

  13. Achtziger, W., Hoheisel, T., Kanzow, C.: A smoothing-regularization approach to mathematical programs with vanishing constraints. Comput. Optim. Appl. 55, 733–767 (2013)

    Article  MathSciNet  Google Scholar 

  14. Izmailov, A.F., Solodov, M.V.: Mathematical programs with vanishing constraints: optimality conditions, sensitivity, and a relaxation method. J. Optim. Theory Appl. 142, 501–532 (2009)

    Article  MathSciNet  Google Scholar 

  15. Izmailov, A.F., Pogosyan, A.L.: Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints. Comput. Math. Math. Phys. 49, 1128–1140 (2009)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  17. Mordukhovich, B.: Optimization and equilibrium problems with equilibrium constraints in infinite-dimensional spaces. Optimization 57, 715–741 (2008)

    Article  MathSciNet  Google Scholar 

  18. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, Hoboken (1983)

    MATH  Google Scholar 

  19. Giorgi, G., Gwirraggio, A., Thierselder, J.: Mathematics of Optimization; Smooth and Nonsmooth cases. Elsevier, Amsterdam (2004)

    Google Scholar 

  20. Hiriart- Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms, I & II. Springer, Berlin (1991)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  22. Burke, J.V., Lewis, A.S., Overton, M.L.: Approximating subdifferentials by random sampling of gradients. Math. Oper. Res. 27, 567–584 (2002)

    Article  MathSciNet  Google Scholar 

  23. Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim. 15, 751–779 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the referees for their constructive comments. Also, we express our thanks to Professor M. Soleimani-damaneh for suggesting the conclusions of the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Payam Noor University, P. O. Box 19395-3697, Tehran, Iran

    Sajjad Kazemi & Nader Kanzi

Authors
  1. Sajjad Kazemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nader Kanzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nader Kanzi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kazemi, S., Kanzi, N. Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints. J Optim Theory Appl 179, 800–819 (2018). https://doi.org/10.1007/s10957-018-1373-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-018-1373-7

Keywords

Mathematics Subject Classification

Search

Navigation