A note on a quadratic formulation for linear complementarity problems |
| |
Authors: | S. Gupta P. M. Pardalos |
| |
Affiliation: | (1) Computer Science Department, Pennsylvania State University, University Park, Pennsylvania |
| |
Abstract: | In this note, we discuss some properties of a quadratic formulation for linear complementarity problems. Projected SOR methods proposed by Mangasarian apply to symmetric matrices only. The quadratic formulation discussed here makes it possible to use these SOR methods for solving nonsymmetric LCPs. SOR schemes based on this formulation preserve sparsity. For proper choice of a free parameter, this quadratic formulation also preserves convexity. The value of the quadratic function for the solution of original LCP is also known. |
| |
Keywords: | Linear complementarity problems quadratic programming |
本文献已被 SpringerLink 等数据库收录! |