A new algorithm for computing projections on smooth convex sets

Summary form only given. An algorithm for computing the projection of a point onto a closed convex set is presented. It is assumed that the set is smooth. The procedure is a simple iterative scheme that generates a sequence of points starting from an initial guess of the solution. This sequence of points converges to the desired projection. The procedure also guarantees that at any point in the iteration, the generated approximate projection always lies on the boundary of the set