On the solution of large, structured linear complementarity problems: the block partitioned case
From MaRDI portal
Publication:1251591
DOI10.1007/BF01442149zbMath0391.90087MaRDI QIDQ1251591
Gene H. Golub, Richard W. Cottle, Richard S. Sacher
Publication date: 1978
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, Improving projected successive overrelaxation method for linear complementarity problems, Iterative methods for variational and complementarity problems, Improved convergence theorems of multisplitting methods for the linear complementarity problem, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Convergence of SSOR methods for linear complementarity problems, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, An LP-based successive overrelaxation method for linear complementarity problems, General fixed-point method for solving the linear complementarity problem, The convergence of parallel iteration algorithms for linear complementarity problems, An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems, A direct method for sparse least squares problems with lower and upper bounds, Un critère de convergence pour des méthodes générales de point fixe, A multisplitting method for symmetric linear complementarity problems, A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, The obstacle problem for beams and plates, On the convergence of a basic iterative method for the implicit complementarity problem, The solution of linear complementarity problems on an array processor, Newton's method for linear complementarity problems, Linear complementarity problems solvable by A single linear program, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, On the solution of large, structured linear complementarity problems: the block partitioned case, On a class of least-element complementarity problems, Iterations for solving linear variational inequalities on domains with nonlinear boundaries, The relaxation convergence of multisplitting AOR method for linear complementarity problem, Hidden Z-matrices with positive principal minors, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, A `moving index' method for the solution of the American options valuation problem, Iterative methods for linear complementarity problems with upperbounds on primary variables, A multilevel iterative method for symmetric, positive definite linear complementarity problems, An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems, The adventures of a simple algorithm, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, Gauss-Newton methods for the complementarity problem
Cites Work
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Complementary pivot theory of mathematical programming
- A Method of Block Iteration
- Iteration Methods for Nonlinear Problems
- The solution of a quadratic programming problem using fast methods to solve systems of linear equations
- Relaxation Methods for Convex Problems
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
