Pages that link to "Item:Q1361107"
From MaRDI portal
The following pages link to Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107):
Displaying 13 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
- A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
- On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)
