Pages that link to "Item:Q4764897"
From MaRDI portal
The following pages link to The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup> (Q4764897):
Displaying 13 items.
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- An easy way to teach interior-point methods. (Q5932020) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
