Skip to main content
Log in

On optimality conditions in nondifferentiable programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper is devoted to necessary optimality conditions in a mathematical programming problem without differentiability or convexity assumptions on the data. The main tool of this study is the concept of generalized gradient of a locally Lipschitz function (and more generally of a lower semi-continuous function). In the first part, we consider local extremization problems in the unconstrained case for objective functions taking values in (−∞, +∞]. In the second part, the constrained case is considered by the way of the cone of adherent displacements. In the presence of inequality constraints, we derive in the third part optimality conditions in the Kuhn—Tucker form under a constraint qualification.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.S. Bazaraa, J.J. Goode and Z. Nashed, “On the cones of tangents with applications to mathematical programming”,Journal of Optimization Theory and Applications 13 (4) (1974) 389–426.

    Google Scholar 

  2. F.H. Clarke, “Necessary conditions for nonsmooth problems in optimal control and the calculus of variations”, Ph.D. Thesis, University of Washington (1973).

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

    Google Scholar 

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

    Google Scholar 

  5. A.V. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York, 1968).

    Google Scholar 

  6. I.V. Girsanov,Lectures on mathematical theory of extremum problems, Lecture Notes in Economics and Mathematical Systems (Springer, Berlin, 1972).

    Google Scholar 

  7. F.J. Gould and J.W. Tolle, “A necessary and sufficient qualification for constrained optimization”,SIAM Journal on Applied Mathematics 20 (2) (1971) 164–172.

    Google Scholar 

  8. M. Guignard, “Generalized Kuhn—Tucker conditions for mathematical programming problems in a Banach space”,SIAM Journal on Control 7 (2) (1969) 232–241.

    Google Scholar 

  9. J.B. Hiriart-Urruty, “Conditions nécessaires d'optimalité en programmation non différentiable”,Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences, Séries A, 283 (1976) 843–845.

    Google Scholar 

  10. J.B. Hiriart-Urruty, “Conditions nécessaires d'optimalité en programmation non différentiable”, Séminaire d'Analyse Numérique, Université de Clermont II (1976).

  11. P.J. Laurent,Approximation et optimisation (Hermann, Paris, 1972).

    Google Scholar 

  12. O.L. Mangasarian and S. Fromowitz, “The Fritz—John necessary optimality conditions in the presence of equality and inequality constraints”,Journal of Mathematical Analysis and Applications 17 (1967) 37–47.

    Google Scholar 

  13. J.P. Penot, “Calcul sous-différentiel et optimisation”, Publications mathématiques de l'Université de Pau (1974).

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

    Google Scholar 

  15. R.T. Rockafellar, “Lagrange multipliers in optimization”, in: R.W. Cottle and C.E. Lemke, eds.,SIAM-AMS proceedings, Vol IX (1976) pp. 145–168.

    Google Scholar 

  16. N.Z. Shor, “A class of almost-differentiable functions and a minimization method for functions of this class”,Cybernetics 8 (4) (1974) 509–606.

    Google Scholar 

  17. P.P. Varaiya, “Nonlinear programming in Banach space”,SIAM Journal on Applied Mathematics 15 (2) (1967) 284–293.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hiriart-Urruty, J.B. On optimality conditions in nondifferentiable programming. Mathematical Programming 14, 73–86 (1978). https://doi.org/10.1007/BF01588951

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation