Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method

In this paper, by introducing C2C2 mappings ξi(x,zi),i=1,…,mξ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.