A new algorithm for minimizing convex functions over convex sets
- 1 June 1996
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 73 (3) , 291-341
- https://doi.org/10.1007/bf02592216
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- Speeding-up linear programming using fast matrix multiplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987