Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.

From MaRDI portal

(Redirected from Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Global_and_polynomial-time_convergence_of_an_infeasible-interior-point_algorithm_using_inexact_computation.&oldid=70735332"