The linear complementarity problem as a separable bilinear program

DOI10.1007/BF01096765zbMath0835.90102OpenAlexW2009901815MaRDI QIDQ1804582

Olvi L. Mangasarian

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

zbMATH Keywords

bilinear programseparable constraintsknapsack feasibility problemnonmonotone linear complementarity problem

Mathematics Subject Classification ID

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

Related Items (18)

Convergence of SSOR methods for linear complementarity problems ⋮ Novel algorithms for solving a system of absolute value variational inequalities ⋮ Merit functions for absolute value variational inequalities ⋮ Promoting symmetric weight selection in data envelopment analysis: a penalty function approach ⋮ Absolute value equations ⋮ Absolute value programming ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Residual iterative method for solving absolute value equations ⋮ Robust approach for air cargo freight forwarder selection under disruption ⋮ Generalized AOR method for solving absolute complementarity problems ⋮ On an iterative method for solving absolute value equations ⋮ On the solution of NP-hard linear complementarity problems ⋮ Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ Knapsack feasibility as an absolute value equation solvable by successive linear programming ⋮ Enumeration approach for linear complementarity problems based on a reformulation-linearization technique ⋮ Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems ⋮ Arbitrary-norm separating plane

Uses Software

• Matlab
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-completeness of the linear complementarity problem
• Bilinear separation of two sets in \(n\)-space
• New improved error bounds for the linear complementarity problem
• Introduction to global optimization
• Nonlinear Programming Problems with Stochastic Objective Functions
• Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• Solving the Linear Complementarity Problem in Circuit Simulation
• Inexact Newton methods for the nonlinear complementarity problem
• The Extended Linear Complementarity Problem

This page was built for publication: The linear complementarity problem as a separable bilinear program