scientific article; zbMATH DE number 7489165

zbMath1482.90245MaRDI QIDQ5061832

No author found.

Publication date: 14 March 2022

Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/2399

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear complementarity probleminterior point algorithmgeneralized positive subdefinite matrices (GPSBD)weak generalized positive subdefinite matrices (WGPSBD)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Interior-point methods (90C51)

Related Items (1)

More on matrix splitting modulus-based iterative methods for solving linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• An interior point potential reduction algorithm for the linear complementarity problem
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• On weak generalized positive subdefinite matrices and the linear complementarity problem
• A Centered Projective Algorithm for Linear Programming
• A convergent criss-cross method
• Computational complexity of LCPs associated with positive definite symmetric matrices
• Polynomial algorithms in linear programming
• Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
• Some Properties of Generalized Positive Subdefinite Matrices
• Subdefinite Matrices and Quadratic Forms

This page was built for publication: