On the solution of large, structured linear complementarity problems: the block partitioned case
From MaRDI portal
(Redirected from Publication:1251591)
Cites work
- A Method of Block Iteration
- Complementary pivot theory of mathematical programming
- scientific article; zbMATH DE number 3163640 (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 3303572 (Why is no real title available?)
- scientific article; zbMATH DE number 3313523 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3103698 (Why is no real title available?)
- Iteration Methods for Nonlinear Problems
- On the solution of large, structured linear complementarity problems: the block partitioned case
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- Relaxation Methods for Convex Problems
- 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
(36)- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- 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
- A direct method for sparse least squares problems with lower and upper bounds
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- On the convergence of a basic iterative method for the implicit complementarity problem
- The solution of linear complementarity problems on an array processor
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Hidden Z-matrices with positive principal minors
- 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
- 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
- Iterations for solving linear variational inequalities on domains with nonlinear boundaries
- 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
- The adventures of a simple algorithm
- Improving projected successive overrelaxation method for linear complementarity problems
- A multisplitting method for symmetric linear complementarity problems
- General fixed-point method for solving the linear complementarity problem
- Improved convergence theorems of multisplitting methods for the linear complementarity problem
- Newton's method for linear complementarity problems
- Un critère de convergence pour des méthodes générales de point fixe
- Iterative methods for variational and complementarity problems
- Linear complementarity problems solvable by A single linear program
- On a class of least-element complementarity problems
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- The relaxation convergence of multisplitting AOR method for linear complementarity problem
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- Acceleration of the modulus-based iteration methods for solving linear complementarity problems by momentum
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- Convergence of SSOR methods for linear complementarity problems
- The obstacle problem for beams and plates
This page was built for publication: On the solution of large, structured linear complementarity problems: the block partitioned case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251591)
