Mathematical Programming

, Volume 103, Issue 1, pp 127–152

Smooth minimization of non-smooth functions

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.

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