Jiaping Zhu

McMaster University, Hamilton, Ontario, Canada

Are you Jiaping Zhu?

Claim your profile

Publications (2)2.2 Total impact

  • Guoshan Liu, Jane Ye, Jiaping Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: It is well known that mathematical programs with equilibrium constraints (MPEC) violate the standard constraint qualifications such as Mangasarian–Fromovitz constraint qualification (MFCQ) and hence the usual Karush–Kuhn–Tucker conditions cannot be used as stationary conditions unless relatively strong assumptions are satisfied. This observation has led to a number of weaker stationary conditions, with Mordukhovich stationary (M-stationary) condition being the strongest among the weaker conditions. In nonlinear programming, it is known that MFCQ leads to an exact penalization. In this paper we show that MPEC GMFCQ, an MPEC variant of MFCQ, leads to a partial exact penalty where all the constraints except a simple linear complementarity constraint are moved to the objective function. The partial exact penalty function, however, is nonsmooth. By smoothing the partial exact penalty function, we design an algorithm which is shown to be globally convergent to an M-stationary point under an extended version of the MPEC GMFCQ.
    Set-Valued Analysis 01/2008; 16(5):785-804. · 0.55 Impact Factor
  • Source
    Tamás Terlaky, Jiaping Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Yu and Liu’s strong duality theorem under the time-sharing property requires additionally the Slater regularity condition to hold for the considered general nonconvex problem, which is naturally satisfied for the specific application. We further extend the scope of the theorem under Ky Fan convexity, which is slightly weaker than Yu and Lui’s time-sharing property.
    Optimization Letters 01/2008; 2:497-503. · 1.65 Impact Factor

Publication Stats

51 Citations
2.20 Total Impact Points

Institutions

  • 2008
    • McMaster University
      • Department of Computing and Software
      Hamilton, Ontario, Canada