Day 1, April 14 - Presentations

Start Date

14-4-2020 1:00 PM

End Date

14-4-2020 3:00 PM

Publisher

University of Tennessee at Chattanooga

Place of Publication

Chattanooga (Tenn.)

Abstract

A block principal pivoting algorithm for the vertical generalized linear complementarity problem (VGLCP) associated with a vertical block P-matrix is provided. A preliminary result shows that it is very efficient when applied to large scaled problems as it reduces the number of iterations needed to solve the VGLCP when compared to other direct algorithms.

Date

4-14-2020

Document Type

presentations

Language

English

Rights

http://rightsstatements.org/vocab/InC/1.0/

License

http://creativecommons.org/licenses/by/4.0/

Share

COinS
 
Apr 14th, 1:00 PM Apr 14th, 3:00 PM

Block Principal Pivoting Algorithm for VGLCP: A Block Principal Pivoting Algorithm for the Vertical Generalized Linear Complementarity Problem (VGLCP) with a Vertical Block P-matrix

A block principal pivoting algorithm for the vertical generalized linear complementarity problem (VGLCP) associated with a vertical block P-matrix is provided. A preliminary result shows that it is very efficient when applied to large scaled problems as it reduces the number of iterations needed to solve the VGLCP when compared to other direct algorithms.