Approximate Projections in a Projective Method for the Linear Feasibility Problem

Jean-Philippe Vial

Chapter Chapter 4 in Progress in Mathematical Programming, 1989, pp 65-78 from Springer

Abstract: Abstract The key issue in implementing a projective method is the projection operation. In order to cut down computations, several authors have suggested using approximations instead of the projection itself. However, these approximations are not directly compatible with the standard proofs of polynomial complexity. In this chapter we present a relaxation of the main convergence lemma which makes it possible to accommodate approximate projections. We propose several types of approximations that preserve polynomial complexity for the version of Karmarkar’s algorithm presented by de Ghellinck and Vial.

Date: 1989
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9617-8_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461396178

DOI: 10.1007/978-1-4613-9617-8_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().