dc.contributor.author | Silalahi, Bib Paruhum | |
dc.date.accessioned | 2015-10-07T03:13:18Z | |
dc.date.available | 2015-10-07T03:13:18Z | |
dc.date.issued | 2013 | |
dc.identifier.isbn | 978-979-95093-9-0 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/76440 | |
dc.description.abstract | Recenrly, 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.iso | id | |
dc.publisher | Faculty of Mathematics and Natural Sciences Bogar Agricultural University | |
dc.relation.ispartofseries | 15-17 November 2013; | |
dc.title | Gap between the Lower and Upper Bounds for the Iteration Complexity of Interior-Point Methods | en |