Pages that link to "Item:Q1176569"
From MaRDI portal
The following pages link to An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569):
Displayed 9 items.
- A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)