Pages that link to "Item:Q1114587"
From MaRDI portal
The following pages link to New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587):
Displaying 14 items.
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Volumetric path following algorithms for linear programming (Q1361113) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- An interior point continuous path-following trajectory for linear programming (Q2315589) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems (Q4018156) (← links)
- Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm (Q4332254) (← links)
- Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
- (Q5493569) (← links)
