Pages that link to "Item:Q451811"
From MaRDI portal
The following pages link to A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811):
Displaying 8 items.
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
- An adaptive updating full-Newton step interior-point algorithm with modified Newton direction (Q2261941) (← links)
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP (Q2263027) (← links)
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← links)
- Linear complementarity model predictive control with limited iterations for box-constrained problems (Q2663927) (← links)
- An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← links)
