Pages that link to "Item:Q5200563"

The following pages link to Interior-point methods for Cartesian<i>P</i>_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563):

Displaying 21 items.

• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
• A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
• A generalized smoothing Newton method for the symmetric cone complementarity problem (Q1659660) (← links)
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions (Q1709428) (← links)
• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771) (← links)
• The parameter-Newton iteration for the second-order cone linear complementarity problem (Q2127573) (← links)
• New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP (Q2436131) (← links)
• On the<i>P_*(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones (Q2815503) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones (Q4559409) (← links)
• A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i>_*(κ)-HLCP (Q4646542) (← links)
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
• Infeasible path-following interior point algorithm for Cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5026485) (← links)
• Infeasible Mehrotra-type predictor–corrector algorithm for cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5031768) (← 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)
• Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i>_*(κ)-SCLCP (Q5299915) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
• Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations (Q6151532) (← links)