QPCOMP : A quadratic programming based solver for mixed complementarity problems

Fecha:	1997
Resumen:	QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on the NE/SQP method of Pang and Gabriel, this algorithm represents a significant advance in robustness at no cost in efficiency. In particular, the algorithm is shown to solve any solvable Lipschitz continuous, continuously differentiable, pseudo-monotone mixed nonlinear complementarity problem. QPCOMP also extends the NE/SQP method for the nonlinear complementarity problem to the more general mixed nonlinear complementarity problem. Computational results are provided, which demonstrate the effectiveness of the algorithm. .
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Materia:	Complementarity problems ; Variational inequalities ; Proximal perturbations ; Pseudomonotonicity
Publicado en:	Mathematical Programming, vol. 76 n. 3 (1997) p. 533-562, ISSN 0025-5610

30 p, 1.4 MB

Acceso restringido a la UAB

Registro creado el 2006-03-13, última modificación el 2023-06-03