A non-modulus linear method for solving the linear complementarity problem

DOI10.1016/J.LAA.2016.01.032zbMATH Open1333.65062OpenAlexW2285173091MaRDI QIDQ5962835FDOQ5962835

Authors Hua Zheng, Wen Li, Wei Qu 

Publication date 24 February 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2016.01.032

zbMATH Keywords

numerical examplesalgorithmsign patternlinear complementarity problemmodulus-based methodlarge sparse problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A sign-based linear method for horizontal linear complementarity problems
• The sign-based methods for solving a class of nonlinear complementarity problems
• A modified modulus method for symmetric positive-definite linear complementarity problems.
• The modulus-based nonsmooth Newton's method for solving linear complementarity problems
• Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems

Cites Work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• A modified damped Newton method for linear complementarity problems
• A nonsmooth version of Newton's method
• A path-following interior-point algorithm for linear and quadratic problems
• A preconditioned modulus-based iteration method for solving linear complementarity problems of \(H\)-matrices
• A superquadratic infeasible-interior-point method for linear complementarity problems
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• Engineering and Economic Applications of Complementarity Problems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Matrix multisplitting relaxation methods for linear complementarity problems
• Methods of conjugate gradients for solving linear systems
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Sign-solvable linear complementarity problems
• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
• The Linear Complementarity Problem
• The modulus-based nonsmooth Newton's method for solving linear complementarity problems
• Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems
• Two-step modulus-based synchronous multisplitting iteration methods for linear complementarity problems

Cited In (19)

• An improved block modulus method for diagonally dominant linear complementarity problems
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones
• Title not available (Why is no real title available?)
• General fixed-point method for solving the linear complementarity problem
• On the modulus algorithm for the linear complementarity problem.
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
• Title not available (Why is no real title available?)
• A modified modulus method for symmetric positive-definite linear complementarity problems.
• An equivalent tensor equation to the tensor complementarity problem with positive semi-definite \(Z\)-tensor
• Two modifications of the linearization method in non-linear programming
• The modulus-based nonsmooth Newton's method for solving linear complementarity problems
• A modified Broyden-like method for nonlinear complementarity problems
• A modulus-based nonmonotone line search method for nonlinear complementarity problems
• Title not available (Why is no real title available?)
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
• A modulus-based formulation for the vertical linear complementarity problem
• The sign-based methods for solving a class of nonlinear complementarity problems
• A sign-based linear method for horizontal linear complementarity problems

This page was built for publication: A non-modulus linear method for solving the linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962835)