An approach for the convex feasibility problem via Monotropic Programming

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS

卷:453

Article

关键词: Monotropic Programming;    Convex feasibility problem;    Fenchel duality;    Fenchel conjugate;    Normal cone operator;    Zero duality gap;   

DOI  :  10.1016/j.jmaa.2017.04.023

来源: Elsevier

【 摘 要 】

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. (C) 2017 Elsevier Inc. All rights reserved.

【 授权许可】

Free