Pages that link to "Item:Q4018156"
From MaRDI portal
The following pages link to Algorithmic Enhancements to the Method of Centers for Linear Programming Problems (Q4018156):
Displaying 9 items.
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- Euclidean centers: Computation, properties and a MOLP application (Q949532) (← links)
- On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Interval judgments and Euclidean centers (Q2472688) (← links)
- Weighted Euclidean centers (Q5466707) (← links)
