A relaxed version of Karmarkar's method is developed. This method is proved to have the same polynomial time complexity as Karmarkar's method and its efficient implementation using inexact projections is discussed. Computational results obtained using a preliminary implementation of the method are presented which indicate that the method is practicable.
|Original language||English (US)|
|Number of pages||27|
|Journal||Mathematical Programming, Series B|
|State||Published - Apr 1 1988|
ASJC Scopus subject areas