An approximate lower order penalty approach for solving second-order cone linear complementarity problems

Zijun Hao, Chieu Thanh Nguyen, Jein Shan Chen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Based on a class of smoothing approximations to projection function onto second-order cone, an approximate lower order penalty approach for solving second-order cone linear complementarity problems (SOCLCPs) is proposed, and four kinds of specific smoothing approximations are considered. In light of this approach, the SOCLCP is approximated by asymptotic lower order penalty equations with penalty parameter and smoothing parameter. When the penalty parameter tends to positive infinity and the smoothing parameter monotonically decreases to zero, we show that the solution sequence of the asymptotic lower order penalty equations converges to the solution of the SOCLCP at an exponential rate under a mild assumption. A corresponding algorithm is constructed and numerical results are reported to illustrate the feasibility of this approach. The performance profile of four specific smoothing approximations is presented, and the generalization of two approximations are also investigated.

Original languageEnglish
Pages (from-to)671-697
Number of pages27
JournalJournal of Global Optimization
Volume83
Issue number4
DOIs
Publication statusPublished - 2022 Aug

Keywords

  • Exponential convergence rate
  • Linear complementarity problem
  • Lower order penalty approach
  • Second-order cone

ASJC Scopus subject areas

  • Business, Management and Accounting (miscellaneous)
  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'An approximate lower order penalty approach for solving second-order cone linear complementarity problems'. Together they form a unique fingerprint.

Cite this