A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (Q3066932): Difference between revisions

@@ Property / cites work @@
+An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
+Normal rank
@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
+Normal rank
@@ Property / cites work @@
+An Interior-Point Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Primal--Dual Path-Following Algorithms for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+On the Nesterov--Todd Direction in Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
+Normal rank