An accelerated interior point method whose running time depends only on A (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results
Computational Optimization and Applications
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
Operations Research Letters
| Hi-index | 0.00 |