Pages that link to "Item:Q1352307"

The following pages link to A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307):

Displaying 31 items.

• An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
• The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
• The central curve in linear programming (Q695626) (← links)
• Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← 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)
• A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
• On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
• Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
• On the condition numbers for polyhedra in Karmarkar's form (Q1306351) (← links)
• A note on properties of condition numbers (Q1362668) (← links)
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
• Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
• A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985) (← links)
• On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
• Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
• On Chubanov's Method for Linear Programming (Q2962562) (← 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)