The following pages link to (Q5592809):
Displayed 28 items.
- The principal pivoting method revisited (Q753692) (← links)
- Sign-solvable linear complementarity problems (Q929486) (← links)
- Bounds for the solution set of linear complementarity problems (Q1087474) (← links)
- Quadratic programming problems and related linear complementarity problems (Q1121791) (← links)
- Positive subdefinite matrices (Q1139646) (← links)
- On the parametric linear complementarity problem: A generalized solution procedure (Q1154946) (← links)
- On the solution of large, structured linear complementarity problems: The tridiagonal case (Q1245772) (← links)
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- Basic-set algorithm for a generalized linear complementarity problem (Q1321226) (← links)
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs (Q1676985) (← links)
- Total dual integrality of the linear complementarity problem (Q1730735) (← links)
- Almost \(P_ 0\)-matrices and the class \(Q\) (Q1802956) (← links)
- An example of a nonregular semimonotone \(Q\)-matrix (Q1825146) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
- Boundedness relations for linear constraint sets (Q2540811) (← links)
- Existence theory for the complex linear complementarity problem (Q2545665) (← links)
- A modified gradient method for finite element elastoplastic analysis by quadratic programming (Q2560146) (← links)
- Solution of the complex linear complementarity problem (Q2562753) (← links)
- A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps (Q2657242) (← links)
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800) (← links)
- A constructive characterization ofQ o-matrices with nonnegative principal minors (Q3755249) (← links)
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems (Q4136969) (← links)
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems (Q4139993) (← links)
- Large-scale linearly constrained optimization (Q4162963) (← links)
- The general quadratic optimization problem (Q4401736) (← links)
- Direct algorithms in quadratic programming (Q5668615) (← links)