Pages that link to "Item:Q732130"

The following pages link to Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130):

Displaying 31 items.

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• Kernel function based interior-point methods for horizontal linear complementarity problems (Q394593) (← links)
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions (Q1709428) (← links)
• Dictionary learning for fast classification based on soft-thresholding (Q1799991) (← links)
• An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function (Q2053282) (← links)
• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions (Q2062428) (← links)
• A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems (Q2111550) (← links)
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem (Q2249832) (← links)
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems (Q2311198) (← links)
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function (Q2346488) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• Using vector divisions in solving the linear complementarity problem (Q2428109) (← links)
• New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP (Q2436131) (← links)
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
• The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems (Q2682723) (← links)
• A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian<i>P</i>_*(κ) horizontal linear complementarity problems over symmetric cones (Q2790893) (← links)
• Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P</i>_∗(<i>κ</i>)-LCP (Q2798122) (← links)
• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• A Corrector-Predictor Interior-Point Algorithm for <i>P</i>_∗(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones (Q2987781) (← 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)
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)