Pages that link to "Item:Q5202502"

The following pages link to A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm (Q5202502):

Displaying 15 items.

• A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← 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 modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
• On the condition numbers for polyhedra in Karmarkar's form (Q1306351) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
• A note on properties of condition numbers (Q1362668) (← links)
• A simple proof of a primal affine scaling method (Q1915916) (← links)
• Identifying an optimal basis in linear programming (Q1915926) (← links)
• Condition numbers for polyhedra with real number data (Q1924613) (← links)
• A norm bound for projections with complex weights (Q1973918) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
• A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
• An easily computable upper bound on the Hoffman constant for homogeneous inequality systems (Q6179881) (← links)