Condition Numbers for Polyhedra with Real Number Data
dc.contributor.author | Vavasis, Stephen A. | en_US |
dc.contributor.author | Ye, Yinyu | en_US |
dc.date.accessioned | 2007-04-23T16:33:34Z | |
dc.date.available | 2007-04-23T16:33:34Z | |
dc.date.issued | 1993-11 | en_US |
dc.description.abstract | We develop a condition-based complexity analysis for homogenous polyhedra with real number data. We analyze the dependency of primal-dual interior point algorithm efficiency on this condition number for finding a point in a polyhedron. Key Words: polyhedron, interior point algorithms, condition-based complexity. | en_US |
dc.format.extent | 703868 bytes | |
dc.format.extent | 185974 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1398 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6176 | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Condition Numbers for Polyhedra with Real Number Data | en_US |
dc.type | technical report | en_US |