Linear Programming in O([n3/ln n]L) Operations

Authors:
K. M. Anstreicher
Affiliations:
-
Venue:
SIAM Journal on Optimization
Year:
1999

Citing 0
Cited 7

Job Shop Scheduling Problems with Controllable Processing Times

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A unified framework for model-based clustering

The Journal of Machine Learning Research
An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners

Optimization Methods & Software
Optimal monitoring in multi-channel multi-radio wireless mesh networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
A stable primal---dual approach for linear programming under nondegeneracy assumptions

Computational Optimization and Applications
Complexity of evolution in maximum cooperative P systems

Natural Computing: an international journal
An optimization framework for monitoring multi-channel multi-radio wireless mesh networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the complexity to solve linear programming problems, using standard linear algebra, can be reduced to O([n3/ln n]L) operations, where n is the number of variables in a standard-form problem with integer data of bit size L. Our technique combines partial updating with a preconditioned conjugate gradient method, in a scheme first suggested by Nesterov and Nemirovskii.