Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556788.2012.737327
+Normal rank
@@ Property / OpenAlex ID @@
+W2019266326
@@ Property / OpenAlex ID: W2019266326 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Infinity-Norm Path Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
+Normal rank
@@ Property / cites work @@
+An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
+Normal rank
@@ Property / cites work @@
+Long-step strategies in interior-point primal-dual methods
+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 @@
+On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
+Normal rank
@@ Property / cites work @@
+Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
+Normal rank
@@ Property / cites work @@
+A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
+Normal rank