ALGORITHMS FOR BOUND CONSTRAINED QUADRATIC-PROGRAMMING PROBLEMS

被引:181
作者
MORE, JJ
TORALDO, G
机构
关键词
D O I
10.1007/BF01396045
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:377 / 400
页数:24
相关论文
共 25 条
[1]   GOLDSTEIN-LEVITIN-POLYAK GRADIENT PROJECTION METHOD [J].
BERTSEKAS, DP .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1976, 21 (02) :174-183
[4]   AN O(N) ALGORITHM FOR QUADRATIC KNAPSACK-PROBLEMS [J].
BRUCKER, P .
OPERATIONS RESEARCH LETTERS, 1984, 3 (03) :163-166
[5]  
Brunk HD., 1972, STAT-US
[6]   ON THE IDENTIFICATION OF ACTIVE CONSTRAINTS [J].
BURKE, JV ;
MORE, JJ .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1988, 25 (05) :1197-1211
[7]   QUASI-NEWTON UPDATES WITH BOUNDS [J].
CALAMAI, PH ;
MORE, JJ .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1987, 24 (06) :1434-1441
[8]   PROJECTED GRADIENT METHODS FOR LINEARLY CONSTRAINED PROBLEMS [J].
CALAMAI, PH ;
MORE, JJ .
MATHEMATICAL PROGRAMMING, 1987, 39 (01) :93-116
[9]   ON LINEAR RESTRICTED AND INTERVAL LEAST-SQUARES PROBLEMS [J].
CLARK, DI ;
OSBORNE, MR .
IMA JOURNAL OF NUMERICAL ANALYSIS, 1988, 8 (01) :23-36
[10]  
COTTLE RW, 1978, NONLINEAR PROGRAMMIN, V3, P361