Smoothing algorithms for complementarity problems over symmetric cones

  • Authors:
  • Zheng-Hai Huang;Tie Ni

  • Affiliations:
  • Department of Mathematics, School of Science, Tianjin University, Tianjin, People's Republic of China 300072;Department of Mathematics, School of Science, Tianjin University, Tianjin, People's Republic of China 300072

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

There recently has been much interest in studying optimization problems over symmetric cones. In this paper, we first investigate a smoothing function in the context of symmetric cones and show that it is coercive under suitable assumptions. We then extend two generic frameworks of smoothing algorithms to solve the complementarity problems over symmetric cones, and prove the proposed algorithms are globally convergent under suitable assumptions. We also give a specific smoothing Newton algorithm which is globally and locally quadratically convergent under suitable assumptions. The theory of Euclidean Jordan algebras is a basic tool which is extensively used in our analysis. Preliminary numerical results for second-order cone complementarity problems are reported.