Pages that link to "Item:Q582015"

The following pages link to Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems (Q582015):

Displaying 30 items.

• On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
• Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
• The implicit general order complementarity problem, models and iterative methods (Q1308653) (← links)
• A result of Shepp (Q1343545) (← links)
• The generalized linear complementarity problem revisited (Q1814790) (← links)
• Fuzzy approximation to an infeasible generalized linear complementarity problem (Q1885700) (← links)
• Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems (Q1888919) (← links)
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems (Q1894519) (← links)
• A uniqueness theorem for the generalized-order linear complementary problem associated with \(M\)-matrices (Q1911932) (← links)
• Acceptable solutions and backward errors for tensor complementarity problems (Q2026729) (← links)
• A two-step parallel iteration method for large sparse horizontal linear complementarity problems (Q2096344) (← links)
• Projected splitting methods for vertical linear complementarity problems (Q2139273) (← links)
• A modulus-based formulation for the vertical linear complementarity problem (Q2159423) (← links)
• Generalized linear complementarity in a problem of \(n\)-person games (Q2564339) (← links)
• A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems (Q2661692) (← links)
• Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations (Q4293291) (← links)
• The role of representative submatrices in vertical linear complementarity theory (Q4336777) (← links)
• An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix (Q4338035) (← links)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones (Q4559409) (← links)
• A modulus-based matrix splitting method for the vertical nonlinear complementarity problem (Q6046867) (← links)
• Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem (Q6073134) (← links)
• A class of modulus-based matrix splitting methods for vertical linear complementarity problem (Q6094603) (← links)
• A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems (Q6157459) (← links)
• Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems (Q6489273) (← links)
• Global Error Bounds for the Extended Vertical Linear Complementarity Problems of CKV-Type Matrices and CKV-Type $B$-Matrices (Q6492269) (← links)
• Projected fixed point iterative method for large and sparse horizontal linear complementarity problem (Q6572394) (← links)
• A two-step new modulus-based matrix splitting method for vertical linear complementarity problem (Q6586917) (← links)
• The perturbation bound of the extended vertical linear complementarity problem (Q6601965) (← links)
• Scalable relaxation two-sweep modulus-based matrix splitting methods for vertical LCP (Q6636808) (← links)
• New modulus-based matrix splitting method for the vertical nonlinear complementarity problem (Q6653496) (← links)