On the solution of NP-hard linear complementarity problems

DOI10.1007/BF02578944zbMath1006.90082MaRDI QIDQ699514

Ana M. Faustino, Isabel Martins Ribeiro, Joaquim Joao Júdice

Publication date: 24 September 2002

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

global optimizationmathematical programmingcomplementarityenumerative algorithms

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (12)

The eigenvalue complementarity problem ⋮ A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints ⋮ Electricity market near-equilibrium under locational marginal pricing and minimum profit conditions ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Optimal cycle for a signalized intersection using global optimization and complementarity ⋮ Numerical simulation of piecewise-linear models of gene regulatory networks using complementarity systems ⋮ Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem ⋮ Copositivity tests based on the linear complementarity problem ⋮ Multi-period near-equilibrium in a pool-based electricity market including on/off decisions

Uses Software

• OSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-completeness of the linear complementarity problem
• An experimental investigation of enumerative methods for the linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• On the complexity of finding stationary points of nonconvex quadratic programs
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• An interior-point algorithm for nonconvex nonlinear programming
• On the solution and complexity of a generalized linear complementarity problem
• A primal-dual trust-region algorithm for non-convex nonlinear programming
• The linear complementarity problem as a separable bilinear program
• Introduction to global optimization
• An implicit enumeration procedure for the general linear complementarity problem
• A cutting plane algorithm for solving bilinear programs
• Numerical Optimization
• Two-Level Linear Programming
• Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP

This page was built for publication: On the solution of NP-hard linear complementarity problems