Pages that link to "Item:Q2506182"
From MaRDI portal
The following pages link to The complexity of self-regular proximity based infeasible IPMs (Q2506182):
Displaying 6 items.
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
