Pages that link to "Item:Q261844"
From MaRDI portal
The following pages link to An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844):
Displaying 14 items.
- 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 infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← links)
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems (Q2311198) (← links)
- An infeasible full NT-step interior point method for circular optimization (Q2360232) (← links)
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
- A new infeasible interior-point method for linear complementarity problem based on full Newton step (Q2858825) (← links)
- Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems (Q2966478) (← links)
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N∞−</b> neighbourhood of the central path (Q3177455) (← links)
- (Q4996635) (← links)
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP (Q5198050) (← links)
- A new search direction for full-Newton step infeasible interior-point method in linear optimization (Q6202360) (← links)
