Knud D. Andersen

According to our database, Knud D. Andersen authored at least 6 papers between 1995 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms.

Knud D. Andersen, Edmund Christiansen, Andrew R. Conn, Michael L. Overton

SIAM J. Sci. Comput., 2000

1998

Computing Limit Loads by Minimizing a Sum of Norms.

Knud D. Andersen, Edmund Christiansen, Michael L. Overton

SIAM J. Sci. Comput., 1998

Minimizing a Sum of Norms Subject to Linear Equality Constraints.

Knud D. Andersen, Edmund Christiansen

Comput. Optim. Appl., 1998

1996

A Modified Schur-Complement Method for Handling Dense Columns in Interior-Point Methods for Linear Programming.

Knud D. Andersen

ACM Trans. Math. Softw., 1996

An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms.

Knud D. Andersen

SIAM J. Optim., 1996

1995

Presolving in linear programming.

Erling D. Andersen, Knud D. Andersen

Math. Program., 1995