Pages that link to "Item:Q1848379"
From MaRDI portal
The following pages link to A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379):
Displayed 7 items.
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← 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)
- An interior point method for linear programming based on a class of Kernel functions (Q4654260) (← links)