Pages that link to "Item:Q1251591"

The following pages link to On the solution of large, structured linear complementarity problems: the block partitioned case (Q1251591):

Displaying 35 items.

• Improved convergence theorems of multisplitting methods for the linear complementarity problem (Q280082) (← links)
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
• A multilevel iterative method for symmetric, positive definite linear complementarity problems (Q794138) (← links)
• Convergence of SSOR methods for linear complementarity problems (Q833585) (← links)
• The obstacle problem for beams and plates (Q912692) (← links)
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems (Q1064037) (← links)
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068) (← links)
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
• An LP-based successive overrelaxation method for linear complementarity problems (Q1093555) (← links)
• A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems (Q1154218) (← links)
• On the convergence of a basic iterative method for the implicit complementarity problem (Q1162935) (← links)
• The solution of linear complementarity problems on an array processor (Q1164382) (← 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)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• Gauss-Newton methods for the complementarity problem (Q1321346) (← links)
• The convergence of parallel iteration algorithms for linear complementarity problems (Q1352387) (← links)
• An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems (Q1652800) (← links)
• Iterations for solving linear variational inequalities on domains with nonlinear boundaries (Q1805014) (← links)
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem (Q1837116) (← links)
• A `moving index' method for the solution of the American options valuation problem (Q1840903) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• Improving projected successive overrelaxation method for linear complementarity problems (Q1873163) (← links)
• A multisplitting method for symmetric linear complementarity problems (Q1917824) (← links)
• General fixed-point method for solving the linear complementarity problem (Q2142788) (← links)
• Newton's method for linear complementarity problems (Q3316988) (← links)
• Un critère de convergence pour des méthodes générales de point fixe (Q3745182) (← links)
• Iterative methods for variational and complementarity problems (Q3965925) (← links)
• Linear complementarity problems solvable by A single linear program (Q4127631) (← links)
• On a class of least-element complementarity problems (Q4175066) (← links)
• Iterative methods for linear complementarity problems with upperbounds on primary variables (Q4744082) (← links)
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods (Q4780533) (← links)
• The relaxation convergence of multisplitting AOR method for linear complementarity problem (Q4965573) (← links)