Pages that link to "Item:Q4650623"

The following pages link to A polynomial-time algorithm for linear optimization based on a new simple kernel function (Q4650623):

Displaying 25 items.

• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems (Q353550) (← links)
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
• A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
• An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
• An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
• The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← links)
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function (Q2477797) (← links)
• Interior-point methods based on kernel functions for symmetric optimization (Q2885493) (← links)
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870) (← links)
• Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming (Q3368128) (← links)
• (Q5085900) (← links)
• A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← links)
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)