“…Exact line search is in general computationally intensive and presents other limitations [15], which explains why, despite being a well-known optimization method, it is very rarely used. However, for criteria that can be expressed as rational functions of μ, such as the kurtosis, the constant modulus [16], [17] and the constant power [18], [19] contrasts, the optimal step size μ opt can easily be determined by finding the roots of a low-degree polynomial. At each iteration, optimal step-size (OS) optimization performs the following steps: S1) Compute OS polynomial coefficients.…”