Given a closed convex cone of approximants in a strictly convex reflexive Banach space we give an implementable, iterative algorithm for finding the best approximation for a point outside this cone. First the necessary duality theorems are proved and then the characterizations of the best approximations are given. Convergence of the algorithm is then proved. Some numerical results are also included.