We deal with a recently proposed method of Chubanov [1], for solving linear homogeneous systems with positive variables. We use Nesterov's excessive gap method in the basic procedure. As a result, the iteration bound for the basic procedure is reduced by the factor $nsqrt{n}$. The price for this improvement is that the iterations are more costly, namely $O(n^2 )$ instead of $O(n)$. The overall ...

We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient (HPE) method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-comple...

Many new product development (NPD) projects are inherently complex, making effective management of the tasks, resources, and teams necessary to bring new products to market problematic. Frequently, managers of such NPD projects are overwhelmed by complicating factors such as stochastic task times, ill-defined specifications, complex interrelationships between tasks, and information dependencies...

Decision-making problems in uncertain or stochastic domains are often formulated as Markov decision processes (MD Ps). Pol­ icy iteration (PI) is a popular algorithm for searching over policy-space, the size of which is exponential in the number of states. We are interested in bounds on the complexity of PI that do not depend on the value of the discount factor. In this paper we prove the first...

Projection type methods are among the most important methods for solving monotone linear variational inequalities. In this note, we analyze the iteration complexity for two projection methods and accordingly establish their worst-case O(1/t) convergence rates measured by the iteration complexity in both the ergodic and nonergodic senses, where t is the iteration counter. Our analysis does not r...

V—BLAST is an effective detection method for MIMO communication system, but has large computational complexity due to its successive iteration. In this paper, we proposed modified V-BLAST to lessen its computational complexity reducing the number of successive iteration. As a result of this simplification, the computational complexity of the detection is lowered significantly. Simulation result...