Pages that link to "Item:Q5287110"
From MaRDI portal
The following pages link to On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems (Q5287110):
Displayed 11 items.
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- 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)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds (Q1369047) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← 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 quadratically convergent scaling newton’s method for nonlinear programming problems (Q4944414) (← links)