Pages that link to "Item:Q2954362"
From MaRDI portal
The following pages link to Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362):
Displaying 17 items.
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- 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)
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function (Q4308551) (← links)
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function (Q5009163) (← links)
- An interior point approach for linear complementarity problem using new parametrized kernel function (Q5055297) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term (Q6107947) (← 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)
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function (Q6586751) (← links)
