Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
Discretization of the Hamilton-Jacobi-Bellman equations of control theory leads to a generalized linear complementary problem (GLCP) of the form \(A_ jx+q_ j\geq 0,\) \(j=1,2,...,m,\) \(\min \{A_ jx+q_ j*\quad j=1,2,...,m\}=0.\) The author extend \textit{O. L. Mangasarian}'s iterative algorithm [J. Optimization Theory Appl. 22, 465-485 (1977; Zbl 0341.65049)] for linear complementarity problems to GLCP. He imposes some additional conditions on the initial point \(x_ 0\) in order to get the monotonicity of the subsequent iterates. As a consequence of the monotonicity the convergence of the method is obtained. The algorithm has been tested on a singular stochastic control problem.
- 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
- A generalization of the linear complementarity problem
- scientific article; zbMATH DE number 3670172 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- 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
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- The Relaxation Method for Linear Inequalities
- Strict monotonicity in Todd's low-complexity algorithm for linear programming
- The implicit general order complementarity problem, models and iterative methods
- A result of Shepp
- The generalized linear complementarity problem revisited
- Fuzzy approximation to an infeasible generalized linear complementarity problem
- Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- A uniqueness theorem for the generalized-order linear complementary problem associated with M-matrices
- Acceptable solutions and backward errors for tensor complementarity problems
- A two-step parallel iteration method for large sparse horizontal linear complementarity problems
- Projected splitting methods for vertical linear complementarity problems
- A modulus-based formulation for the vertical linear complementarity problem
- Generalized linear complementarity in a problem of \(n\)-person games
- A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations
- 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
- Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
- 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
- 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
- Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
- A two-step new modulus-based matrix splitting method for vertical linear complementarity problem
- The perturbation bound of the extended vertical linear complementarity problem
- Scalable relaxation two-sweep modulus-based matrix splitting methods for vertical LCP
- New modulus-based matrix splitting method for the vertical nonlinear complementarity problem
- Vertical linear complementarity problem via the new modulus-based matrix splitting method
- On the two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- The projected-type method for the extended vertical linear complementarity problem revisited
- An inner-outer modulus-based method for solving horizontal linear complementarity problems
- Projected Jacobi method for vertical tensor complementarity problems
- Accelerated modulus-based synchronous multisplitting iteration method for horizontal linear complementarity problems
- Vertical block matrices and vertical linear complementarity problem
- Greedy randomized-type methods for vertical tensor complementarity problem
- A modulus-based matrix splitting iterative method for a class of vertical linear complementarity problems
- A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
- A parallel iteration method based on two-stage multisplitting for solving horizontal linear complementarity problems
- On the finite termination of an entropy function based non-interior continuation method for vertical 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)