Pages that link to "Item:Q1095025"

The following pages link to Karmarkar's algorithm and the ellipsoid method (Q1095025):

Displaying 10 items.

• The steepest descent gravitational method for linear programming (Q583105) (← links)
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
• A ``build-down'' scheme for linear programming (Q912758) (← links)
• Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
• A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
• Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
• Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems (Q3200891) (← links)