🌙

一种O(√m |ln ε|)次迭代的内点算法用于C1凸规划

An interior point algorithm of $$O(\sqrt m \left| {\ln \varepsilon } \right|)$$ iterations forC 1-convex programming

Mathematical Programming · 1992
被引 16
ABS 4
数学优化凸规划内点法算法