Abstract:

The authors studied the problems of nonsmooth programming on nonconvex sets under pseudocone condition with aggregate technique  combined homotopy interiorpoint method. The existence of solution of the generalized K-K-T equation was verified. The aggregate homotopy interior\|point method was established for finding the K-K-T point and a globally converged algorithm was proved.

Key words: non-smooth optimization, aggregate function, homotopy method