interior-point method for lp using barrier-based primal-dual iterations

From MaRDI portal

Interior-point method for lp using barrier-based primal-dual iterations

Jump to:navigation, search

MaRDI QIDQ6825562FDO

Polynomial-time method that traverses the interior (central path); competitive for large sparse lp.

Described by source

A new polynomial-time algorithm for linear programming

This page was built for algorithm: interior-point method for lp using barrier-based primal-dual iterations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Interior-point_method_for_lp_using_barrier-based_primal-dual_iterations&oldid=55839748"