Iteratively minimizing the function Consider the problem

\begin{equation}
\min_{x\in X, y \in Y} f(x,y)
\end{equation}

Can I solve the problem by iteratively solving the following two sub problems?

\begin{equation}
x_{k+1} = \arg\min_{x\in X} f(x,y_k)
\end{equation}

\begin{equation}
y_{k+1} = \arg\min_{ y \in Y} f(x_k,y)
\end{equation}

If yes, is there any books/papers talking about this kind of approach?

Thanks
This is a very popular heuristic method in machine learning, known as alternating minimization. You can easily find tons of papers using it. Often the setting in which it is used is when $f(x,y)$ is convex in $x$ and $y$ separately (so each minimization step can be done via some variant of gradient descent), but not jointly convex. In this case, as RB notes, it is not apriori clear that this method converges to an optimal solution at all. A classical paper by Csiszar and Tusnady gives a general "five point criterion" for convergance to the global optimum, and proves that it holds for $f$ equal to the KL-divergence. More recently, Jain, Nethrapalli and Singhavi, and Hardt have analyzed variants of this approach for the matrix completion problem.