Pages that link to "Item:Q2954362"

The following pages link to Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362):

Displaying 8 items.

• An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
• An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound (Q2038473) (← links)
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← 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)
• 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)