Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

A New Abadie-Type Constraint Qualification for General Optimization Problems

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

A Correction to this article was published on 21 October 2023

This article has been updated

Abstract

A non-Lipschitz version of the Abadie constraint qualification is introduced for a nonsmooth and nonconvex general optimization problem. The relationship between the new Abadie-type constraint qualification and the local error bound property is clarified. Also, a necessary optimality condition, based on the pseudo-Jacobians, is derived under the Abadie constraint qualification. Moreover, some examples are given to illustrate the obtained results.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Change history

References

  1. Hejazi, M.A., Movahedian, N., Nobakhtian, S.: On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-jacobians. J. Optim. Theory Appl. 179, 778–799 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kanzi, N.: Non-Lipschitz semi-infinte optimization problems involving local cone approximation. Iran. J. Oper. Res. 5, 1–11 (2014)

    Google Scholar 

  3. Outrata, J.V., Kocvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Theory Applications and Numerical Results. Kluwer Academic, Boston (1998)

    MATH  Google Scholar 

  4. Robinson, S.M.: Generalized equations and their solution, part II: applications to nonlinear programming. Math. Program. Stud. 19, 200–221 (1982)

    Article  MATH  Google Scholar 

  5. Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  6. Jeyakumar, V., Luc, D.T.: Approximate Jacobian matrices for nonsmooth continuous maps and \(C1\)-optimization. SIAM J. Control Optim. 36, 1815–1832 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jeyakumar, V., Luc, D.T.: Nonsmooth calculus, minimality, and monotonicity of convexificators. J. Optim. Theory Appl. 101, 599–621 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jeyakumar, V., Luc, D.T.: Nonsmooth Vector Functions and Continuous Optimization. Springer, New York (2007)

    MATH  Google Scholar 

  9. Jeyakumar, V., Yen, N.D.: Solution stability of nonsmooth continuous systems with applications to cone-constrained optimization. SIAM J. Optim. 14, 1106–1127 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhang, J., Zhang, L., Wang, W.: On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems. Nonlinear Anal. 75, 2566–2680 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Flegel, M., Kanzow, C., Outrata, J.: Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints. Set Valued Anal. 15, 139–162 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dutta, J., Chandra, S.: Convexifcators, generalized convexity and vector optimization. Optimization 53, 77–94 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Clarke, F.H., Ledyaev, Y.S., Stern, R.J., Wolenski, P.R.: Nonsmooth Analysis and Control Theory. Springer, New York (1998)

    MATH  Google Scholar 

  14. Michel, P., Penot, J.P., Brezis, H.: A generalized derivative for calm and stable functions. Differ. Integr. Equ. 5, 433–454 (1992)

    MathSciNet  MATH  Google Scholar 

  15. Mordukhovich, B.S., Shao, Y.H.: On nonconvex subdifferential calculus in Banach space. J. Convex Anal. 2, 211–227 (1995)

    MathSciNet  MATH  Google Scholar 

  16. Treiman, J.S.: The linear nonconvex generalized gradient and Lagrange multipliers. SIAM J. Optim. 5, 670–680 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  17. Movahedian, N., Nobakhtian, S.: Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints. Set Valued Var. Anal. 17, 63–95 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Henrion, R., Outrata, J.: Calmness of constraint systems with applications. Math. Program. Ser. B 104, 437–464 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Hejazi, M.A., Nobakhtian, S.: On Abadie constraint qualification for multiobjective optimization problems. Rend. Circ. Mat. Palermo II. Ser 67, 453–464 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  20. Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley-Interscience, New Jersy (2006)

    Book  MATH  Google Scholar 

Download references

Acknowledgements

The first-named author was partially supported by a Grant from Iran National Science Foundation (INSF, No. 97007967)

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. Movahedian.

Additional information

Communicated by René Henrion.

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hejazi, M.A., Movahedian, N. A New Abadie-Type Constraint Qualification for General Optimization Problems. J Optim Theory Appl 186, 86–101 (2020). https://doi.org/10.1007/s10957-020-01691-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-020-01691-0

Keywords

Mathematics Subject Classification

Navigation