Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
This paper presents a projection-based approach for solving conic feasibility problems. To find a point in the intersection of a cone and an affine subspace, we simply project a point onto this intersection. This projection is computed by dual algorithms operating a sequence of projections onto the cone and generalizing …