We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Convex Feasibility via Monotropic Programming

00:00
playback rate
1
quality
480p
subtitles
off
playback rate
0.25
0.5
0.75
1
1.25
1.5
1.75
2
quality
480p
360p
240p
2
 Cite
 Share
 Related Material
 Download Purchase
No logo availableBanff International Research Station (BIRS) for Mathematical Innovation and Discovery
 Burachik, Regina S.

Formal Metadata

Title
Convex Feasibility via Monotropic Programming
Alternative Title
An approach for the convex feasibility problem via Monotropic Programming
Title of Series
Number of Parts
30
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
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.