On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application

Abstract

The Dai-Kou method Dai and Kou (2013), [12] is efficient for solving unconstrained optimization problems. However, its modified variants are quite rare for constrained nonlinear monotone equations. In an attempt to address this, two adaptive versions of the scheme with new and efficient parameter choices are presented in this paper. The schemes are obtained by analyzing eigenvalues of a modified Dai-Kou iteration matrix and constructing two new directions, which are used in the scheme's algorithms. The new methods are derivative-free, which is an attribute required for handling problems with very large dimensions. Both methods also satisfy the required condition for analyzing global convergence in the literature. By applying mild conditions, it is shown that the schemes are globally convergent and description of their effectiveness is achieved through experiments with four effective schemes for solving constrained nonlinear monotone equations. Furthermore, the methods are applied to recover images that are contaminated by impulse noise in compressed sensing.