An approach for the convex feasibility problem via monotropic programming (Q2627919): Difference between revisions

@@ Property / Wikidata QID @@
+Q58048401
@@ Property / Wikidata QID: Q58048401 / rank @@
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Extended monotropic programming and duality
@@ Property / cites work: Extended monotropic programming and duality / rank @@
+Normal rank
@@ Property / cites work @@
+On a zero duality gap result in extended monotropic programming
+Normal rank
@@ Property / cites work @@
+A simple closure condition for the normal cone intersection formula
+Normal rank
@@ Property / cites work @@
+Convexity and well-posed problems
@@ Property / cites work: Convexity and well-posed problems / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone networks
@@ Property / cites work: Monotone networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q5599348
@@ Property / cites work: Q5599348 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3322715
@@ Property / cites work: Q3322715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3730336
@@ Property / cites work: Q3730336 / rank @@
+Normal rank
@@ Property / cites work @@
+Duality for nonconvex approximation and optimization.
+Normal rank