An implicit enumeration procedure for the general linear complementarity problem
From MaRDI portal
Publication:3762094
DOI10.1007/BFb0121176zbMath0623.90079OpenAlexW18242230MaRDI QIDQ3762094
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121176
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Deterministic methods in constrained global optimization: Some recent advances and new fields of application, Descent approaches for quadratic bilevel programming, Bilevel linear programming, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, Enumerative techniques for solving some nonconvex global optimization problems, An experimental investigation of enumerative methods for the linear complementarity problem, Solving non-monotone equilibrium problems via a DIRECT-type approach, An enumerative method for the solution of linear complementarity problems, On characterizing linear complementarity problems as linear programs, An abstract model for branch-and-cut, Algorithms for linear programming with linear complementarity constraints, Enumeration-based approach to solving parametric linear complementarity problems, A high accuracy method for solving ODEs with discontinuous right-hand side, Jointly constrained bilinear programs and related problems: An overview, Numerical simulation of piecewise-linear models of gene regulatory networks using complementarity systems, Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\), A sequential LCP method for bilevel linear programming, Hybrid evolutionary algorithm for solving general variational inequality problems, An RLT approach for solving the binary-constrained mixed linear complementarity problem, On the solution of NP-hard linear complementarity problems, POST-BUCKLING ANALYSIS WITH FRICTIONAL CONTACTS COMBINING COMPLEMENTARITY RELATIONS AND AN ARC-LENGTH METHOD, The generalized linear complementarity problem and an algorithm to find all its solutions, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Enhanced intersection cutting-plane approach for linear complementarity problems, Note on solving linear complementarity problems as jointly constrained bilinear programs
