Skip to main content
SpringerLink
Log in

Refinements of necessary optimality conditions in nondifferentiable programming II

  • Chapter
  • First Online:
Book cover Optimality and Stability in Mathematical Programming

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 19))

Abstract

Along the lines of our earlier work under the same title, we review and sharpen necessary conditions for optimality for an optimization problem with nondifferentiable data. The relative generalized Jacobian matrix of a locally Lipschitz function and the normal subcone to a set defined by equalities are the principal concepts upon which our study is based.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.H. Clarke, “Generalized gradients and applications”, Transactions of the American Mathematical Society 205 (1975) 247–262.

    Article  MATH  MathSciNet  Google Scholar 

  2. F.H. Clarke, “A new approach to Lagrange multipliers”, Mathematics of Operations Research 2 (1976) 165–174.

    Article  Google Scholar 

  3. F.H. Clarke, “On the inverse function theorem”, Pacific Journal of Mathematics 64 (1976) 97–102.

    MATH  MathSciNet  Google Scholar 

  4. F.H. Clarke, “Generalized gradients of Lipschitz functionals”, Mathematics Research Center. Technical Summary Report, University of Wisconsin, Madison, WI (1976).

    Google Scholar 

  5. J.-B. Hiriart-Urruty, “Conditions nécessaires d’optimalité en programmation non différentiable”, Note aux Comptes Rendus de l’Académie des Sciences de Paris Série A 283 (1976) 843–845.

    MATH  MathSciNet  Google Scholar 

  6. J.-B. Hiriart-Urruty, “On necessary optimality conditions in nondifferentiable programming”, Mathematical Programming 14 (1978) 73–86.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.-B. Hiriart-Urruty, “Gradient généralisés de fonctions composées. Applications”, Note aux Comptes Rendus de l’Académie des Sciences de Paris Série A 285 (1977) 781–784.

    MATH  MathSciNet  Google Scholar 

  8. J.-B. Hiriart-Urruty, “Tangent cones, generalized gradients and methematical programming in Banach spaces”, Mathematics of Operations Research 4 (1979) 79–97.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.-B., Hiriart-Urruty, “New concepts in nondifferentiable programming”, in: J.-P. Penot, ed., Journées d’analyse non convexe, Bulletin de la Société Mathématique de France Mémoire 60 (1979) 57–85.

    Google Scholar 

  10. J.-B. Hiriart-Urruty, “Refinements of necessary optimality conditions in nondifferentiable programming I”, Applied Mathematics and Optimization 5 (1979) 63–82.

    Article  MATH  MathSciNet  Google Scholar 

  11. J.-B. Hiriart-Urruty, “On the extension of two theorems in general topology. Applications”, Technical Note, University of Kentucky, Lexington, KY (1978).

    Google Scholar 

  12. J.-B. Hiriart-Urruty, “Théorèmes de valeur moyenne en analyse non différentiable: cas des fonctions localement Lipschitz à valeurs vectorielles”, Note aux Comptes Rendus de l’Académie des Sciences de Paris Série A 287 (1978) 751–753.

    MATH  MathSciNet  Google Scholar 

  13. J.-B. Hiriart-Urruty, “Extension of Lipschitz functions”, Journal of Mathematical Analysis and Applications 77 (1980) 539–554.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Mifflin, “Semismooth and semiconvex function in constrained optimization”, SIAM Journal on Control and Optimization 6 (1977) 959–972.

    Article  MathSciNet  Google Scholar 

  15. R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1970).

    MATH  Google Scholar 

  16. R.T. Rockafellar, “Generalized directional derivatives and subgradients of nonconvex functions”, Canadian Journal of Mathematics 32 (1980) 257–280.

    MATH  MathSciNet  Google Scholar 

  17. R.T. Rockafellar, “Clarke’s tangent come and the boundaries of closed sets in R n”, Nonlinear Analysis 3 (1979) 145–154.

    Article  MATH  MathSciNet  Google Scholar 

  18. R.T. Rockafellar, “Directionally Lipschitzian functions and subdifferential calculus”, Proceedings of the London Mathematical Society 39 (1979) 331–335.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Clermont-Ferrand II, 63170, Aubière, France

    J.-B. Hiriart-Urruty

Authors
  1. J.-B. Hiriart-Urruty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Monique Guignard

Rights and permissions

Reprints and permissions

Copyright information

© 1982 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Hiriart-Urruty, JB. (1982). Refinements of necessary optimality conditions in nondifferentiable programming II. In: Guignard, M. (eds) Optimality and Stability in Mathematical Programming. Mathematical Programming Studies, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120985

Download citation

  • DOI: https://doi.org/10.1007/BFb0120985

  • Received:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00849-8

  • Online ISBN: 978-3-642-00850-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation