Note on solving linear complementarity problems as jointly constrained bilinear programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- An implicit enumeration procedure for the general linear complementarity problem
- Bounds for the solution set of linear complementarity problems
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Global Optimization Approach to the Linear Complementarity Problem
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Optimization with disjunctive constraints
- 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)