A logarithm barrier method for linear programming

From MaRDI portal





An algorithm for solving an unconstrained optimization problem based on an iterative process using higher-order derivatives is already known. Considering this iterative process, the author proves cubic convergence; furthermore, he introduces an interior point method for solving a linear programming problem using a Taylor series expansion related to the gradient of the penalty function. Very promising numerical results having important characteristics are presented. The paper stands as a very substantial contribution to the topic of linear programming.











This page was built for publication: A logarithm barrier method for linear programming

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