The paper addresses the interrelations between two algorithms for finding a common point of convex sets, namely, Bregman's and Yakubovich's methods. Both algorithms were born in the 1960s yet never be compared. A kind of comparison is proposed and illustrated by examples. A new algorithm of finding an intersection of the convex sets (half-spaces) is proposed based on combination of the ideas of both approaches. © 2025 The Authors.