Pages that link to "Item:Q1174838"
From MaRDI portal
The following pages link to A class of linear complementarity problems solvable in polynomial time (Q1174838):
Displayed 13 items.
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds (Q1369047) (← links)
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625) (← links)