论文信息 - An improved subgradient method for constrained nondifferentiable optimization

An improved subgradient method for constrained nondifferentiable optimization

Polyak's subgradient method for constrained nondifferentiable optimization problems is modified in one respect to improve the computational efficiency. The two consecutive projection operations in Polyak method are combined into a single projection operation. The resulting algorithm has a convergence property which is strictly stronger than that of the original Polyak method. A computational test shows significant improvement both in the number of iterations and in the CPU time.

Sehun Kim | Bong-sik Um | Sehun Kim | Bong-sik Um

[1] Bong-Sik Um,et al. Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints , 1989 .

[2] P. Camerini,et al. On improving relaxation methods by modified gradient techniques , 1975 .

[3] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[4] Jeremy F Shapiro. Mathematical Programming Methods for Logistics Planning. , 1981 .

[5] Sehun Kim,et al. Convergence of a generalized subgradient method for nondifferentiable convex optimization , 1991, Math. Program..

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

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

[8] Hyunsil Ahn,et al. Two-direction subgradient method for non-differentiable optimization problems , 1987 .

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