Note on solving linear complementarity problems as jointly constrained bilinear programs
From MaRDI portal
Publication:809900
DOI10.1016/0022-247X(91)90259-3zbMATH Open0732.90083MaRDI QIDQ809900FDOQ809900
Authors: Faiz Al-Khayyal 
Publication date: 1991
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Recommendations
Linear programming (90C05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Title not available (Why is that?)
- Global Optimization Approach to the Linear Complementarity Problem
- Optimization with disjunctive constraints
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- An implicit enumeration procedure for the general linear complementarity problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Bounds for the solution set of linear complementarity problems
- Solving the linear complementarity problem through concave programming
Cited In (3)
This page was built for publication: Note on solving linear complementarity problems as jointly constrained bilinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809900)
