Show simple item record

dc.contributor.authorDennis, J.E. Jr.
Morshedi, A.M.
Turner, Kathryn
dc.date.accessioned 2018-06-18T17:27:11Z
dc.date.available 2018-06-18T17:27:11Z
dc.date.issued 1986-06
dc.identifier.citation Dennis, J.E. Jr., Morshedi, A.M. and Turner, Kathryn. "A Variable Metric Variant of the Karmarkar Algorithm for Linear Programming." (1986) https://hdl.handle.net/1911/101601.
dc.identifier.urihttps://hdl.handle.net/1911/101601
dc.description.abstract The most time-consuming part of the Karmarkar algorithm for linear programming is the projection of a vector onto the nullspace of a matrix that changes at each iteration. We present a variant of the Karmarkar algorithm that uses standard variable-metric techniques in an innovative way to approximate this projection. In limited tests, this modification greatly reduces the number of matrix factorizations needed for the solution of linear programming problems.
dc.format.extent 34 pp
dc.title A Variable Metric Variant of the Karmarkar Algorithm for Linear Programming
dc.type Technical report
dc.date.note June 1986 (Revised January 1997)
dc.identifier.digital TR86-13
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record