The linear complementarity problem as a separable bilinear program
DOI10.1007/BF01096765zbMATH Open0835.90102OpenAlexW2009901815MaRDI QIDQ1804582FDOQ1804582
Publication date: 15 May 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01096765
Recommendations
bilinear programseparable constraintsknapsack feasibility problemnonmonotone linear complementarity problem
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- New improved error bounds for the linear complementarity problem
- Title not available (Why is that?)
- Introduction to global optimization
- Bilinear separation of two sets in \(n\)-space
- Title not available (Why is that?)
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- NP-completeness of the linear complementarity problem
- Title not available (Why is that?)
- Inexact Newton methods for the nonlinear complementarity problem
- Nonlinear programming problems with stochastic objective functions
- Title not available (Why is that?)
- The Extended Linear Complementarity Problem
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
- Solving the Linear Complementarity Problem in Circuit Simulation
Cited In (24)
- Title not available (Why is that?)
- On the solution of NP-hard linear complementarity problems
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- Absolute value equations
- Absolute value programming
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- Residual iterative method for solving absolute value equations
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- On characterizing linear complementarity problems as linear programs
- Generalized AOR method for solving absolute complementarity problems
- Merit functions for absolute value variational inequalities
- Title not available (Why is that?)
- Novel algorithms for solving a system of absolute value variational inequalities
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems
- Arbitrary-norm separating plane
- On an iterative method for solving absolute value equations
- Algorithms for linear programming with linear complementarity constraints
- Robust approach for air cargo freight forwarder selection under disruption
- Promoting symmetric weight selection in data envelopment analysis: a penalty function approach
- Convergence of SSOR methods for linear complementarity problems
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
Uses Software
This page was built for publication: The linear complementarity problem as a separable bilinear program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804582)
