In this paper, we present a derivative-free multivariate spectral projection algorithm for convex constrained nonlinear monotone equations. The search direction is a product of a convex combination of two different spectral diagonal matrices and the residual vector. Moreover, to ensure positive definiteness of the diagonal matrix associated with the search direction, suitable safeguard is formulated. Some of the remarkable properties of the algorithm include: Jacobian free approach, capacity to solve large-scale problems and the search direction generated by the algorithm, satisfy the descent property independent on the line search employed. Under appropriate assumptions, the global convergence of the algorithm is given. Numerical experiments show that the algorithm has advantages over the recently proposed multivariate derivative-free projection algorithm by Liu and Li (J Ind Manag Optim 13(1):283–295, 2017) and also compete with another algorithm having the standard choice of the Barzilai-Borwein step as the search direction.
|Journal||International Journal of Applied and Computational Mathematics|
|Publication status||Published - Apr 2021|
- Derivative-free method
- Global convergence
- Multivariate spectral method
- Nonlinear monotone equations
- Projection method