Pages that link to "Item:Q4012425"
From MaRDI portal
The following pages link to Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method (Q4012425):
Displayed 15 items.
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← 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 interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)