Pages that link to "Item:Q1906276"

The following pages link to A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276):

Displaying 39 items.

• An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
• Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
• Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← 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)
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones (Q1043012) (← links)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
• \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems (Q1569112) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function (Q2053077) (← links)
• On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← 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)
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems (Q2483352) (← links)
• A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems (Q2706331) (← links)
• An asymptotical \(O((k+1)n^3L)\) affine scaling algorithm for the \(P_*(k)\)-matrix linear complementarity problem (Q2725284) (← links)
• Kernel-function Based Primal-Dual Algorithms for<i>P</i>_{_*}(<i>κ</i>) Linear Complementarity Problems (Q3057529) (← links)
• (Q4577944) (← links)
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term (Q4596180) (← links)
• An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← 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)
• A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP (Q5039376) (← links)
• Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian<i>P</i>_∗(κ)-LCP over symmetric cones (Q5248204) (← links)
• Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i>_*(κ)-SCLCP (Q5299915) (← links)
• A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP (Q5379298) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)