Pages that link to "Item:Q1108926"
From MaRDI portal
The following pages link to A relaxed version of Karmarkar's method (Q1108926):
Displaying 16 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- Karmarkar's algorithm with improved steps (Q910334) (← links)
- A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm (Q1089251) (← links)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm (Q3140007) (← links)
- A modified scaling algorithm for LP (Q3352838) (← links)
- El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)
- A variant of Karmarkar's linear programming algorithm for problems in standard form (Q3767120) (← links)
- A variable-metric variant of the Karmarkar algorithm for linear programming (Q3775323) (← links)
- On the symmetric affiine scaling algorithm for line programming<sup>*</sup> (Q4764582) (← links)