Show simple item record

dc.contributor.authorSilalahi, Bib Paruhum
dc.date.accessioned2015-10-07T03:13:18Z
dc.date.available2015-10-07T03:13:18Z
dc.date.issued2013
dc.identifier.isbn978-979-95093-9-0
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/76440
dc.description.abstractRecenrly, the uu of interior-point methods to solve linear optimi:arion problems, have been becoming great a/fenrion ro the researchers. The most important thing is that the interior point methods have the best complexity compared to other methods and also efficient in practice Gon:aga. Afomeiro and Adler presented small-update path-following methods. a varionr of interior-point methods. which is the best known upper bound for the iteration complexity of an interior-point method. Roos...en
dc.language.isoid
dc.publisherFaculty of Mathematics and Natural Sciences Bogar Agricultural University
dc.relation.ispartofseries15-17 November 2013;
dc.titleGap between the Lower and Upper Bounds for the Iteration Complexity of Interior-Point Methodsen


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Proceedings [2790]
    Proceedings of Bogor Agricultural University's seminars

Show simple item record