The linear complementarity problem as a separable bilinear program
- 1 March 1995
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 6 (2), 153-161
- https://doi.org/10.1007/bf01096765
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- New improved error bounds for the linear complementarity problemMathematical Programming, 1994
- Bilinear separation of two sets inn-spaceComputational Optimization and Applications, 1993
- Global OptimizationPublished by Springer Nature ,1993
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality ProblemSIAM Journal on Optimization, 1992
- NP-Completeness of the linear complementarity problemJournal of Optimization Theory and Applications, 1989
- Inexact Newton methods for the nonlinear complementarity problemMathematical Programming, 1986
- Solving the Linear Complementarity Problem in Circuit SimulationSIAM Journal on Control and Optimization, 1986
- POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, notwithstanding any copyright notation hereon.Published by Elsevier ,1981
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear ProgramsMathematics of Operations Research, 1979
- Nonlinear Programming Problems with Stochastic Objective FunctionsManagement Science, 1964