An approach for the convex feasibility problem via monotropic programming
From MaRDI portal
Publication:2627919
DOI10.1016/j.jmaa.2017.04.023zbMath1430.90461OpenAlexW2607097197WikidataQ58048401 ScholiaQ58048401MaRDI QIDQ2627919
Victoria Martín-Márquez, Regina Sandra Burachik
Publication date: 9 June 2017
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2017.04.023
Fenchel dualityzero duality gapconvex feasibility problemnormal cone operatorFenchel conjugatemonotropic programming
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a zero duality gap result in extended monotropic programming
- Convexity and well-posed problems
- Extended monotropic programming and duality
- Duality for nonconvex approximation and optimization.
- Monotone networks
- A simple closure condition for the normal cone intersection formula
- On Projection Algorithms for Solving Convex Feasibility Problems