In this paper, the second-order cone complementarity problem is studied. Based on the Fischer-Burmeister function with a perturbed parameter, which is also called smoothing parameter, a regularization smoothing Newton method is presented for solving the sequence of regularized problems of the second
A smoothing method for second order cone complementarity problem
โ Scribed by Xiangsong Zhang; Sanyang Liu; Zhenhua Liu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 532 KB
- Volume
- 228
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, the second order cone complementarity problem is studied. Based on a perturbed symmetrically smoothing function, which has coerciveness under proper conditions, we present a smoothing Newton method for this problem. The boundedness of the level set can be obtained from the coerciveness, which plays an important role in the convergence analysis. Furthermore, the proposed algorithm for the reformulation has no restrictions on the starting point and solves only one system of equations. Preliminary numerical results indicate that the algorithm is effective.
๐ SIMILAR VOLUMES
## Communicated by J. Cash In this paper, we present a new one-step smoothing Newton method for solving the second-order cone complementarity problem (SOCCP). Based on a new smoothing function, the SOCCP is approximated by a family of parameterized smooth equations. At each iteration, the proposed
Analogous to the nonlinear complementarity problem and the semi-definite complementarity problem, a popular approach to solving the second-order cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over R n . In this paper, we present
A new smoothing function for the second-order cone programming is given by smoothing the symmetric perturbed Fischer-Burmeister function. Based on this new function, a one-step smoothing Newton method is presented for solving the second-order cone programming. The proposed algorithm solves only one