vix.ing · top · new · best · stats · spec

On Some Properties of K- type Block Matrices in the context of Complementarity Problem

2021/09/20 by A. Dutta, Ashok Kumar Das, Dutta, A. +1
Computer Science · Engineering · Mathematics · #15A39 #15B99 #90C33 #90C51 #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Optimization and Control (math.OC) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2109.09549

openalex publication_date 2021/09/20 · openalex created_date 2021/09/27 · openalex updated_date 2026/07/28

Abstract

In this article we introduce K-type block matrices which include two new classes of block matrices namely block triangular K-matrices and hidden block triangular K-matrices. We show that the solution of linear complementarity problem with K-type block matrices can be obtained by solving a linear programming problem. We show that block triangular K-matrices satisfy least element property. We prove that hidden block triangular K-matrices are Q0 and processable by Lemke's algorithm. The purpose of this article is to study properties of K-type block matrices in the context of the solution of linear complementarity problem.

Related