A class of polynomial primal-dual interior-point algorithms for semidefinite optimization (Q3415567): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11741-006-0114-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2067661291
@@ Property / OpenAlex ID: W2067661291 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of semidefinite programming. Theory, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+Q4347846
@@ Property / cites work: Q4347846 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Self-Scaled Cones
+Normal rank
@@ Property / cites work @@
+A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank