In this paper, an algorithm is proposed to find the nearest point of a convex cone to a given vector, which is composed of a series of orthogonal projections. Some properties of this algorithm, including the reasonability of implementation, the global convergence property and the finite termination, etc., are obtained. The proposed algorithm is more stable than other related algorithms, which is verified by the numerical results shown at the end of this work.
Citation
College of Mathematics and Informatics, Fujian Normal University, Fuzhou, China, 02/2020