Construction of the polynomial of least deviation for approximations with a sign-sensitive weight

A Remez-type iterative algorithm is proposed for determining the polynomial of least deviation from a real continuous function in a sign-sensitive metric defined by a nonsingular continuous weight on a compactum lying on the real axis or a circle. It is proved that the proposed algorithm has the convergence rate of a geometric progression.