AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS (Q3392293): Difference between revisions

@@ Property / cites work @@
+An interior point method for linear programming based on a class of Kernel functions
+Normal rank
@@ Property / cites work @@
+A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4716820
@@ Property / cites work: Q4716820 / rank @@
+Normal rank
@@ Property / cites work @@
+A new class of polynomial primal-dual methods for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
+Normal rank
@@ Property / cites work @@
+On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0217595909002250
+Normal rank
@@ Property / OpenAlex ID @@
+W2118696995
@@ Property / OpenAlex ID: W2118696995 / rank @@
+Normal rank