Pages that link to "Item:Q6107947"
From MaRDI portal
The following pages link to Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term (Q6107947):
Displaying 11 items.
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound (Q2038473) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← links)
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function (Q4308551) (← links)
- (Q5085900) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)