Pages that link to "Item:Q1181914"

The following pages link to On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914):

Displaying 34 items.

• An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
• Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
• The central curve in linear programming (Q695626) (← links)
• Representing the space of linear programs as the Grassmann manifold (Q847840) (← links)
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
• A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms (Q930345) (← links)
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
• Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← links)
• A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
• Interior-point methods for convex programming (Q1205507) (← links)
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
• Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
• A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
• The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
• On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
• The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
• A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
• An interior-point method for semi-infinite programming problems (Q1915915) (← links)
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
• Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
• Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625) (← links)
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
• What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
• On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
• A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
• Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs (Q6138812) (← links)
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)