Skip to main content
SpringerLink
Log in

Nondifferentiable Optimization

  • Conference paper
Computational Mathematical Programming

Part of the book series: NATO ASI Series ((NATO ASI F,volume 15))

Abstract

Nondifferentiable optimization NDO (also called nonsmooth optimization NSO) concerns problems in which the functions involved have discontinuous first derivatives. This causes classical methods to fail; hence nonsmooth problems require a new, a nonstandard approach. The paper tries to develop the basic features of the two main direct approaches in NDO, namely the Subgradient concept and the Bundle concept. Rather than collecting as many results in this area as possible, we will try to motivate and to help understanding the main underlying ideas.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Ben-Tal and J. Zowe, “Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems” Mathematical Programming 24 (1982) 70–91.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Charalambous and A. R. Conn, “An efficient method to solve the minimax problem directly”, SIAM Journal on Numerical Analysis 15 (1982) 162–187.

    Article  MathSciNet  Google Scholar 

  3. A. R. Conn, “An efficient second order method to solve the (constrained) minimax problem”, University of Waterloo, Report CORR-7 9-5.

    Google Scholar 

  4. El-Attar, R. Vidyasagar and S. R. Dutta, “An algorithm for ℓ1 norm minimization with application to nonlinear ℓ1-approximation”, SIAM Journal on Numerical Analysis 16 (1979) 70–86.

    Article  MATH  MathSciNet  Google Scholar 

  5. Yu. M. Ermoliev, “Methods of solution of nonlinear extremal problems”, Cybernetics 24, 1–16.

    Google Scholar 

  6. R. Fletcher, Practical methods of optimization II (John Wiley & Sons, New York, 1981).

    Google Scholar 

  7. J. L. Goffin, “Nondifferentiable optimization and the relaxation method” in: C. Lemarèchal and R. Mifflin (eds.) Nonsmooth Optimization (Pergamon Press, New York, 1978).

    Google Scholar 

  8. J. L. Goffin, “On convergence rate of subgradient optimization methods”, Mathematical Programming 13 (1977) 329–347.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. L. Goffin, “Convergence results in a class of variable metric subgradient methods” in: O. L. Mangasarian, R. R. Meyer and S. M. Robinson (eds.) Nonlinear Programming 4 (Academic Press, New York, 1981).

    Google Scholar 

  10. J. L. Goffin, “Convergence rates of the ellipsoid method on general convex functions”, Mathematics of Operations Research 8 (1983) 135–149.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Held, P. Wolfe and H. Crowder, “Validation of subgradient optimization”, Mathematical Programming 6 (1974) 62–88.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. M. Himmelblau, Applied Nonlinear Programming (McGraw-Hill, 1972).

    Google Scholar 

  13. J. B. Hiriart-Urruty, “Lipschitz r-continuity of the approximate subdifferential of a convex function”, Mathematica Scandinavica 47 (1980) 123–134.

    MATH  MathSciNet  Google Scholar 

  14. R. Hornung, “An efficient algorithm for solving the discrete mini-sum problems,” Operations Research Letters 2 (1983) 115–118.

    Article  MATH  MathSciNet  Google Scholar 

  15. C. Lemarèchal, “Nondifferentiable optimization”, in: Dixon, Spedicato and Szegö H (eds.) Nonlinear Optimization, Theory and Algorithms (Birkhäuser, Boston, 1980).

    Google Scholar 

  16. C. Lemarèchal, “A view of line searches” in: W. Oettli and J. Stoer (eds.) Optimization and Optimal Control, Lecture Notes in Control and Information, (Springer, 1981).

    Google Scholar 

  17. C. Lemarèchal, “Numerical experiments in nonsmooth optimization” in: E. A. Nurminskii (eds.) Progress in Nondifferentiable Optimization (IIASA Proceedings, Laxenburg, 1982).

    Google Scholar 

  18. C. Lemarèchal and J. J. Strodiot, “Bundle methods, cutting plane algorithms and o-Newton directions”, Preprint, University of Namur, 1984.

    Google Scholar 

  19. C. Lemaréchal, J. J. Strodiot and A. Bihain, “On a Bundle algorithm for nonsmooth optimization” in: O. L. Mangasarian, R. R. Meyer and S. M. Robinson (eds.), Nonlinear Programming 4 (Academic Press, New York, 1981).

    Google Scholar 

  20. C. Lemarèchal and J. Zowe, “Some remarks on the construction of higher order algorithms in convex optimization”, Journal of Applied Mathematics and Optimization 10 (1983) 51-61.

    Google Scholar 

  21. A. Y. Levin, “On an algorithm for the minimization of convex functions”, Soviet Mathematical Doklady6, 286–290.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  23. E. A. Nurminskii, “On ɛ-differential mappings and their applications in nondifferentiable optimization”, Working paper 78–58, IIASA, 1978.

    Google Scholar 

  24. E. A. Nurminskii (ed.), Progress in nondifferentiable optimization (IIASA Proceedings, Laxenburg, 1982).

    Google Scholar 

  25. T. Pietrzykowski, “An exact penalty method for constrained maxima”, SIAM Journal on Numerical Analysis 6 (1969) 299–304.

    Article  MATH  MathSciNet  Google Scholar 

  26. B. T. Poljak, “A general method of solving extremal problems”, Soviet Mathematical Doklady 8, 593–597.

    Google Scholar 

  27. B. T. Poljak, “Minimization of unsmooth functionals”, USSR Computational Mathematics and Mathematical Physics 9, 14–29.

    Google Scholar 

  28. B. N. Pshenichnyi, Necessary conditions for an extremum (Marcel Dekker, New York, 1971).

    Google Scholar 

  29. R. T. Rockafellar, Convex Analysis (Princeton University Press, 1972).

    Google Scholar 

  30. V. A. Shokov, “Note on minimization methods using space dilation”, Cybernetics 10, 4, 689–692.

    Google Scholar 

  31. N. Z. Shor, “The rate of convergence of the generalized gradient descent method”, Cybernetics 4, 3, 79–80.

    Google Scholar 

  32. N. Z. Shor, “Utilization of the operation of space dilation in the minimization of convex functions”, Cybernetics 6, 2, 102–108.

    Google Scholar 

  33. N. Z. Shor, “Convergence of a gradient method with space dilation in the directions of the difference between two successive gradients”, Cybernetics 11, 4, 564–570.

    Google Scholar 

  34. N. Z. Shor, “Cut-off method with space extension in convex programming problems”, Cybernetics 13, 94–96.

    Google Scholar 

  35. N. Z. Shor, “Generalized gradient methods of nondifferentiable optimization employing space dilation operations” in: A. Bachern, M. Grötschel and B. Körte (eds.) Mathematical programming, the state of the art (Springer, Berlin, 1983).

    Google Scholar 

  36. P. Wolfe, “A method of conjugate subgradients for minimizing nondifferentiable functions”, Mathematical Programming Study 3 (1975) 145–173.

    MathSciNet  Google Scholar 

  37. R. S. Womersley, “Numerical methods for structured problems in nonsmooth optimization”, University of Dundee, 1981.

    Google Scholar 

  38. D. B. Yudin and A. S. Nemorovskii, “Estimation of the informational complexity of mathematical programming problems,” Matekon 13, 2–25, 25.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bayreuth, D-8580, Bayreuth, W.-Germany

    J. Zowe

Authors
  1. J. Zowe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Azenbergstraße 12, 7000, Stuttgart 1, Federal Republic of Germany

    Klaus Schittkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zowe, J. (1985). Nondifferentiable Optimization. In: Schittkowski, K. (eds) Computational Mathematical Programming. NATO ASI Series, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82450-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82450-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82452-4

  • Online ISBN: 978-3-642-82450-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation