Without the strict feasibility of the initial points and iteration points, the algorithm is shown to possess both polynomial-time complexity and Q-linear convergence.

• 该算法不要求初始点及迭代点的可行性且具有Q-线性收敛速度和多项式时间复杂性。