论文信息 - Convergence of a simple subgradient level method - 字舞流文

Convergence of a simple subgradient level method

We study the subgradient projection method for convex optimization with Brannlund's level control for estimating the optimal value. We establish global convergence in objective values without additional assumptions employed in the literature.

Jean-Louis Goffin | Krzysztof C. Kiwiel | K. Kiwiel | J. Goffin

[1] Sehun Kim,et al. Variable target value subgradient method , 1991, Math. Program..

[2] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .

[3] Per Olov Lindberg,et al. A descent proximal level bundle method for convex nondifferentiable optimization , 1995, Oper. Res. Lett..

[4] Jean-Louis Goffin,et al. On convergence rates of subgradient optimization methods , 1977, Math. Program..

[5] A. Kulikov,et al. Convex optimization with prescribed accuracy , 1990 .

[6] Jeffery L. Kennington,et al. A generalization of Polyak's convergence result for subgradient optimization , 1987, Math. Program..

[7] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..

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

[9] Boris Polyak. Minimization of unsmooth functionals , 1969 .

[10] H. Sherali,et al. On the choice of step size in subgradient optimization , 1981 .

[11] Krzysztof C. Kiwiel,et al. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..