论文信息 - Minimizing Functions with Bounded Variation of Subgradients

Minimizing Functions with Bounded Variation of Subgradients

In many applications it is possible to justify a reasonable bound for possible variation of subgradients of objective function rather than for their uniform magnitude. In this paper we develop a new class of efficient primal-dual subgradient schemes for such problem classes.

Yurii Nesterov | Y. Nesterov

[1] Yurii Nesterov,et al. Dual extrapolation and its applications to solving variational inequalities and related problems , 2003, Math. Program..

[2] Yurii Nesterov,et al. Smooth minimization of non-smooth functions , 2005, Math. Program..

[3] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .

[4] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[5] Y. Nesterov. Dual Extrapolation and its Applications for Solving Variational Inequalities and Related Problems' , 2003 .

[6] Yurii Nesterov,et al. New variants of bundle methods , 1995, Math. Program..

[7] Arkadi Nemirovski,et al. The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography , 2001, SIAM J. Optim..