Skip to main content
SpringerLink
Log in

A bundle type approach to the unconstrained minimization of convex nonsmooth functions

  • Published:
Mathematical Programming Submit manuscript

Abstract

A numerical method for the unconstrained minimization of a convex nonsmooth function of several variables is presented. It is closely related to the ‘bundle type’ approach and to the conjugate subgradient method. A way is suggested to reduce the amount of information to be stored during the computational procedure. Global convergence of the method to the minimum is proved.

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

Access this article

Log in via an institution

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. D.P. Bertsekas and S.K. Mitter, “A descent numerical method for optimization problems with nondifferentiable cost functionals”,SIAM Journal on Control 11 (1973) 637–652.

    Google Scholar 

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

    Google Scholar 

  3. R. Fletcher and G.A. Watson, “First and second order conditions for a class of nondifferentiable optimization problems”,Numerical analysis report 28, University of Dundee (1978).

  4. C. Lemarechal, “An extension of Davidon methods to nondifferentiable problems”, in: M.L. Balinski and P. Wolfe, eds.,Nondifferentiable optimization, Mathematical Programming Study 3 (North-Holland, Amsterdam, 1975) pp. 95–109.

    Google Scholar 

  5. C. Lemarechal, “Optimisation non différentiable: Méthodes de faisceaux”, inProceedings of Third International Symposium on Computing Methods in Applied Science and Engineering (IRIA, Paris, 1977).

    Google Scholar 

  6. C. Lemarechal, “Bundle methods in nonsmooth optimization”, in: C. Lemarechal and R. Mifflin, eds.,Nonsmooth optimization, IIASA Proceedings Series 3 (Pergamon Press, Oxford, 1977) pp. 79–102.

    Google Scholar 

  7. C. Lemarechal, “A set of nonsmooth optimizations tests problems”, in: C. Lemarechal and R. Mifflin, eds.,Nonsmooth optimization, IIASA Proceedings Series 3 (Pergamon Press, Oxford, 1977) pp. 151–165.

    Google Scholar 

  8. C. Lemarechal, Private Communication, March 1978.

  9. R. Mifflin, “Semismooth and semiconvex functions in constrained optimization”, RR-76-21, International Institute for Applied Systems Analysis, Laxenburg, Austria; andSIAM Journal on Control and Optimization 15 (6) (1976) 959–972.

    Google Scholar 

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

    Google Scholar 

  11. P. Wolfe, “A method of conjugate subgradients for minimizing nondifferentiable functions”, in: M.L. Balinski and P. Wolfe, eds., Nondifferentiable optimization,Mathematical Programming Study 3 (North-Holland, Amsterdam, 1975) pp. 145–173.

    Google Scholar 

  12. R.S. Womersley, “Uses of minimax models for nondifferentiable optimization”, Tenth International Symposium on Mathematical Programming, Montreal, August 27–31 (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRAI, Roges, Cosenza, Italia

    Manlio Gaudioso & Maria Flavia Monaco

Authors
  1. Manlio Gaudioso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Flavia Monaco
    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

Gaudioso, M., Monaco, M.F. A bundle type approach to the unconstrained minimization of convex nonsmooth functions. Mathematical Programming 23, 216–226 (1982). https://doi.org/10.1007/BF01583790

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation