AN INTERIOR-POINT METHOD FOR MPECs BASED ON STRICTLY FEASIBLE RELAXATIONS
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 of creation:||Apr 2004|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://portal.uc3m.es/portal/page/portal/dpto_estadistica
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws042408. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.