A new smoothing homotopy algorithm for second-order cone problems

In this paper, we introduce a new class of CHKS smoothing functions and show that the new smoothing functions possess a system of desirable properties. Based on the new smoothing functions, we obtain a smoothing homotopy method for solving the second-order cone complementarity problem. Under appropriate assumptions, we prove that the proposed method determines a smoothing interior path from a given interior point to an interior point where the necessary conditions are satisfied. The numerical tracing of this path gives a globally convergent algorithm for the SOCCP. Finally, some numerical results are reported, showing that the considered algorithm is applicable and efficient.

Authors

Institutions

Publication Details

Journal
Journal of Inequalities and Applications
Published
2025-10-27
DOI
https://doi.org/10.1186/s13660-025-03339-x
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new smoothing homotopy algorithm for second-order cone problems

Xiaona Fan, Tingting Xu, Zaiyong Feng
Journal of Inequalities and Applications
Advanced Optimization Algorithms Research
article

A new smoothing homotopy algorithm for second-order cone problems

Xiaona Fan, Tingting Xu, Zaiyong Feng
article en

Abstract

In this paper, we introduce a new class of CHKS smoothing functions and show that the new smoothing functions possess a system of desirable properties. Based on the new smoothing functions, we obtain a smoothing homotopy method for solving the second-order cone complementarity problem. Under appropriate assumptions, we prove that the proposed method determines a smoothing interior path from a given interior point to an interior point where the necessary conditions are satisfied. The numerical tracing of this path gives a globally convergent algorithm for the SOCCP. Finally, some numerical results are reported, showing that the considered algorithm is applicable and efficient.

Journal of Inequalities and ApplicationsVol. 2025(1)
Nanjing University of Posts and Telecommunications (CN), Nanjing Institute of Railway Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 54%
Advanced Optimization Algorithms Research
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.