Narrow search
Showing 1 - 9 of 9
Cover Image
Towards a practical volumetric cutting plane method for convex programming
Anstreicher, Kurt M. - 1997
Persistent link: https://www.econbiz.de/10000971095
Cover Image
Ellipsoidal approximations of convex sets based on the volumetric barrier
Anstreicher, Kurt M. - 1997
Persistent link: https://www.econbiz.de/10000971102
Cover Image
Linear programming in O(n3-ln n L) operations
Anstreicher, Kurt M. - 1997
Persistent link: https://www.econbiz.de/10000971104
Cover Image
On the performance of Karmarkar's algorithm over a sequence of iterations
Anstreicher, Kurt M. - 1989
Persistent link: https://www.econbiz.de/10000780979
Cover Image
A combined phase I-phase II scaled potential algorithm for linear programming
Anstreicher, Kurt M. - 1989
Persistent link: https://www.econbiz.de/10000780982
Cover Image
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
Anstreicher, Kurt M. - 1990
Persistent link: https://www.econbiz.de/10000800797
Cover Image
Efficient solution of maximum-entropy sampling problems
Anstreicher, Kurt M. - In: Operations research 68 (2020) 6, pp. 1826-1835
Persistent link: https://www.econbiz.de/10012392163
Cover Image
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Anstreicher, Kurt M. (contributor) - 1997
Persistent link: https://www.econbiz.de/10000962981
Cover Image
A family of search directions for Karmarkar's algorithm
Anstreicher, Kurt M.; Watteyne, Patrick - 1990
Persistent link: https://www.econbiz.de/10000793301