| Abstract: | Some optimization problems can be reduced to finding a solution of a system of linear inequalities which belongs to a closed convex subset. In some optimization methods such a solution (or at least a better approximation of such a solution than the current one) should be found in each iteration. In the article, we present various projection methods to solve this problem. Furthermore, we show the relationship between these methods. We show that all presented methods can be reduced to the surrogate constraints method. |
