Pages that link to "Item:Q1265875"
From MaRDI portal
The following pages link to A path following method for LCP with superlinearly convergent iteration sequence (Q1265875):
Displaying 8 items.
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> (Q4235448) (← links)
- How Many Steps Still Left to $x$*? (Q5009892) (← links)
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)