Indexed by:期刊论文

Date of Publication:2010-10-15

Journal:NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS

Included Journals:SCIE、EI、Scopus

Volume:73

Issue:8

Page Number:2558-2565

ISSN No.:0362-546X

Key Words:Karush-Kuhn-Tucker point; Nonconvex nonlinear programming problems; Initial points

Abstract:In this paper, by introducing C(2) mappings xi(i)(x, z(i)), 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. (C) 2010 Elsevier Ltd. All rights reserved.