Andersen Erling D.

Erling D. Andersen

Information about the author Erling D. Andersen will soon be added to the site.
Found 5 papers in total
A computational study of the homogeneous algorithm for large-scale convex optimization
A computational study of the homogeneous algorithm for large-scale convex optimization
1998
Recently the authors have proposed a homogeneous and self-dual algorithm for solving...
On exploiting problem structure in a basis identification procedure for linear programming
On exploiting problem structure in a basis identification procedure for linear programming
1999
During the last decade, interior-point methods have become an efficient alternative to...
On a homogeneous algorithm for the monotone complementarity problem
On a homogeneous algorithm for the monotone complementarity problem
1999
We present a generalization of a homogeneous self-dual linear programming (LP)...
Combining interior-point and pivoting algorithms for linear programming
Combining interior-point and pivoting algorithms for linear programming
1996
We propose a new approach to combine linear programming (LP) interior-point and...
Presolving in linear programming
Presolving in linear programming
1995
Most modern linear programming solvers analyze the LP problem before submitting it to...
Papers per page: