AN ALGORITHM FOR CONVEX QUADRATIC-PROGRAMMING THAT REQUIRES O(N3.5L) ARITHMETIC OPERATIONS

被引:29
作者
MEHROTRA, S
SUN, J
机构
关键词
D O I
10.1287/moor.15.2.342
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:342 / 363
页数:22
相关论文
共 26 条
[1]  
BAYER DA, 1986, NONLINEAR GEOMETRY L
[2]  
Fiacco AV, 1990, NONLINEAR PROGRAMMIN
[3]  
FRISCH KR, 1955, 1955 U I EC MEM MAY
[4]  
Gill P. E., 1981, PRACTICAL OPTIMIZATI
[5]   ON PROJECTED NEWTON BARRIER METHODS FOR LINEAR-PROGRAMMING AND AN EQUIVALENCE TO KARMARKAR PROJECTIVE METHOD [J].
GILL, PE ;
MURRAY, W ;
SAUNDERS, MA ;
TOMLIN, JA ;
WRIGHT, MH .
MATHEMATICAL PROGRAMMING, 1986, 36 (02) :183-209
[6]   A NUMERICALLY STABLE DUAL METHOD FOR SOLVING STRICTLY CONVEX QUADRATIC PROGRAMS [J].
GOLDFARB, D ;
IDNANI, A .
MATHEMATICAL PROGRAMMING, 1983, 27 (01) :1-33
[7]  
GOLDFARB D., 1988, O N3L PRIMAL INTERIO
[8]  
GONZAGA CC, 1987, ALGORITHM SOLVING LI
[9]  
HUARD P, 1967, RESOLUTION MATH PROG, P207
[10]  
IUDIN DB, 1977, MATEKON, V13, P25