A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming


In this paper, for solving the general nonconvex multiobjective programming with both inequality and equality constraints, a modified constraint shifting homotopy is constructed, and the existence and global convergence of the smooth homotopy pathway is proven for any initial point in the almost Euclidean space under some mild conditions. The advantage of… (More)


  • Presentations referencing similar topics