TOWARDS A STRONGLY POLYNOMIAL ALGORITHM FOR STRICTLY CONVEX QUADRATIC PROGRAMS - AN EXTENSION OF TARDO ALGORITHM

被引：8

作者：

GRANOT, F

SKORINKAPOV, J

机构：

[1] Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, V6T 1Y8, B.C.

来源：

MATHEMATICAL PROGRAMMING | 1990年 / 46卷 / 02期

关键词：

Quadratic programming; strong polynomiality;

D O I：

10.1007/BF01585740

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In a recent paper Tardos described a polynomial algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In this paper we extend Tardos' results and present a polynomial algorithm for solving strictly convex quadratic programming problems in which the number of arithmetic steps is independent of the size of the numbers in the right hand side and the linear cost coefficients. © 1990 North-Holland.

引用

页码：225 / 236

页数：12