Pages that link to "Item:Q5757354"
From MaRDI portal
The following pages link to Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path (Q5757354):
Displayed 19 items.
- Sufficient weighted complementarity problems (Q288407) (← links)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← 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)
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- A homotopy method for solving the horizontal linear complementarity problem (Q2514030) (← links)
- On the<i>P<sub>*</sub>(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones (Q2815503) (← links)
- Nondegenerate Piecewise Linear Systems: A Finite Newton Algorithm and Applications in Machine Learning (Q2919402) (← links)
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← 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)
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← 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)
