Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/241511
Type: Artigo de periódico
Title: Feasibility Problems With Complementarity Constraints
Author: Andreani
R.; Judice
J. J.; Martinez
J. M.; Martini
T.
Abstract: A Projected-Gradient Underdetermined Newton-like algorithm will be introduced for finding a solution of a Horizontal Nonlinear Complementarity Problem (HNCP) corresponding to a feasible solution of a Mathematical Programming Problem with Complementarity Constraints (MPCC). The algorithm employs a combination of Interior-Point Newton-like and Projected-Gradient directions with a line-search procedure that guarantees global convergence to a solution of HNCP or, at least, a stationary point of the natural merit function associated to this problem. Fast local convergence will be established under reasonable assumptions. The new algorithm can be applied to the computation of a feasible solution of MPCC with a target objective function value. Computational experience on test problems from well-known sources will illustrate the efficiency of the algorithm to find feasible solutions of MPCC in practice. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Subject: Active-set Algorithm
Mathematical Programs
Equilibrium Constraints
Electricity Markets
Nonlinear Equations
Global Convergence
Elastic-mode
Optimization
Networks
Reformulation
Country: AMSTERDAM
Editor: ELSEVIER SCIENCE BV
Rights: embargo
Identifier DOI: 10.1016/j.ejor.2015.09.030
Address: http://www.sciencedirect.com/science/article/pii/S0377221715008723
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
wos_000366536400004.pdf473.89 kBAdobe PDFView/Open


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