Show simple item record

dc.contributor.authorLuo, Shenen
dc.date.accessioned2006-08-22 14:26:10 (GMT)
dc.date.available2006-08-22 14:26:10 (GMT)
dc.date.issued2006en
dc.date.submitted2006en
dc.identifier.urihttp://hdl.handle.net/10012/1181
dc.description.abstractWe propose a family of search directions based on primal-dual entropy in the context of interior point methods for linear programming. This new family contains previously proposed search directions in the context of primal-dual entropy. We analyze the new family of search directions by studying their primal-dual affine-scaling and constant-gap centering components. We then design primal-dual interior-point algorithms by utilizing our search directions in a homogeneous and self-dual framework. We present iteration complexity analysis of our algorithms and provide the results of computational experiments on NETLIB problems.en
dc.formatapplication/pdfen
dc.format.extent429420 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.rightsCopyright: 2006, Luo, Shen. All rights reserved.en
dc.subjectMathematicsen
dc.subjectPrimal-Dual entropyen
dc.subjectInterior-Point Algorithmen
dc.subjectreparameterizationen
dc.titleInterior-Point Algorithms Based on Primal-Dual Entropyen
dc.typeMaster Thesisen
dc.pendingfalseen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages