An approach for the convex feasibility problem via monotropic programming
From MaRDI portal
Recommendations
Cites work
- A simple closure condition for the normal cone intersection formula
- Convexity and well-posed problems
- Duality for nonconvex approximation and optimization.
- Extended monotropic programming and duality
- scientific article; zbMATH DE number 3853853 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- Monotone networks
- On a zero duality gap result in extended monotropic programming
- On Projection Algorithms for Solving Convex Feasibility Problems
Cited in
(4)- The combination projection method for solving convex feasibility problems
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- scientific article; zbMATH DE number 5910789 (Why is no real title available?)
- On a zero duality gap result in extended monotropic programming
This page was built for publication: An approach for the convex feasibility problem via monotropic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2627919)