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

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.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-02-20
DOI
https://doi.org/10.3390/math13050690
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Zijun Hao, Qiong Wu
Mathematics
Matrix Theory and Algorithms
article

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

Zijun Hao, Qiong Wu
article en

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.

MathematicsVol. 13(5)
North Minzu University (CN)
Openalex Percentile: Top 96%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.