An interior-point method for mpecs based on strictly feasible relaxations
Angel Víctor de Miguel,
Michael P. Friedlander and
Stefan Scholtes
DES - Working Papers. Statistics and Econometrics. WS from Universidad Carlos III de Madrid. Departamento de EstadÃstica
Abstract:
An interior-point method for solving mathematical programs with equilibrium constraints (MPECs) is proposed. At each iteration of the algorithm, a single primaldual step is computed from each subproblem of a sequence. Each subproblem is defined as a relaxation of the MPEC with a nonempty strictly feasible region. In contrast to previous approaches, the proposed relaxation scheme preserves the nonempty strict feasibility of each subproblem even in the limit. Local and superlinear convergence of the algorithm is proved even with a less restrictive strict complementarity condition than the standard one. Moreover, mechanisms for inducing global convergence in practice are proposed. Numerical results on the MacMPEC test problem set demonstrate the fast-local convergence properties of the algorithm.
Date: 2004-04
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://e-archivo.uc3m.es/rest/api/core/bitstreams ... 2524d71e8ac0/content (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:cte:wsrepe:ws042408
Access Statistics for this paper
More papers in DES - Working Papers. Statistics and Econometrics. WS from Universidad Carlos III de Madrid. Departamento de EstadÃstica
Bibliographic data for series maintained by Ana Poveda ().