Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method |
| |
Authors: | Menglong Su Bo Yu |
| |
Affiliation: | a Mathematics and Information Science College, Luoyang Normal University, Luoyang 471022, PR Chinab College of Mathematics, Dalian University of Technology, Dalian 116024, PR China |
| |
Abstract: | In this paper, by introducing C2 mappings ξi(x,zi),i=1,…,m and using the idea of the aggregate function method, a new aggregate constraint homotopy method is proposed to solve the Karush-Kuhn-Tucker (KKT) point of nonconvex nonlinear programming problems. Compared with the previous results, the choice scope of initial points is greatly enlarged, so use of the new aggregate constraint homotopy method may improve the computational efficiency of reduced predictor-corrector algorithms. |
| |
Keywords: | 65H10 90C30 |
本文献已被 ScienceDirect 等数据库收录! |
|