Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
DOI10.1016/0022-247X(89)90347-8zbMATH Open0689.65042OpenAlexW2004250389MaRDI QIDQ582015FDOQ582015
Authors: M. Sun 
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
Recommendations
- Generalized Linear Complementarity Problems
- Iterative methods for a class of complementarity problems
- A non-interior continuation method for generalized linear complementarity problems
- Monotonic iterative algorithms for a quasicomplementarity problem
- Nonlinear mappings associated with the generalized linear complementarity problem
iterative algorithmconvergencesingular stochastic control problemgeneralized linear complementary problem
Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- The Relaxation Method for Linear Inequalities
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- A generalization of the linear complementarity problem
- On the convergence of a basic iterative method for the implicit complementarity problem
- Singular control problems in bounded intervals
- Singular Stochastic Control Problems Solved by a Sparse Simplex Method
- Title not available (Why is that?)
Cited In (30)
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
- A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems
- A uniqueness theorem for the generalized-order linear complementary problem associated with \(M\)-matrices
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
- Fuzzy approximation to an infeasible generalized linear complementarity problem
- Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems
- A modulus-based matrix splitting method for the vertical nonlinear complementarity problem
- A class of modulus-based matrix splitting methods for vertical linear complementarity problem
- The role of representative submatrices in vertical linear complementarity theory
- Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations
- A result of Shepp
- A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Acceptable solutions and backward errors for tensor complementarity problems
- An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix
- Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem
- Generalized linear complementarity in a problem of \(n\)-person games
- The implicit general order complementarity problem, models and iterative methods
- Scalable relaxation two-sweep modulus-based matrix splitting methods for vertical LCP
- Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems
- Global Error Bounds for the Extended Vertical Linear Complementarity Problems of CKV-Type Matrices and CKV-Type $B$-Matrices
- New modulus-based matrix splitting method for the vertical nonlinear complementarity problem
- Strict monotonicity in Todd's low-complexity algorithm for linear programming
- The generalized linear complementarity problem revisited
- Projected splitting methods for vertical linear complementarity problems
- A modulus-based formulation for the vertical linear complementarity problem
- The perturbation bound of the extended vertical linear complementarity problem
- A two-step new modulus-based matrix splitting method for vertical linear complementarity problem
- A two-step parallel iteration method for large sparse horizontal linear complementarity problems
This page was built for publication: Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582015)
