A trust region SQP-filter method for nonlinear second-order cone programming |
| |
| Authors: | Xiangsong Zhang Zhenhua Liu Sanyang Liu |
| |
| Affiliation: | 1. Applied Mathematics Department, Xi’an Technological University, Xi’an, Shaanxi 710032, China;2. Network and Data Security Key Laboratory of Sichuan Province, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China;3. Department of Mathematics, Xidian University, Xi’an, Shaanxi 710071, China |
| |
| Abstract: | ![]()
In this paper, we consider the nonlinear second-order cone programming problem. By combining an SQP method and filter technique, we present a trust region SQP-filter method for solving this problem. The proposed algorithm avoids using the classical merit function with penalty term. Furthermore, under standard assumptions, we prove that the iterative sequence generated by the presented algorithm converges globally. Preliminary numerical results indicate that the algorithm is promising. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
