Pages that link to "Item:Q2994022"
From MaRDI portal
The following pages link to Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones (Q2994022):
Displaying 5 items.
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928) (← links)
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
- A second order infeasible Mehrotra-type predictor-corrector algorithm for linear programming (Q2924132) (← links)
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System (Q5704144) (← links)