Pages that link to "Item:Q4127631"
From MaRDI portal
The following pages link to Linear complementarity problems solvable by A single linear program (Q4127631):
Displaying 12 items.
- Iterative algorithms for the linear complementarity problem (Q3800997) (← links)
- Iterative methods for variational and complementarity problems (Q3965925) (← links)
- A note on an open problem in linear complementarity (Q4145417) (← links)
- On a class of least-element complementarity problems (Q4175066) (← links)
- An algorithm for the linear complementarity problem (Q4184202) (← links)
- Picard splitting method and Picard CG method for solving the absolute value equation (Q4631319) (← links)
- Foreword: special issue for the 70th birthday of professor Olvi Mangasarian (Q4657700) (← links)
- On Solving Mean Payoff Games Using Pivoting Algorithms (Q4689394) (← links)
- More on hidden <i>Z</i>-matrices and linear complementarity problem (Q5858717) (← links)
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem (Q5965390) (← links)
- Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities (Q6101123) (← links)
- Continuous Selections of Solutions to Parametric Variational Inequalities (Q6195314) (← links)