A CLASS OF CONVERGENT PRIMAL DUAL SUBGRADIENT ALGORITHMS FOR DECOMPOSABLE CONVEX-PROGRAMS

被引：25

作者：

SEN, S ^{[1
]}

SHERALI, HD ^{[1
]}

机构：

[1] VIRGINIA POLYTECH INST & STATE UNIV,DEPT IND ENGN & OPERAT RES,BLACKSBURG,VA 24061

来源：

关键词：

D O I：

10.1007/BF01580881

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：279 / 297

页数：19

共 27 条

[1] THE RELAXATION METHOD FOR LINEAR INEQUALITIES [J].

AGMON, S .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1954, 6 (03) :382-392

[2] ON THE CHOICE OF STEP SIZE IN SUBGRADIENT OPTIMIZATION [J].

BAZARAA, MS ;

SHERALI, HD .

[3]

Bazaraa MS, 1979, NONLINEAR PROGRAMMIN

BERTSEKAS, DP .

SIAM JOURNAL ON CONTROL, 1975, 13 (03) :521-544

[5]

BITRAN G, 1976, 9TH P INT S MATH PRO, P357

[6]

BUYS JD, 1972, THESIS U LEIDEN NETH

[7]

Cohen G, 1984, ADV LARGE SCALE SYST, VI, P203

FISHER, ML .

[9] A DESCENT ALGORITHM FOR NONSMOOTH CONVEX-OPTIMIZATION [J].

FUKUSHIMA, M .

[10]

Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810