摘要
In this paper, an efficient algorithm is proposed for solving convex constrained equations. The method has the following characteristics: (i) its search direction satisfies the sufficient descent property which is independent of any line search conditions; (ii) the equations only satisfy pseudo-monotone property; (iii) its global convergence is proved without the Lipschitz continuity. We compare our numerical results for test problems with those of other derivative-free projection methods.
- 单位