A generalized subgradient method with relaxation step
暂无分享,去创建一个
[1] Boris Polyak. Minimization of unsmooth functionals , 1969 .
[2] C. Lemaréchal. Nondifferentiable optimization , 1989 .
[3] Sehun Kim,et al. Convergence of a generalized subgradient method for nondifferentiable convex optimization , 1991, Math. Program..
[4] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.
[5] Per Olov Lindberg,et al. A descent proximal level bundle method for convex nondifferentiable optimization , 1995, Oper. Res. Lett..
[6] I. J. Schoenberg,et al. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.
[7] David K. Smith,et al. Mathematical Programming: Theory and Algorithms , 1986 .
[8] Yurii Nesterov,et al. New variants of bundle methods , 1995, Math. Program..
[9] S. Agmon. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.
[10] P. Camerini,et al. On improving relaxation methods by modified gradient techniques , 1975 .
[11] Krzysztof C. Kiwiel,et al. An aggregate subgradient method for nonsmooth convex minimization , 1983, Math. Program..
[12] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .
[13] K. Kiwiel. The Efficiency of Subgradient Projection Methods for Convex Optimization , 1996 .
[14] S. Schaible. Fractional Programming. I, Duality , 1976 .