Pages that link to "Item:Q5278842"

The following pages link to A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term (Q5278842):

Displaying 14 items.

• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
• An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← links)
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (Q2303523) (← links)
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
• An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function (Q4606373) (← links)
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function (Q5009163) (← links)
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
• Interior-point algorithm for linear programming based on a new descent direction (Q6140958) (← links)
• Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573) (← links)
• Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798) (← links)