Weighted-path-following algorithm for linear programming

MaRDI QIDQ5412905zbMATH OpenFDO

Authors H. Roumili

Publication date 28 April 2014

zbMATH Keywords

central pathconvergenceinitial central pointinterior-point algorithmKarmarkar algorithmlinear programmingNewton's methodweighted-path-following method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• A weighted-path-following method for linear optimization
• A polynomial-time weighted path-following interior-point algorithm for linear optimization
• A weighted-path-following method for the linear complementarity problem
• A weighted path-following method for linearly constrained convex programming
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem

Cited in

(9)

• A weighted least squares study of robustness in interior point linear programming
• Modified predictor-corrector algorithm for locating weighted centers in linear programming
• Volumetric path following algorithms for linear programming
• Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• Path-Following Methods for Linear Programming
• A polynomial-time weighted path-following interior-point algorithm for linear optimization
• A weighted-path-following method for linear optimization
• A weighted path-following method for linearly constrained convex programming

This page was built for publication: Weighted-path-following algorithm for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412905)