By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...

In this paper, a posteriori QR decomposition (QRD) least squares (LS) lattice-ladder algorithm without square root based on Givens rotation is derived from the posteriori LS lattice-ladder algorithm ...