Pages that link to "Item:Q2996870"
From MaRDI portal
The following pages link to A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870):
Displaying 27 items.
- Kernel function based interior-point methods for horizontal linear complementarity problems (Q394593) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- An interior-point algorithm for linear optimization based on a new kernel function (Q815161) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm (Q1689710) (← 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 kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← 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 wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function (Q2322537) (← links)
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← 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)
- A new and efficient large-update interior-point method for linear optimization (Q2773659) (← links)
- A path following interior-point algorithm for semidefinite optimization problem based on new kernel function (Q2816534) (← links)
- An eligible kernel based primal-dual interior-point method for linear optimization (Q2869036) (← links)
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming (Q3368128) (← links)
- (Q3454068) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935) (← links)
- (Q4926644) (← links)
- AN ELIGIBLE PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION (Q5747057) (← links)
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798) (← links)