基于非精确数据的非光滑优化强次可行方向法

摘要

本研究针对一类目标函数非光滑优化问题，提出一个基于非精确数据的强次可行方向法。通过构造新的寻找搜索方向子问题和新型线搜索，该算法能够保证迭代点的强次可行性，且具备全局收敛性。%In this paper,a strongly sub-feasible direction method with inexact data is proposed for solving a class of optimization problems with nonsmooth obj ectives.By constructing a new search direction finding subproblem and a new line search,the strongly sub-feasibility of the it-eration points is guaranteed,and the global convergence of the algorithm is proved.