一种需要O(n^3.5)次算术运算的凸二次规划内点算法

An interior point algorithm for convex quadratic programming that requires O(n3.5) arithmetic operations

Mathematics of Operations Research · 1990
被引 1
ABS 3
凸优化二次规划内点法算法复杂度