Pages that link to "Item:Q1819152"
From MaRDI portal
The following pages link to On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems (Q1819152):
Displayed 8 items.
- On a special class of regularized central paths for semidefinite programs (Q847845) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
- A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs (Q3648621) (← links)
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)