A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
type: Item
instance of: scholarly article
title: A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
zbMATH Open document ID: 1482.90223
author: Aniekan A. Ebiefung
author: L. Fernandes
author: Michael M. Kostreva
author: Joaquim J. Júdice
published in: Journal of Computational and Applied Mathematics
publication date: 2021-12-14T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 15A30
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 7444666
zbMATH Keywords: complementarity problems
zbMATH Keywords: classes of matrices
zbMATH Keywords: direct algorithms
describes a project that uses: Matlab
describes a project that uses: MatrixMarket
MaRDI profile type: Publication
full work available at URL: j.cam.2021.113913
OpenAlex ID: W3211918308
cites work: A generalization of the linear complementarity problem
cites work: The generalized linear complementarity problem and an algorithm to find all its solutions
cites work: Production equilibrium point in multi-unit manufacturing systems and the vertical linear complementarity problem
cites work: Solution of parametric vertical block linear complementarity problems
cites work: A support submatrix for the generalized linear complementarity problem
cites work: Nonlinear mappings associated with the generalized linear complementarity problem
cites work: The vertical linear complementarity problem associated withPo-matrices
cites work: Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem: Revisited
cites work: Existence and uniqueness of solutions for the generalized linear complementarity problem
cites work: Vertical Block Hidden Z-Matrices And The Generalized Linear Complementarity Problem
cites work: The generalized linear complementarity problem revisited
cites work: Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
cites work: A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem
cites work: The extended linear complementarity problem
cites work: An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix
cites work: On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
cites work: A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
cites work: Q4039868
cites work: Q4003375
cites work: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
cites work: An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
cites work: A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
cites work: A block active set algorithm for large-scale quadratic programming with box constraints
cites work: A family of second-order methods for convex \(\ell _1\)-regularized optimization
cites work: A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
cites work: Splitting methods for the Eigenvalue Complementarity Problem
DOI: 10.1016/J.CAM.2021.113913
description: scientific article; zbMATH DE number 7444666