IDEAS home Printed from
   My bibliography  Save this article

On merit functions for p-order cone complementarity problem


  • Xin-He Miao

    () (Tianjin University)

  • Yu-Lin Chang

    () (National Taiwan Normal University)

  • Jein-Shan Chen

    () (National Taiwan Normal University)


Abstract Merit function approach is a popular method to deal with complementarity problems, in which the complementarity problem is recast as an unconstrained minimization via merit function or complementarity function. In this paper, for the complementarity problem associated with p-order cone, which is a type of nonsymmetric cone complementarity problem, we show the readers how to construct merit functions for solving p-order cone complementarity problem. In addition, we study the conditions under which the level sets of the corresponding merit functions are bounded, and we also assert that these merit functions provide an error bound for the p-order cone complementarity problem. These results build up a theoretical basis for the merit method for solving p-order cone complementarity problem.

Suggested Citation

  • Xin-He Miao & Yu-Lin Chang & Jein-Shan Chen, 2017. "On merit functions for p-order cone complementarity problem," Computational Optimization and Applications, Springer, vol. 67(1), pages 155-173, May.
  • Handle: RePEc:spr:coopap:v:67:y:2017:i:1:d:10.1007_s10589-016-9889-y
    DOI: 10.1007/s10589-016-9889-y

    Download full text from publisher

    File URL:
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Jein-Shan Chen, 2006. "Two classes of merit functions for the second-order cone complementarity problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(3), pages 495-519, December.
    2. Defeng Sun & Jie Sun, 2008. "Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 421-445, May.
    3. repec:spr:compst:v:64:y:2006:i:3:p:495-519 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:joptap:v:173:y:2017:i:3:d:10.1007_s10957-017-1102-7 is not listed on IDEAS


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:67:y:2017:i:1:d:10.1007_s10589-016-9889-y. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.