Pages that link to "Item:Q4018386"
From MaRDI portal
The following pages link to A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming (Q4018386):
Displaying 14 items.
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← 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)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
- (Q4400646) (← links)
- On Long Step Path Following and SUMT for Linear and Quadratic Programming (Q4877504) (← links)
- A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments (Q5356997) (← links)
