Journal article
On the length of primal-dual projection of potential reduction algorithm
Optimization, Vol.34(2), pp.161-171
01/01/1995
DOI: 10.1080/02331939508844102
Abstract
The length of projection of search directions takes an important role in analyzing the complexity of potential reduction algorithms. We show-in this paper. that the length of the projection is bounded below by 1/4 if
and is greater than or equal to one if
. where p is a parameter in potential function and n is the number of variables in linear programming
Details
- Title: Subtitle
- On the length of primal-dual projection of potential reduction algorithm
- Creators
- S. Huang - Hong Kong University of Science and TechnologyK. O. Kortanek - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Optimization, Vol.34(2), pp.161-171
- DOI
- 10.1080/02331939508844102
- ISSN
- 0233-1934
- eISSN
- 1029-4945
- Publisher
- Gordon and Breach Science Publishers
- Number of pages
- 11
- Language
- English
- Date published
- 01/01/1995
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963098202771
Metrics
1 Record Views