Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/71844
Type: Artigo de periódico
Title: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
Author: Fernandes, L
Friedlander, A
Guedes, M
Judice, J
Abstract: This paper addresses a General Linear Complementarity Problem (GLCP) that has found applications in global optimization. It is shown that a solution of the GLCP can be computed by finding a stationary point of a differentiable function over a set defined by simple bounds on the variables. The application of this result to the solution of bilinear programs and LCPs is discussed. Some computational evidence of its usefulness is included in the last part of the paper.
Subject: global optimization
linear complementarity problems
bilinear programming
box constrained optimization
Country: EUA
Editor: Springer-verlag
Rights: fechado
Identifier DOI: 10.1007/s002450010021
Date Issue: 2001
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000166125000001.pdf158.96 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.