Pages that link to "Item:Q1107438"

The following pages link to Computing Karmarkar projections quickly (Q1107438):

Displaying 12 items.

• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714) (← links)
• A quadratically convergent method for linear programming (Q808185) (← links)
• Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
• An extended variant of Karmarkar's interior point algorithm (Q879548) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
• Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
• On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
• An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
• Computing Karmarkar's projections quickly by using matrix factorization (Q1815744) (← links)
• El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)