In the paper we address the classical problem of solving one equation given by (d.c.) function represented by the difference of two convex functions. This problem is initiated by the optimization problems with constraints in the form of inequalities and/or equalities given by d.c. functions when one needs to descent from an unfeasible point to the boundary of a constraint improving, at the same time, the value of the objective function. We propose a new numerical procedure which allows to do this. Further, for the developed algorithm we provide the convergence results and numerical results of computational testing which look rather promising and competitive.