On Brown's method with convexity hypotheses
Given two initial points generating monotone convergent Brown iterations in the context of the monotone Newton theorem (MNT), it is proved that if one of them is an upper bound of the other, then the same holds for each pair of respective terms in the Brown sequences they generate. This comparison result is carried over to the corresponding Brown-Fourier iterations. An illustration is discussed.