Article contents
Complementarity Problem and Duality Over Convex Cones
Published online by Cambridge University Press: 20 November 2018
Abstract
The complementarity problem is defined and studied for cases where the constraints involve convex cones, thus extending the real and complex complementarity problems. Special cases of the problem are equivalent to dual, linear or quadratic, programs over polyhedral cones.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1974
References
- 3
- Cited by