Basic-set algorithm for a generalized linear complementarity problem

DOI10.1007/BF00940317MaRDI QIDQ1321226zbMATH OpenOpenAlexFDO

Authors F. M. Pires, Joaquim J. 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

large-scale problemslinear complementarityprincipal pivotingsparse matricesunsymmetric \(P\)-matrix

Mathematics Subject Classification ID

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

Cites work

• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
• An Identity for the Schur Complement of a Matrix
• Application of disjunctive programming to the linear complementarity problem
• Contact problems for the elastic beam
• Direct Methods for Solving Sparse Systems of Linear Equations
• scientific article; zbMATH DE number 3112812 (Why is no real title available?)
• scientific article; zbMATH DE number 4147877 (Why is no real title available?)
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3679088 (Why is no real title available?)
• scientific article; zbMATH DE number 42384 (Why is no real title available?)
• scientific article; zbMATH DE number 3562346 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3312380 (Why is no real title available?)
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Manifestations of the Schur complement
• Minkowski matrices.
• 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
• Sparse matrix factor modification in structural reanalysis
• Triangular factors of modified matrices

Cited in

(6)

• 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
• A new principal pivoting scheme for box linear complementarity problems
• scientific article; zbMATH DE number 432996 (Why is no real title available?)
• scientific article; zbMATH DE number 4147877 (Why is no real title available?)
• An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321226)