| |
|
Item: REP-2004-353
|
| |
Item:REP-2004-353
|
Title:A sparse proximal implementation of the LP dual active set algorithm
T. A. Davis
W. W. Hager
Abstract:
We present an implementation of the LP Dual Active Set Algorithm (LPDASA) based on a quadratic proximal approximation, a strategy for dropping inactive equations from the constraints, and recently developed algorithms for updating a sparse Cholesky factorization after a small rank change. Although our main focus is linear programming, the first and second-order proximal techniques that we develop are applicable to general concave-convex Lagrangians and to linear equality and inequality constraints. We use Netlib LP test problems to compare our proximal implementation of LPDASA to Simplex and Barrier algorithms, as implemented in CPLEX.
Supporting File:here
|
|
| |
|
Select Departmental Reports
|
| |
|
|
| |
|
Departmental Report Categories
|
| |
|
|
To submit items for this page, please log in on the
CISE submit page.
|
|