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):
Displaying 21 items.
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← 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)
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM (Q3202145) (← links)
- (Q4323620) (← 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)
- Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
- A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)
- A Jordan-algebraic approach to potential-reduction algorithms (Q5957309) (← links)
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game (Q6049293) (← links)
- Log-domain interior-point methods for convex quadratic programming (Q6164958) (← links)
