Journal
MATHEMATICAL PROGRAMMING
Volume 103, Issue 1, Pages 127-152Publisher
SPRINGER
DOI: 10.1007/s10107-004-0552-5
Keywords
non-smooth optimization; convex optimization; optimal methods; complexity theory; structural optimization
Ask authors/readers for more resources
In this paper we propose anew 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 O (1/is an element of(2)) to O (1/is an element of), keeping basically the complexity of each iteration unchanged.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available