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 Improvements to the Analytic Center Cutting Plane Method
Computational Optimization and Applications
Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems
Computational Optimization and Applications
Dynamic Resource Allocation for Multimedia Document Retrieval over High Speed LANs
Multimedia Tools and Applications
Warm Start and ε-Subgradients in a Cutting Plane Scheme
Computational Optimization and Applications
A Protocol Architecture for Multimedia Document Retrieval over High Speed LANs
ASSET '98 Proceedings of the 1998 IEEE Workshop on Application - Specific Software Engineering and Technology
Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
Computers and Operations Research
Hierarchical production planning with demand constraints
Computers and Industrial Engineering
On the complexity of a combined homotopy interior method for convex programming
Journal of Computational and Applied Mathematics
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
Semidefinite programming and arithmetic circuit evaluation
Discrete Applied Mathematics
Solving Simple Stochastic Games
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Random walks on polytopes and an affine interior point method for linear programming
Proceedings of the forty-first annual ACM symposium on Theory of computing
Simple stochastic games with few random vertices are easy to solve
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Algorithms and theory of computation handbook
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
Mathematics of Operations Research
Best k-digit rational bounds for irrational numbers: Pre- and super-computer era
Mathematical and Computer Modelling: An International Journal
A new linesearch method for quadratically constrained convex programming
Operations Research Letters
A unified approach to interior point algorithms for linear complementarity problems: A summary
Operations Research Letters
A build-up variant of the logarithmic barrier method for LP
Operations Research Letters
A simple complexity proof for a polynomial-time linear programming algorithm
Operations Research Letters
State estimation for Markovian Jump Linear Systems with bounded disturbances
Automatica (Journal of IFAC)
An entire space polynomial-time algorithm for linear programming
Journal of Global Optimization
| Hi-index | 0.00 |