On the solution and complexity of a generalized linear complementarity problem

DOI10.1007/BF01099266zbMath0801.90107WikidataQ58040701 ScholiaQ58040701MaRDI QIDQ1327430

Joaquim Joao Júdice, Luis Nunes Vicente

Publication date: 19 June 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationNP-hardpolynomial complexitygeneralized linear complementarity

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints, Algorithms for linear programming with linear complementarity constraints, Optimal cycle for a signalized intersection using global optimization and complementarity, On the solution of NP-hard linear complementarity problems, On the convergence of the block principal pivotal algorithm for the LCP, On the equivalence of linear complementarity problems

Cites Work

• Unnamed Item
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• NP-completeness of the linear complementarity problem
• Constrained global optimization: algorithms and applications
• Sufficient matrices and the linear complementarity problem
• A class of linear complementarity problems solvable in polynomial time
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Maximization of A convex quadratic function under linear constraints