eCommons

 

Condition Numbers for Polyhedra with Real Number Data

dc.contributor.authorVavasis, Stephen A.en_US
dc.contributor.authorYe, Yinyuen_US
dc.date.accessioned2007-04-23T16:33:34Z
dc.date.available2007-04-23T16:33:34Z
dc.date.issued1993-11en_US
dc.description.abstractWe 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.extent703868 bytes
dc.format.extent185974 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1398en_US
dc.identifier.urihttps://hdl.handle.net/1813/6176
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleCondition Numbers for Polyhedra with Real Number Dataen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
93-1398.pdf
Size:
687.37 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
93-1398.ps
Size:
181.62 KB
Format:
Postscript Files