Advertisement

Mathematical Programming

, Volume 103, Issue 1, pp 127–152 | Cite as

Smooth minimization of non-smooth functions

  • Yu. NesterovEmail author
Article

Abstract.

In this paper we propose a new approach for constructing efficient schemes for non-smooth convex optimization. It is based on a special smoothing technique, which can be applied to functions with explicit max-structure. Our approach can be considered as an alternative to black-box minimization. From the viewpoint of efficiency estimates, we manage to improve the traditional bounds on the number of iterations of the gradient schemes from Open image in new window keeping basically the complexity of each iteration unchanged.

Keywords

Non-smooth optimization Convex optimization Optimal methods Complexity theory Structural optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ben-Tal, A., Nemirovskii, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. (SIAM, Philadelphia, 2001)Google Scholar
  2. 2.
    Bertsekas, D.P.: Constrained optimization and Lagrange multiplier methods. (Academic Press, New York, 1982)Google Scholar
  3. 3.
    Goffin, J.-L.: On the convergence rate of subgradient optimization methods. Mathematical Programming 13, 329–347 (1977)Google Scholar
  4. 4.
    Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms. (Springer-Verlag, 1993)Google Scholar
  5. 5.
    Polyak, B.: On Bertsekas’ method for minimization of composite function. In: Bensoussan, A., Lions, J.L. (eds) Inter. Symp. Systems Opt. 1979, Analysis Springer, pp. 179–186Google Scholar
  6. 6.
    Polyak, R.: Nonlinear rescaling vs. smoothing technique in convex optimization. Mathematical Programming Ser. A 92, 197–235 (2002)CrossRefGoogle Scholar
  7. 7.
    Polyak, B.: Introduction to Optimization. (Optimization Software, Inc., Publications Division, New York, 1987)Google Scholar
  8. 8.
    Nemirovsky, A., Yudin, D.: Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. (J. Wiley & Sons, New York, 1983)Google Scholar
  9. 9.
    Nesterov, Yu.: A method for unconstrained convex minimization problem with the rate of convergence Open image in new window Doklady AN SSSR (translated as Soviet Math. Docl.) 269, 543–547 (1983)Google Scholar
  10. 10.
    Nesterov, Yu.: Introductory Lectures on Convex Optimization: Basic course. (Kluwer, Boston, 2003)Google Scholar
  11. 11.
    Shor, N.: Minimization Methods for Non-Differentiable Functions. (Springer-Verlag, Berlin, 1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  1. 1.Center for Operations Research and Econometrics (CORE)Catholic University of Louvain (UCL)Louvain-la-NeuveBelgium

Personalised recommendations