Title	An approach for the convex feasibility problem via Monotropic Programming
Creator	Burachik, Regina
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-09-22T10:20
Description	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.
Extent	23 minutes
Subject	Mathematics; Operations research, mathematical programming; Operator theory; Control/optimization/operation research
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of South Australia
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2018-03-27
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0364486
URI	http://hdl.handle.net/2429/64944
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Other
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos