Pages that link to "Item:Q2340161"
From MaRDI portal
The following pages link to Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161):
Displaying 19 items.
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← 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)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- Kernel technology to solve discrete optimization problems (Q1699399) (← links)
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← 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)
- An eligible kernel based primal-dual interior-point method for linear optimization (Q2869036) (← links)
- A new kernel function and its related properties for second-order cone optimization (Q2888010) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- A polynomial-time algorithm for linear optimization based on a new simple kernel function (Q4650623) (← links)
- (Q4926644) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)
- AN ELIGIBLE PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION (Q5747057) (← 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)
