Pages that link to "Item:Q4697311"
From MaRDI portal
The following pages link to A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming (Q4697311):
Displaying 10 items.
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
