论文部分内容阅读
A descent algorithm for Non-Lipschitz Programming is presented in the paper. The algorithm employs a strict convex programming to obtain a search direction and an exact penalty function to determine step lenth. The convergence is proved and two numerical