AN AGGREGATE SUBGRADIENT METHOD FOR NONSMOOTH CONVEX MINIMIZATION

被引：135

作者：

KIWIEL, KC

机构：

来源：

关键词：

D O I：

10.1007/BF02591907

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：320 / 341

页数：22

共 16 条

[1] QUASI-NEWTON METHODS, MOTIVATION AND THEORY [J].

DENNIS, JE ;

MORE, JJ .

[2] THE CUTTING-PLANE METHOD FOR SOLVING CONVEX PROGRAMS [J].

KELLEY, JE .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04) :703-712

[3]

Kiwiel K. C., 1982, THESIS TU WARSAW WAR

[4]

KIWIEL KC, 1981, CP8123 INT I APPL SY

[5]

LASDON L, 1970, OPTIMIZATION THEORY

[6]

LEMARECHAL C, 1978, RR784 INT I APPL SYS

[7]

Lemarechal C., 1975, NONDIFFERENTIABLE OP, V3, P95, DOI DOI 10.1007/BFB0120700

[8] BOXSTEP METHOD FOR LARGE-SCALE OPTIMIZATION [J].

MARSTEN, RE ;

HOGAN, WW ;

BLANKENSHIP, JW .

[9]

MIFFLIN R, 1982, MATH PROGRAM STUD, V17, P77

[10]

Mifflin R., 1977, Mathematics of Operations Research, V2, P191, DOI 10.1287/moor.2.2.191