Interval relaxation method for linear complementarity problem

DOI10.1007/978-3-642-22833-9_79MaRDI QIDQ2838727zbMATH OpenOpenAlexFDO

Authors Juan Jiang

Publication date 10 July 2013

Published in Advances in Intelligent and Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22833-9_79

zbMATH Keywords

convergencenumerical resultsalgorithmlinear complementarity problemsinterval arithmeticiterative method\(H\)-matrixinterval relaxation method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interval and finite arithmetic (65G30)

Recommendations

• An interval method of linear complementarity problems for H-matrices
• A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
• An interval iterative method for the P₀ matrix linear complementarity problem
• A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
• An interval method for a class of linear complementary problems

Cited in

(5)

• scientific article; zbMATH DE number 4016054 (Why is no real title available?)
• An interval method of linear complementarity problems for H-matrices
• An interval iterative method for the P₀ matrix linear complementarity problem
• Enclosing solutions of linear complementarity problems for H-matrices
• scientific article; zbMATH DE number 2068450 (Why is no real title available?)

This page was built for publication: Interval relaxation method for linear complementarity problem

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