On the solution of NP-hard linear complementarity problems
From MaRDI portal
Recommendations
- NP-completeness of the linear complementarity problem
- On the solution and complexity of a generalized linear complementarity problem
- On the Solution Sets of Linear Complementarity Problems
- Publication:5753757
- On the solution of the extended linear complementarity problem
- On linear problems with complementarity constraints
- On the extended linear complementarity problem
- On the equivalence of linear complementarity problems
- A class of linear complementarity problems solvable in polynomial time
- On the solution of nonlinear complementarity problems
Cites work
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 1186888 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1552029 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- A cutting plane algorithm for solving bilinear programs
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An experimental investigation of enumerative methods for the linear complementarity problem
- An implicit enumeration procedure for the general linear complementarity problem
- An interior-point algorithm for nonconvex nonlinear programming
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Introduction to global optimization
- NP-completeness of the linear complementarity problem
- Numerical Optimization
- On the complexity of finding stationary points of nonconvex quadratic programs
- On the solution and complexity of a generalized linear complementarity problem
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- The linear complementarity problem as a separable bilinear program
- Two-Level Linear Programming
Cited in
(18)- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- An enumerative method for the solution of linear complementarity problems
- On solving linear complementarity problems by DC programming and DCA
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Conic approximation to quadratic optimization with linear complementarity constraints
- Multi-period near-equilibrium in a pool-based electricity market including on/off decisions
- Electricity market near-equilibrium under locational marginal pricing and minimum profit conditions
- An experimental investigation of enumerative methods for the linear complementarity problem
- scientific article; zbMATH DE number 778140 (Why is no real title available?)
- On the computational hardness based on linear fpt-reductions
- Numerical simulation of piecewise-linear models of gene regulatory networks using complementarity systems
- Optimal cycle for a signalized intersection using global optimization and complementarity
- Linear complementarity as a general solution method to combinatorial problems
- The eigenvalue complementarity problem
- NP-completeness of the linear complementarity problem
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems
- Copositivity tests based on the linear complementarity problem
This page was built for publication: On the solution of NP-hard linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699514)
