Pages that link to "Item:Q920840"
From MaRDI portal
The following pages link to A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840):
Displaying 6 items.
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← 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)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
