Pages that link to "Item:Q2311198"
From MaRDI portal
The following pages link to A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems (Q2311198):
Displaying 13 items.
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems (Q495422) (← links)
- An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
- An interior-point algorithm for horizontal linear complementarity problems (Q2204621) (← links)
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP (Q2263027) (← links)
- (Q4996635) (← links)
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP (Q5198050) (← links)
- Path-following interior-point algorithm for monotone linear complementarity problems (Q5876796) (← links)
- New smoothing function for solving absolute value equations (Q6650941) (← links)
- On the equivalence of projected iterative methods and modulus-based matrix splitting iterative methods for horizontal linear complementarity problems (Q6665345) (← links)
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP (Q6667371) (← links)
