IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i5p690-d1596021.html
   My bibliography  Save this article

Completely Smooth Lower-Order Penalty Approach for Solving Second-Order Cone Mixed Complementarity Problems

Author

Listed:
  • Qiong Wu

    (School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China)

  • Zijun Hao

    (School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China)

Abstract

In this paper, a completely smooth lower-order penalty method for solving a second-order cone mixed complementarity problem (SOCMCP) is studied. Four distinct types of smoothing functions are taken into account. According to this method, SOCMCP is approximated by asymptotically completely smooth lower-order penalty equations (CSLOPEs), which includes penalty and smoothing parameters. Under mild assumptions, the main results show that as the penalty parameter approaches positive infinity and the smooth parameter monotonically decreases to zero, the solution sequence of asymptotic CSLOPEs converges exponentially to the solution of SOCMCP. An algorithm based on this approach is developed, and numerical experiments demonstrate its feasibility. The performance profile of four specific smooth functions is given. The final results show that the numerical performance of CSLOPEs is better than that of a smooth-like lower-order penalty method.

Suggested Citation

  • Qiong Wu & Zijun Hao, 2025. "Completely Smooth Lower-Order Penalty Approach for Solving Second-Order Cone Mixed Complementarity Problems," Mathematics, MDPI, vol. 13(5), pages 1-20, February.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:690-:d:1596021
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/5/690/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/5/690/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qiong Wu & Zijun Hao, 2025. "Completely Smooth Lower-Order Penalty Approach for Solving Second-Order Cone Mixed Complementarity Problems," Mathematics, MDPI, vol. 13(5), pages 1-20, February.
    2. 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.
    3. Willard I. Zangwill, 1967. "Non-Linear Programming Via Penalty Functions," Management Science, INFORMS, vol. 13(5), pages 344-358, January.
    4. Zheng-Hai Huang & Tie Ni, 2010. "Smoothing algorithms for complementarity problems over symmetric cones," Computational Optimization and Applications, Springer, vol. 45(3), pages 557-579, April.
    5. 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.
    6. Chieu Thanh Nguyen & Jan Harold Alcantara & Zijun Hao & Jein-Shan Chen, 2025. "Smoothing penalty approach for solving second-order cone complementarity problems," Journal of Global Optimization, Springer, vol. 91(1), pages 39-58, January.
    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. Qiong Wu & Zijun Hao, 2025. "Completely Smooth Lower-Order Penalty Approach for Solving Second-Order Cone Mixed Complementarity Problems," Mathematics, MDPI, vol. 13(5), pages 1-20, February.

    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. Chieu Thanh Nguyen & Jan Harold Alcantara & Zijun Hao & Jein-Shan Chen, 2025. "Smoothing penalty approach for solving second-order cone complementarity problems," Journal of Global Optimization, Springer, vol. 91(1), pages 39-58, January.
    2. 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.
    3. Ellen H. Fukuda & L. M. Graña Drummond & Fernanda M. P. Raupp, 2016. "An external penalty-type method for multicriteria," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 493-513, July.
    4. D.P. Bertsekas & A.E. Ozdaglar, 2002. "Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 114(2), pages 287-343, August.
    5. 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.
    6. Duan Yaqiong & Lian Shujun, 2016. "Smoothing Approximation to the Square-Root Exact Penalty Function," Journal of Systems Science and Information, De Gruyter, vol. 4(1), pages 87-96, February.
    7. Kaiwen Meng & Xiaoqi Yang, 2015. "First- and Second-Order Necessary Conditions Via Exact Penalty Functions," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 720-752, June.
    8. T. Antczak, 2013. "A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 159(2), pages 437-453, November.
    9. Jingyong Tang & Hongchao Zhang, 2021. "A Nonmonotone Smoothing Newton Algorithm for Weighted Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 679-715, June.
    10. Rao, K.S. Rama & Sunderan, T. & Adiris, M. Ref'at, 2017. "Performance and design optimization of two model based wave energy permanent magnet linear generators," Renewable Energy, Elsevier, vol. 101(C), pages 196-203.
    11. Tadeusz Antczak & Najeeb Abdulaleem, 2023. "On the exactness and the convergence of the $$l_{1}$$ l 1 exact penalty E-function method for E-differentiable optimization problems," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1331-1359, September.
    12. Marco Corazza & Giovanni Fasano & Riccardo Gusso, 2011. "Particle Swarm Optimization with non-smooth penalty reformulation for a complex portfolio selection problem," Working Papers 2011_10, Department of Economics, University of Venice "Ca' Foscari".
    13. Giorgio Giorgi & Bienvenido Jiménez & Vicente Novo, 2014. "Some Notes on Approximate Optimality Conditions in Scalar and Vector Optimization Problems," DEM Working Papers Series 095, University of Pavia, Department of Economics and Management.
    14. Liqun Qi & Zheng-Hai Huang, 2019. "Tensor Complementarity Problems—Part II: Solution Methods," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 365-385, November.
    15. Li, Yuan-Min & Wei, Deyun, 2015. "A generalized smoothing Newton method for the symmetric cone complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 264(C), pages 335-345.
    16. M. V. Dolgopolik, 2018. "A Unified Approach to the Global Exactness of Penalty and Augmented Lagrangian Functions I: Parametric Exactness," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 728-744, March.
    17. 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.
    18. Tang, Jingyong & Zhou, Jinchuan & Fang, Liang, 2015. "A non-monotone regularization Newton method for the second-order cone complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 743-756.
    19. Xiangjing Liu & Sanyang Liu, 2020. "A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian $$P_0$$ P 0 -property," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(2), pages 229-247, October.
    20. Jingyong Tang & Jinchuan Zhou, 2020. "Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones," Annals of Operations Research, Springer, vol. 295(2), pages 787-808, December.

    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:gam:jmathe:v:13:y:2025:i:5:p:690-:d:1596021. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.