BIRS Workshop Lecture Videos
An approach for the convex feasibility problem via Monotropic Programming Burachik, Regina
We use recent zero duality gap 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.
Based on joint work with Victoria Martín-Márquez.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International