The linear complementarity problem as a separable bilinear program
From MaRDI portal
Publication:1804582
Recommendations
Cites work
- scientific article; zbMATH DE number 3850827 (Why is no real title available?)
- scientific article; zbMATH DE number 3989108 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- Bilinear separation of two sets in \(n\)-space
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Inexact Newton methods for the nonlinear complementarity problem
- Introduction to global optimization
- NP-completeness of the linear complementarity problem
- New improved error bounds for the linear complementarity problem
- Nonlinear programming problems with stochastic objective functions
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
- Solving the Linear Complementarity Problem in Circuit Simulation
- The Extended Linear Complementarity Problem
Cited in
(24)- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- On characterizing linear complementarity problems as linear programs
- Convergence of SSOR methods for linear complementarity problems
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- Residual iterative method for solving absolute value equations
- scientific article; zbMATH DE number 4189490 (Why is no real title available?)
- On an iterative method for solving absolute value equations
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Absolute value equations
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Robust approach for air cargo freight forwarder selection under disruption
- Arbitrary-norm separating plane
- On the solution of NP-hard linear complementarity problems
- Absolute value programming
- Generalized AOR method for solving absolute complementarity problems
- Algorithms for linear programming with linear complementarity constraints
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Merit functions for absolute value variational inequalities
- Novel algorithms for solving a system of absolute value variational inequalities
- Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems
- Reformulations in Mathematical Programming: Definitions and Systematics
- scientific article; zbMATH DE number 4162659 (Why is no real title available?)
- Promoting symmetric weight selection in data envelopment analysis: a penalty function approach
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)
