Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677): Difference between revisions

@@ Property / DOI @@
-.1007/s11741-009-0416-1
@@ Property / DOI: 10.1007/s11741-009-0416-1 / rank @@
-Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / DOI @@
+.1007/S11741-009-0416-1
@@ Property / DOI: 10.1007/S11741-009-0416-1 / rank @@
+Normal rank