Pages that link to "Item:Q5312760"
From MaRDI portal
The following pages link to Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760):
Displaying 29 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- Sufficient weighted complementarity problems (Q288407) (← links)
- Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
- Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity (Q1881563) (← links)
- On sufficient properties of sufficient matrices (Q2051181) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← 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)
- (Q3397676) (← links)
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path (Q4943612) (← links)
- The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems (Q4946716) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- A new second-order corrector interior-point algorithm for P*(k)-LCP (Q5023102) (← links)
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP (Q5198050) (← links)
- Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
- A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP (Q5379298) (← links)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
- Sufficient matrices: properties, generating and testing (Q6596334) (← links)
