\input zb-basic
\input zb-ioport
\iteman{io-port 00638728}
\itemau{Wu, S.Q.; Wu, F.}
\itemti{Rank-one techniques in log-barrier function methods for linear programming.}
\itemso{J. Optimization Theory Appl. 82, No.2, 405-413 (1994).}
\itemab
Summary: This short paper presents a primal interior-point method for linear programming. The method can be viewed as a modification of the methods developed earlier. In each iteration, it computes an approximately projected Newton direction and needs $O(n^{2.5})$ arithmetic operations to make the log-barrier function significantly decrease. It requires $O(\sqrt{nL})$ iterations, so that the total complexity is $O(n^3L)$.
\itemrv{~}
\itemcc{}
\itemut{Karmarkar's method; rank-one techniques; primal interior-point method; approximately projected Newton direction; log-barrier function}
\itemli{doi:10.1007/BF02191863}
\end