[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

First and second order conditions for a class of nondifferentiable optimization problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper gives first and in particular second order necessary and sufficient conditions for a class of nondifferentiable optimization problems in which there are both objective and constraint functions defined in terms of a norm. The conditions are expressed in terms of a Lagrangian function and its derivatives, and use the ideas of feasible directional sequence and subgradients. Certain regularity assumptions are required and for the second order necessary conditions it is shown that the assumption is realistic for polyhedral norms. Illustrative examples are discussed.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. T.M. Apostol,Mathematical analysis (Addison Wesley, New York, 1957).

    Google Scholar 

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

    Google Scholar 

  3. A.V. Fiacco and G.P. McCormick,Nonlinear programming (Wiley, New York, 1968).

    Google Scholar 

  4. R. Fletcher and G.A. Watson, “First and second order conditions for a class of nondifferentiable optimization problems”, Dundee University Numerical Analysis Report NA/28 (1978).

  5. F. Freudenstein and B. Roth, “Numerical solutions of systems of nonlinear equations”,Journal of the Association for Computing Machinery 10 (1963) 550–556.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. H.H. Schaefer,Topological vector spaces (Macmillan, New York, 1966).

    Google Scholar 

  9. G.A. Watson, “A class of programming problems whose objective function contains a norm”,Journal of Approximation Theory 23 (1978) 401–411.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Dundee, Dundee, Scotland

    R. Fletcher & G. A. Watson

Authors
  1. R. Fletcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. A. Watson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fletcher, R., Watson, G.A. First and second order conditions for a class of nondifferentiable optimization problems. Mathematical Programming 18, 291–307 (1980). https://doi.org/10.1007/BF01588325

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation