New stopping criteria for detecting infeasibility in conic optimization (Q1024728): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-008-0100-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2080216751
@@ Property / OpenAlex ID: W2080216751 / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+SDPLIB 1.2, a library of semidefinite programming test problems
+Normal rank
@@ Property / cites work @@
+Characterization of the barrier parameter of homogeneous convex cones
+Normal rank
@@ Property / cites work @@
+Q4400648
@@ Property / cites work: Q4400648 / rank @@
+Normal rank
@@ Property / cites work @@
+Conic convex programming and self-dual embedding
@@ Property / cites work: Conic convex programming and self-dual embedding / rank @@
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+A Mathematical View of Interior-Point Methods in Convex Optimization
+Normal rank
@@ Property / cites work @@
+Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
+Normal rank