An approach for the convex feasibility problem via Monotropic Programming

In this note, we use recent zero duality results arising from Monotropic Programming problem for analyzing consistency of the convex feasibility problem in Hilbert spaces. We characterize consistency in terms of the lower semicontinuity of the infimal convolution of the associated support functions.