Skip to main content
SpringerLink
Log in

Surver of the Methods for Nonsmooth Optimization

  • Chapter
From Convexity to Nonconvexity

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 55))

  • 424 Accesses

Abstract

In nonsmooth (nondifferentiable) optimization the considered functions are not required to have continuous derivatives in classical sense. Nonsmooth optimization problems arise in very many field of applications, for example in economics, mechanics (see [38]), chemical engineering and optimal control (see [12]). The source of nonsmoothness can be divided into four classes: physical, technological, methodological and numerical nonsmoothness.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Auslender. Numerical Methods for Nondifferentiable Convex Optimization. Mathematical Programming Study,30:102–126, 1987.

    MathSciNet  MATH  Google Scholar 

  2. A. Bihain. Optimization of Upper Semidifferentiable Functions. Journal of Optimization Theory and Applications,4:545–568, 1984.

    Article  MathSciNet  Google Scholar 

  3. J.F. Bonnans, J.C. Gilbert, C. Lemaréchal and C. Sagastizábal. A Family of Variable Metric Proximal Methods. Mathematical Programming,68:15–47, 1995.

    MathSciNet  MATH  Google Scholar 

  4. U. Brännlund. A Descent Method with Relaxation Type Step. In: J. Henry and J.P. Yvon, Lecture Notes in Control and Information Sciences, pp. 177–186. Springer-Verlag, New York, 1994.

    Google Scholar 

  5. U. Brännlund, K. C. Kiwiel and P.O. Lindberg. Preliminary Computational Experience with a Descent Level Method for Convex Nondifferentiable Optimization. In: J. Doležal and J. Fidler, System Modelling and Optimization,pp. 387–394. Chapman & Hall, London, 1996.

    Google Scholar 

  6. E.W. Cheney and A.A. Golstein. Newton’s Method for Convex Programming and Tchebycheff Approximation. Numerische Mathematik,1:253–268,1959.

    Article  MathSciNet  MATH  Google Scholar 

  7. F.H. Clarke. Optimization and Nonsmooth Analysis. J. Wiley, New York, 1983.

    MATH  Google Scholar 

  8. R. Fletcher. Practical Methods of Optimization. J. Wiley, Chichester, 1987.

    MATH  Google Scholar 

  9. M. Gaudioso and M.F. Monaco. A Bundle Type Approach to the Unconstrained Minimization of Convex Nonsmooth Functions. Mathematical Programming, 23:216–226,1982.

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Gaudioso and M.F. Monaco. Some Techniques for Finding the Search Direction in Nonsmooth Minimization Problems. Dipartimento di Sistemi, Universita’ della Calabria, Report 75,1988.

    Google Scholar 

  11. M. Gaudioso and M.F. Monaco. Variants to the Cutting Plane Approach for Convex Nondifferentiable Optimization. Optimization, 25:65–75,1992.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. Maslinger and P. Neittaanmäki. Finite Element Approximation of Optimal Shape Design: Theory and Applications. J. Wiley, Chichester, 1988.

    Google Scholar 

  13. J.E. Kelley. The Cutting Plane Method for Solving Convex Programs. SIAM J.,8:703–712,1960.

    MathSciNet  Google Scholar 

  14. K.C. Kiwiel. Methods of Descent for Nondifferentiable Optimization. Springer-Verlag, Berlin, 1985.

    Google Scholar 

  15. K.C. Kiwiel. Proximity Control in Bundle Methods for Convex Nondifferentiable Optimization. Mathematical Programming,46:105–122,1990.

    Article  MathSciNet  MATH  Google Scholar 

  16. K.C. Kiwiel. A Tilted Cutting Plane Proximal Bundle Method for Convex Nondifferentiable Optimization. Operations Research Letters, 10:75–81, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  17. K.C. Kiwiel. Proximal Level Bundle Methods for Convex Nondifferentiable Optimization, Saddle-point Problems and Variational Inequlities. Mathematical Programming, 69:89–109,1995.

    MathSciNet  MATH  Google Scholar 

  18. K.C. Kiwiel. Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization. SIAM Journal on Optimization, 6:227–249,1996.

    Article  MathSciNet  MATH  Google Scholar 

  19. C. Lemaréchal. An Extension of Davidon Methods to Non Differentiable Problems. Mathematical Programming Study, 3:95–109,1975.

    Google Scholar 

  20. C. Lemaréchal. Combining Kelley’s and Conjucate Gradient Methods. In: Abstracts of IX International Symposium on Mathematical Programming, Budapest, Hungary, 1976.

    Google Scholar 

  21. C. Lemaréchal. Nonsmooth Optimization and Descent Methods. IIASA-report, Laxemburg, Austria, 1978.

    MATH  Google Scholar 

  22. C. Lemaréchal. Numerical Experiments in Nonsmooth Optimization. In: E.A. Nurminski, Progress in Nondifferentiable Optimization, pp. 61–84. IIASA-report, Laxemburg, Austria, 1982.

    Google Scholar 

  23. C. Lemaréchal. Nondifferentiable Optimization. In: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, Optimization, pp. 529–572. North-Holland, Amsterdam, 1989.

    Chapter  Google Scholar 

  24. C. Lemaréchal, A. Nemirovskii and Yu. Nesterov. New Variants of Bundle Methods. Mathematical Programming, 69:111–147,1995.

    Article  MathSciNet  MATH  Google Scholar 

  25. C. Lemaréchal and C. Sagastizábal. An Approach to Variable Metric Bundle Methods. In: J. Henry and J.P. Yvon, Lecture Notes in Control and Information Sciences, pp. 144–162. Springer-Verlag, New York, 1994.

    Google Scholar 

  26. C. Lemaréchal, J.-J. Strodiot and A. Bihain. On a Rundle Algorithm for Nonsmooth Optimization. In: O.L. Mangasarian, R.R. Mayer and S.M. Robinson, Nonlinear Programming, pp. 245–281. Academic Press, New York, 1981.

    Google Scholar 

  27. K. Levenberg. A Method for the Solution of Certain Nonlinear Problems in Least Squares. Quart. Appt. Math., 2:164–166,1944.

    MathSciNet  MATH  Google Scholar 

  28. L. Lukšan and J. Vlček. A Bundle-Newton Method for Nonsmooth Unconstrained Minimization. Mathematical Programming, 83: 373–391,1998.

    MathSciNet  MATH  Google Scholar 

  29. M.M. Mäkelä. Methods and Algorithms for Nonsmooth Optimization. Reports on Applied Mathematics and Computing, No. 2, University of Jyväskylä, Department of Mathematics, 1989.

    Google Scholar 

  30. M.M. Mäkelä, M. Miettinen, L. Lukšan and J. Vlček. Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities. J. Global Optimization,14: 117–135,1999.

    Article  MATH  Google Scholar 

  31. M.M. Mäkelä and P. Neittaanmäki. Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific Publishing Co., Singapore, 1992.

    MATH  Google Scholar 

  32. D.W. Marquardt. An Algorithm for Least-Squares Estimation of Nonlinear Parameters. SIAM Journal on Applied Mathematics, 11:431–441,1963.

    Article  MathSciNet  MATH  Google Scholar 

  33. K. Miettinen, M.M. Mäkelä and T. Männikkö. Optimal Control of Continuous Casting by Nondifferentiable Multiobjective Optimization. Computational Optimization and Applications, 11: 177–194,1998.

    Article  MathSciNet  MATH  Google Scholar 

  34. R. Mifflin. An Algorithm for Constrained Optimization with Semismooth Functions. Mathematics of Operations Research, 2:191–207,1977.

    Article  MathSciNet  MATH  Google Scholar 

  35. R. Miffiin. A Modification and an Extension of Lemaréchal’s Algorithm for Nonsmooth Minimization. Mathematical Programming Study, 17:77–90,1982.

    Google Scholar 

  36. R. Mifflin. A Quasi-second-order Proximal Bundle Algorithm. Mathematical Programming, 73:51–72,1996.

    MathSciNet  Google Scholar 

  37. J.J. Moreau. Proximité et dualité dans un espace hilbertien. Bulletin de la Société Mathématique de France, 93:273–299,1965.

    MathSciNet  MATH  Google Scholar 

  38. J.J. Moreau, P.D. Panagiotopoulos and G. Strang (Eds.). Topics in Nonsmooth Mechanics. Birkhäuser Verlag, Basel, 1988.

    MATH  Google Scholar 

  39. E. Polak, D.Q. Mayne and Y. Wardi. On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiabl e Problems. SIAM Journal on Optimal Control and Optimization, 21:179–203, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  40. R.A. Poliquin and R.T. Rockafellar. Generalized Hessian Properties of Regularized Nonsmooth Functions. SIAM Journal on Optimization, 6:1121–1137, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  41. R.T. Rockafellar. Monotone Operators and the Proximal Point Algorithm. SIAM Journal on Optimal Control and Optimization,14:877–898, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  42. H. Schramm and J. Zowe. A Version of the Bundle Idea for Minimizing a Nonsmooth Functions: Conceptual Idea, Convergence Analysis, Numerical Results. SIAM Journal on Optimization, 2:121–152, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  43. N.Z. Shor. Minimization Methods for Non-dijferentiable Functions. Springer-Verlag, Berlin, 1985.

    Google Scholar 

  44. J.-J. Strodiot, V.H. Nguyen and N. Heukemes. ε-Optimal Solutions in Nondifferentiable Convex Programming and Some Related Questions. Mathematical Programming, 25:307–328, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  45. V.N. Tarasov and N.K. Popova. A Modification of the Cutting-plane Method with Accelerated Convergence. In: V.F. Demyanov and D. Pallaschke, Nondifferentiable Optimization: Motivations and Applications, pp. 284–290. Springer-Verlag, Berlin, 1984.

    Google Scholar 

  46. K.L. Teo and C.J. Goh. On Constrained Optimization Problems with Nonsmooth Cost Functionals. Applied Mathematics and Optimization, 18:181–190, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  47. P. Wolfe. A Method of Conjugate Subgradients for Minimizing Nondifferentiable Functions. Mathematical Programming Study, 3:145–173, 1975.

    MathSciNet  Google Scholar 

  48. K. Yosida. Functional Analysis. Springer-Verlag, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Information Technology, University of Jyväskylä, P.O. Box 35, FIN-40351, Jyväskylä, Finland

    M. M. Mäkelä

Authors
  1. M. M. Mäkelä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Delaware, USA

    R. P. Gilbert

  2. University of Florida, USA

    P. M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this chapter

Cite this chapter

Mäkelä, M.M. (2001). Surver of the Methods for Nonsmooth Optimization. In: Gilbert, R.P., Panagiotopoulos, P.D., Pardalos, P.M. (eds) From Convexity to Nonconvexity. Nonconvex Optimization and Its Applications, vol 55. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0287-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0287-2_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7979-9

  • Online ISBN: 978-1-4613-0287-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation