2-DIRECTION SUBGRADIENT METHOD FOR NON-DIFFERENTIABLE OPTIMIZATION PROBLEMS

被引：10

作者：

KIM, S

KOH, S

AHN, H

机构：

来源：

OPERATIONS RESEARCH LETTERS | 1987年 / 6卷 / 01期

关键词：

D O I：

10.1016/0167-6377(87)90008-3

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：43 / 46

页数：4

相关论文

共 8 条

[1] ON THE CHOICE OF STEP SIZE IN SUBGRADIENT OPTIMIZATION
BAZARAA, MS
SHERALI, HD
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 7 (04) : 380 - 388
[2] CONVERGENCE RATES OF SUBGRADIENT OPTIMIZATION METHODS
GOFFIN, JL
[J]. MATHEMATICAL PROGRAMMING, 1977, 13 (03) : 329 - 347
[3] Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[4] THE CUTTING-PLANE METHOD FOR SOLVING CONVEX PROGRAMS
KELLEY, JE
[J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04): : 703 - 712
[5] AN AGGREGATE SUBGRADIENT METHOD FOR NONSMOOTH CONVEX MINIMIZATION
KIWIEL, KC
[J]. MATHEMATICAL PROGRAMMING, 1983, 27 (03) : 320 - 341
[6] LEMARECHAL C, 1978, RR7804 INT I APPL SY
[7] Shor NZ., 1985, MINIMIZATION METHODS
[8] FINDING NEAREST POINT IN A POLYTOPE
WOLFE, P
[J]. MATHEMATICAL PROGRAMMING, 1976, 11 (02) : 128 - 149