Pages that link to "Item:Q811094"
From MaRDI portal
The following pages link to A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094):
Displaying 14 items.
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Achievable potential reductions in the method of Kojima et al. in the case of linear programming (Q4887124) (← links)
- Linear programming with entropic perturbation (Q5286755) (← links)
- Maintaining closeness to the analytic center of a polytope by perturbing added hyperplanes (Q5961567) (← links)
