Erling D. Andersen

According to our database, Erling D. Andersen authored at least 12 papers between 1995 and 2024.

Collaborative distances:

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

2024

Computing Conjugate Barrier Information for Nonsymmetric Cones.

Lea Kapelevich, Erling D. Andersen, Juan Pablo Vielma

J. Optim. Theory Appl., July, 2024

2022

A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization.

Joachim Dahl, Erling D. Andersen

Math. Program., 2022

2017

Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach.

Frank Permenter, Henrik A. Friberg, Erling D. Andersen

SIAM J. Optim., 2017

2013

Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems.

Anders Skajaa, Erling D. Andersen, Yinyu Ye

Math. Program. Comput., 2013

2009

Homogeneous Selfdual Methods for Linear Programming.

Erling D. Andersen

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2003

On implementing a primal-dual interior-point method for conic quadratic optimization.

Erling D. Andersen, Cornelis Roos, Tamás Terlaky

Math. Program., 2003

2001

Certificates of Primal or Dual Infeasibility in Linear Programming.

Erling D. Andersen

Comput. Optim. Appl., 2001

2000

On Primal and Dual Infeasibility Certificates in a Homogeneous Model for Convex Optimization.

Erling D. Andersen

SIAM J. Optim., 2000

1999

On a homogeneous algorithm for the monotone complementarity problem.

Erling D. Andersen, Yinyu Ye

Math. Program., 1999

On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming.

Erling D. Andersen

INFORMS J. Comput., 1999

1998

A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization.

Erling D. Andersen, Yinyu Ye

Comput. Optim. Appl., 1998

1995

Presolving in linear programming.

Erling D. Andersen, Knud D. Andersen

Math. Program., 1995