Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
From MaRDI portal
Publication:582015
DOI10.1016/0022-247X(89)90347-8zbMath0689.65042OpenAlexW2004250389MaRDI QIDQ582015
Publication date: 1989
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(89)90347-8
convergenceiterative algorithmsingular stochastic control problemgeneralized linear complementary problem
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10)
Related Items
Fuzzy approximation to an infeasible generalized linear complementarity problem ⋮ Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems ⋮ A result of Shepp ⋮ Projected splitting methods for vertical linear complementarity problems ⋮ Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems ⋮ A modulus-based formulation for the vertical linear complementarity problem ⋮ Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations ⋮ A uniqueness theorem for the generalized-order linear complementary problem associated with \(M\)-matrices ⋮ A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A modulus-based matrix splitting method for the vertical nonlinear complementarity problem ⋮ Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem ⋮ A class of modulus-based matrix splitting methods for vertical linear complementarity problem ⋮ A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ The role of representative submatrices in vertical linear complementarity theory ⋮ An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix ⋮ Acceptable solutions and backward errors for tensor complementarity problems ⋮ The generalized linear complementarity problem revisited ⋮ Generalized linear complementarity in a problem of \(n\)-person games ⋮ A two-step parallel iteration method for large sparse horizontal linear complementarity problems ⋮ The implicit general order complementarity problem, models and iterative methods ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- Singular control problems in bounded intervals
- Singular Stochastic Control Problems Solved by a Sparse Simplex Method
- A generalization of the linear complementarity problem
- The Relaxation Method for Linear Inequalities
