Pages that link to "Item:Q1245772"
From MaRDI portal
The following pages link to On the solution of large, structured linear complementarity problems: The tridiagonal case (Q1245772):
Displaying 24 items.
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
- Variational inequalities and the pricing of American options (Q751451) (← links)
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (Q781116) (← links)
- A multilevel iterative method for symmetric, positive definite linear complementarity problems (Q794138) (← links)
- Convergence of SSOR methods for linear complementarity problems (Q833585) (← links)
- Estimating ordered parameters by linear programming (Q928896) (← links)
- A multiplicative multisplitting method for solving the linear complementarity problem (Q979813) (← links)
- Convex spline interpolants with minimal curvature (Q1058257) (← links)
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems (Q1064037) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- On tridiagonal linear complementarity problems (Q1095609) (← links)
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems (Q1154218) (← links)
- Matrices and the linear complementarity problem (Q1154944) (← links)
- On the solution of large, structured linear complementarity problems: the block partitioned case (Q1251591) (← links)
- Hidden Z-matrices with positive principal minors (Q1260088) (← links)
- An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems (Q1652800) (← links)
- Tridiagonal matrices with dominant diagonals and applications (Q1785752) (← links)
- Improving projected successive overrelaxation method for linear complementarity problems (Q1873163) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- The reduced order method for solving the linear complementarity problem with an \(M\)-matrix (Q2172919) (← links)
- AN ENCLOSURE METHOD FOR FREE BOUNDARY PROBLEMS BASED ON A LINEAR COMPLEMENTARITY PROBLEM WITH INTERVAL DATA<sup>*</sup> (Q2785249) (← links)
- Newton's method for linear complementarity problems (Q3316988) (← links)
- Linear complementarity problems solvable by A single linear program (Q4127631) (← links)
- Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems (Q5094717) (← links)