Pages that link to "Item:Q2422131"
From MaRDI portal
The following pages link to A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131):
Displaying 13 items.
- An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- An interior-point algorithm for horizontal linear complementarity problems (Q2204621) (← links)
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood (Q2800675) (← links)
- Path-following interior point algorithms based on wide neighborhoods and a new class of directions (Q2825059) (← links)
- A large-update predictor-correcting algorithm for linear complementarity problem (Q2858264) (← links)
- Polynomial convergence of a predictor-corrector interior-point algorithm for LCP (Q2905834) (← links)
- A new predictor-corrector large-update interior-point algorithm for nonmonotone linear complementarity problems (Q2918060) (← links)
- A Mehrotra predictor-corrector algorithm for linear complementarity problem (Q2924131) (← links)
- (Q3397676) (← links)
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)
