Summary.
We consider a smoothing-type method for the solution of linear programs. Its main idea is to reformulate the primal-dual optimality conditions as a nonlinear and nonsmooth system of equations, and to apply a Newton-type method to a smooth approximation of this nonsmooth system. The method presented here is a predictor-corrector method, and is closely related to some methods recently proposed by Burke and Xu on the one hand, and by the authors on the other hand. However, here we state stronger global and/or local convergence properties. Moreover, we present quite promising numerical results for the whole netlib test problem collection.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received August 9, 2000 / Revised version received September 28, 2000 / Published online June 7, 2001
Rights and permissions
About this article
Cite this article
Engelke, S., Kanzow, C. Improved smoothing-type methods for the solution of linear programs. Numer. Math. 90, 487–507 (2002). https://doi.org/10.1007/s002110100301
Issue Date:
DOI: https://doi.org/10.1007/s002110100301