Condition Numbers for Polyhedra with Real Number Data
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1993-11
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1398
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report