INTERIOR PATH FOLLOWING PRIMAL-DUAL ALGORITHMS .2. CONVEX QUADRATIC-PROGRAMMING

被引:226
作者
MONTEIRO, RDC
ADLER, I
机构
关键词
D O I
10.1007/BF01587076
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:43 / 66
页数:24
相关论文
共 10 条
[1]  
GONZAGA CC, 1987, UCBERLM8710 U CAL EL
[2]  
KAPPOR S, 1986, 18TH P ANN ACM S THE, P147
[3]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395
[4]   A POLYNOMIAL-TIME ALGORITHM FOR A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS [J].
KOJIMA, M ;
MIZUNO, S ;
YOSHISE, A .
MATHEMATICAL PROGRAMMING, 1989, 44 (01) :1-26
[5]  
Kozlov M. K., 1979, DOSI AKAD NAUK PKSR, V5, P1051
[6]  
Lemke C.E., 1968, J APPL MATH DECIS SC, V1, P95
[7]  
MEGIDDO N, 1986, PATHWAYS OPTIMAL SET
[8]  
Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI
[9]  
VAIDYA PM, 1987, ALGORITHM LINEAR PRO
[10]  
Ye Y., 1986, POLYNOMIAL ALGORITHM