On the solution of large, structured linear complementarity problems: The tridiagonal case
From MaRDI portal
Cites work
- A Partition Theorem for Euclidean n-Space
- Complementary pivot theory of mathematical programming
- Equilibrium Points of Bimatrix Games
- scientific article; zbMATH DE number 3163640 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3284926 (Why is no real title available?)
- scientific article; zbMATH DE number 3312380 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- scientific article; zbMATH DE number 3361689 (Why is no real title available?)
- scientific article; zbMATH DE number 3103698 (Why is no real title available?)
- Monotone solutions of the parametric linear complementarity problem
- Nonlinear Programs with Positively Bounded Jacobians
- The general quadratic optimization problem
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
- THE NUMERICAL SOLUTION OF REYNOLDS‘ EQUATION FOR A JOURNAL BEARING
- The solution of a quadratic programming problem using fast methods to solve systems of linear equations
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(24)- Convex spline interpolants with minimal curvature
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- On tridiagonal linear complementarity problems
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- Matrices and the linear complementarity problem
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Hidden Z-matrices with positive principal minors
- An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
- Tridiagonal matrices with dominant diagonals and applications
- Improving projected successive overrelaxation method for linear complementarity problems
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
- The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
- AN ENCLOSURE METHOD FOR FREE BOUNDARY PROBLEMS BASED ON A LINEAR COMPLEMENTARITY PROBLEM WITH INTERVAL DATA*
- Newton's method for linear complementarity problems
- Linear complementarity problems solvable by A single linear program
- Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- Variational inequalities and the pricing of American options
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- Convergence of SSOR methods for linear complementarity problems
- Estimating ordered parameters by linear programming
- A multiplicative multisplitting method for solving the linear complementarity problem
This page was built for publication: On the solution of large, structured linear complementarity problems: The tridiagonal case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245772)
