Madsen, K.Nielsen, H. B.Pınar, M. Ç.2019-02-122019-02-1219961052-6234http://hdl.handle.net/11693/49284We describe a new finite continuation algorithm for linear programming. The dual of the linear programming problem with unit lower and upper bounds is formulated as an f\ minimization problem augmented with the addition of a linear term. This nondifferentiable problem is approximated by a smooth problem. It is shown that the minimizers of the smooth problem define a family of piecewise-linear paths as a function of a smoothing parameter. Based on this property, a finite algorithm that traces these paths to arrive at an optimal solution of the linear program is developed. The smooth problems are solved by a Newton-type algorithm. Preliminary numerical results indicate that the new algorithm is promising.EnglishFinite algorithmsContinuation methodsLinear programming£1 optimizationHuber functionNewton's methodArticle10.1137/S10526234932585561095-7189