IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v64y2006i3p495-519.html
   My bibliography  Save this article

Two classes of merit functions for the second-order cone complementarity problem

Author

Listed:
  • Jein-Shan Chen

Abstract

Recently Tseng (Math Program 83:159–185, 1998) extended a class of merit functions, proposed by Luo and Tseng (A new class of merit functions for the nonlinear complementarity problem, in Complementarity and Variational Problems: State of the Art, pp. 204–225, 1997), for the nonlinear complementarity problem (NCP) to the semidefinite complementarity problem (SDCP) and showed several related properties. In this paper, we extend this class of merit functions to the second-order cone complementarity problem (SOCCP) and show analogous properties as in NCP and SDCP cases. In addition, we study another class of merit functions which are based on a slight modification of the aforementioned class of merit functions. Both classes of merit functions provide an error bound for the SOCCP and have bounded level sets. Copyright Springer-Verlag 2006

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:64:y:2006:i:3:p:495-519
    DOI: 10.1007/s00186-006-0098-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-006-0098-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-006-0098-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. S. H. Schmieta & F. Alizadeh, 2001. "Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 543-564, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Xin-He Miao & Shengjuan Guo & Nuo Qi & Jein-Shan Chen, 2016. "Constructions of complementarity functions and merit functions for circular cone complementarity problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 495-522, March.
    2. Shaohua Pan & Jein-Shan Chen & Sangho Kum & Yongdo Lim, 2011. "The penalized Fischer-Burmeister SOC complementarity function," Computational Optimization and Applications, Springer, vol. 49(3), pages 457-491, July.
    3. J.-S. Chen, 2007. "Conditions for Error Bounds and Bounded Level Sets of Some Merit Functions for the Second-Order Cone Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 459-473, December.
    4. Linan Qu & Shujie Zhang & Hsiung-Cheng Lin & Ning Chen & Lingling Li, 2020. "Multiobjective Reactive Power Optimization of Renewable Energy Power Plants Based on Time-and-Space Grouping Method," Energies, MDPI, vol. 13(14), pages 1-15, July.
    5. Yasushi Narushima & Nobuko Sagara & Hideho Ogasawara, 2011. "A Smoothing Newton Method with Fischer-Burmeister Function for Second-Order Cone Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 149(1), pages 79-101, April.
    6. Zijun Hao & Chieu Thanh Nguyen & Jein-Shan Chen, 2022. "An approximate lower order penalty approach for solving second-order cone linear complementarity problems," Journal of Global Optimization, Springer, vol. 83(4), pages 671-697, August.
    7. 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.
    8. Wang, Guoxin & Zhang, Jin & Zeng, Bo & Lin, Gui-Hua, 2018. "Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 437-447.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cardoso, Domingos Moreira & Vieira, Luis Almeida, 2006. "On the optimal parameter of a self-concordant barrier over a symmetric cone," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1148-1157, March.
    2. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.
    3. Lingchen Kong & Qingmin Meng, 2012. "A semismooth Newton method for nonlinear symmetric cone programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 129-145, October.
    4. G. Q. Wang & Y. Q. Bai, 2012. "A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 739-772, March.
    5. Gu, G. & Zangiabadi, M. & Roos, C., 2011. "Full Nesterov-Todd step infeasible interior-point method for symmetric optimization," European Journal of Operational Research, Elsevier, vol. 214(3), pages 473-484, November.
    6. Jian Zhang & Kecun Zhang, 2011. "Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(1), pages 75-90, February.
    7. Xiao-Hong Liu & Zheng-Hai Huang, 2009. "A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(2), pages 385-404, October.

    Corrections

    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:mathme:v:64:y:2006:i:3:p:495-519. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.