Pages that link to "Item:Q1092808"

The following pages link to Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808):

Displaying 30 items.

• The steepest descent gravitational method for linear programming (Q583105) (← links)
• Dual interior point algorithms (Q647858) (← links)
• Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← 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)
• Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
• An algorithm for linear programming that is easy to implement (Q917443) (← links)
• The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
• An analysis of an available set of linear programming test problems (Q1113798) (← links)
• On finding a vertex solution using interior point methods (Q1174841) (← links)
• An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
• Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
• Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
• A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
• Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
• On the convergence of the affine-scaling algorithm (Q1196183) (← links)
• A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
• A simplified global convergence proof of the affine scaling algorithm (Q1312779) (← links)
• Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
• Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
• An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points (Q1373875) (← links)
• Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
• A partial first-order affine-scaling method (Q1734900) (← links)
• Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
• Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
• Interior point method: history and prospects (Q2300702) (← links)
• Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
• Loss and retention of accuracy in affine scaling methods (Q2778681) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)