Skip to main content
SpringerLink
Log in
Book cover

Nondifferential and Variational Techniques in Optimization pp 77–90Cite as

A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization

  • Chapter
  • First Online:

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

Abstract

An algorithm is given for finding stationary points for constrained minimization problems having locally Lipschitz problem functions that are not necessarily convex or differentiable but are semismooth.

This material is based upon work supported by the National Science Foundation under Grant No. MCS 78-06716.

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

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. C. Lemarechal, “Nonsmooth optimization and descent methods”, RR-78-4, International Institute for Applied Systems Analysis, Laxenburg, Austria (1978).

    MATH  Google Scholar 

  3. C. Lemarechal and R. Mifflin, eds., Nonsmooth optimization (Pergamon Press, Oxford, 1978).

    Google Scholar 

  4. C. Lemarechal and R. Mifflin, “Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions”, TR-81-3, Department of Pure and Applied Mathematics, Washington State University, Pullman, WA (1981).

    Google Scholar 

  5. R. Mifflin, “An algorithm for constrained optimization with semismooth functions,” Mathematics of Operations Research 2 (1977) 191–207.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Mifflin, “Semismooth and semiconvex functions in constrained optimization,” SIAM Journal of Control and Optimization 15 (1977) 959–972

    Article  MATH  MathSciNet  Google Scholar 

  7. R. Mifflin, “A stable method for solving certain constrained least squares problems,” Mathematical Programming 16 (1979) 141–158.

    Article  MATH  MathSciNet  Google Scholar 

  8. M.J.D. Powell, “Some global convergence properties of a variable metric algorithm for minimization without exact line searches”, In: R. Cottle and C.E. Lemke, eds., Nonlinear programming (American Mathematical Society, Providence, RI, 1976) pp. 53–72.

    Google Scholar 

  9. R.S. Womersley, “Optimality conditions for piecewise smooth functions,” Mathematical Programming Study 17 (1982) 13–27 [This Volume.].

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure and Applied Mathematics, Washington State University, 99164, Pullman, WA, USA

    Robert Mifflin

Authors
  1. Robert Mifflin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. C. Sorensen R. J.- B. Wets

Rights and permissions

Reprints and permissions

Copyright information

© 1982 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Mifflin, R. (1982). A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization. In: Sorensen, D.C., Wets, R.J.B. (eds) Nondifferential and Variational Techniques in Optimization. Mathematical Programming Studies, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120960

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00814-6

  • Online ISBN: 978-3-642-00815-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation