Show simple item record

dc.contributor.authorBaryamureeba, Venansius
dc.contributor.authorSteihaug, Trond
dc.date.accessioned2022-07-18T10:14:29Z
dc.date.available2022-07-18T10:14:29Z
dc.date.issued2005
dc.identifier.citationBaryamureeba, V., & Steihaug, T. (2005, June). On the convergence of an inexact primal-dual interior point method for linear programming. In International Conference on Large-Scale Scientific Computing (pp. 629-637). Springer, Berlin, Heidelberg.en_US
dc.identifier.urihttps://link.springer.com/chapter/10.1007/11666806_72
dc.identifier.urihttps://nru.uncst.go.ug/handle/123456789/4218
dc.description.abstractThe inexact primal-dual interior point method which is discussed in this paper chooses a new iterate along an approximation to the Newton direction. The method is the Kojima, Megiddo, andMizuno globally convergent infeasible interior point algorithm. The inexact variation is shown to have the same convergence properties accepting a residue in both the primal and dual Newton step equation also for feasible iterates.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectConvergenceen_US
dc.subjectPrimal-Dual Interior Point Methoden_US
dc.subjectLinear Programmingen_US
dc.titleOn the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programmingen_US
dc.typeBook chapteren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record