In this study, a competitive linear parallel interference cancellation (LPIC) detector that is memory efficient, enjoys fast convergence and low complexity and can be used to approximate the decorrelator/minimum-mean-square error detector in largescale communication systems is proposed. Similar to the non-monotone gradient-based LPIC detectors developed recently by Bentrcia and Alshebeili, the proposed detector maintains its efficiency and does not break down quickly if matrix-vector products are not performed accurately. However, unlike the previous detectors, the proposed detector relies on a monotone line-search technique which renders it more attractive because early stopping methods such as the L-curve method can be used to stop the LPIC iterations prior to convergence in order to avoid the noise enhancement effect. Simulation results agree well with the authors theoretical findings.