Pages that link to "Item:Q1184332"

The following pages link to Unified complexity analysis for Newton LP methods (Q1184332):

Displaying 14 items.

• A long-step barrier method for convex quadratic programming (Q689102) (← links)
• The modified barrier function method for linear programming and its extensions (Q918138) (← links)
• Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
• Modified barrier functions (theory and methods) (Q1186277) (← links)
• Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
• A new linesearch method for quadratically constrained convex programming (Q1342277) (← links)
• Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
• The Kantorovich theorem and interior point methods (Q1769068) (← links)
• A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
• The implementation of linear programming algorithms based on homotopies (Q1911465) (← links)
• The Newton modified barrier method for QP problems (Q1915923) (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
• Complexity analysis for certain convex programming problems (Q1974569) (← links)
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)