Basic-set algorithm for a generalized linear complementarity problem

DOI10.1007/BF00940317zbMath0795.90074OpenAlexW2053030156MaRDI QIDQ1321226

F. M. Pires, Joaquim Joao Júdice

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940317

zbMATH Keywords

linear complementaritysparse matriceslarge-scale problemsprincipal pivotingunsymmetric \(P\)-matrix

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems ⋮ On the convergence of the block principal pivotal algorithm for the LCP ⋮ A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
• Manifestations of the Schur complement
• Triangular factors of modified matrices
• Direct Methods for Solving Sparse Systems of Linear Equations
• Sparse matrix factor modification in structural reanalysis
• Minkowski matrices.
• A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• Contact problems for the elastic beam
• On a class of least-element complementarity problems
• On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Application of disjunctive programming to the linear complementarity problem
• An Identity for the Schur Complement of a Matrix

This page was built for publication: Basic-set algorithm for a generalized linear complementarity problem