A CLASS OF RANK-2 ELLIPSOID ALGORITHMS FOR CONVEX-PROGRAMMING

被引：5

|

作者：

ECHCHERIF, A

ECKER, JG

机构：

来源：

MATHEMATICAL PROGRAMMING | 1984年 / 29卷 / 02期

关键词：

D O I：

10.1007/BF02592220

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：187 / 202

页数：16

相关论文

共 50 条

[41] CONVEX-PROGRAMMING ON RIEMANNIAN-MANIFOLDS
RAPCSAK, T
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 84 : 733 - 740
[42] COMMENTS ON A REVERSE CONVEX-PROGRAMMING ALGORITHM
BENSAAD, S
JACOBSEN, SE
JOURNAL OF GLOBAL OPTIMIZATION, 1994, 5 (01) : 95 - 96
[43] ON THE POSSIBILITIES OF USE OF A CERTAIN CLASS OF CONVEX-PROGRAMMING METHODS IN DIAGONAL PLANNING PROCESSES
ERLIKH, II
ENGINEERING CYBERNETICS, 1981, 19 (04): : 31 - 36
[44] ELEMENTS OF CONVEX-PROGRAMMING IN THE AXIOMATIC THEORY OF CONVEXITY
SOLTAN, VP
DOKLADY AKADEMII NAUK SSSR, 1982, 266 (04): : 800 - 802
[45] DECOMPOSITION METHODS FOR LINEAR AND CONVEX-PROGRAMMING PROBLEMS
GOLSHTEIN, EG
MATEKON, 1986, 22 (04): : 75 - 101
[46] FACIAL REDUCTION IN PARTIALLY FINITE CONVEX-PROGRAMMING
LEWIS, AS
MATHEMATICAL PROGRAMMING, 1994, 65 (02) : 123 - 138
[47] PENALTY-PROXIMAL METHODS IN CONVEX-PROGRAMMING
AUSLENDER, A
CROUZEIX, JP
FEDIT, P
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1987, 55 (01) : 1 - 21
[48] OPTIMALITY IN CONVEX-PROGRAMMING - A FEASIBLE DIRECTIONS APPROACH
BENISRAEL, A
BENTAL, A
ZLOBEC, S
MATHEMATICAL PROGRAMMING STUDY, 1982, 19 (AUG): : 16 - 38
[49] ONE APPROACH TO SOLVING PROBLEMS OF CONVEX-PROGRAMMING
KAPLAN, AA
DOKLADY AKADEMII NAUK SSSR, 1981, 258 (04): : 785 - 788
[50] INTERIOR-POINT METHODS FOR CONVEX-PROGRAMMING
JARRE, F
APPLIED MATHEMATICS AND OPTIMIZATION, 1992, 26 (03): : 287 - 311

← 1 2 3 4 5 →