Abstract
This letter introduces the convex variable step-size (CVSS) algorithm. The convexity of the resulting cost function is guaranteed. Simulations presented show that with the proposed algorithm, we obtain similar results, as with the VSS algorithm in initial convergence, while there are potential performance gains when abrupt changes occur.
Original language | English |
---|---|
Pages (from-to) | 256-258 |
Number of pages | 3 |
Journal | IEEE Signal Processing Letters |
Volume | 7 |
Publication status | Published - 2000 |