Pages that link to "Item:Q1176804"
From MaRDI portal
The following pages link to A primal projective interior point method for linear programming (Q1176804):
Displaying 10 items.
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- An experimental approach to karmarkar’s projective method for linear programming (Q3773690) (← links)
- A fifth bibliography of fractional programming<sup>*</sup> (Q4265528) (← links)
- A circular cone relaxation primal interior point algorithm for LP (Q4467177) (← links)
- PCx: an interior-point code for linear programming (Q4504787) (← links)