In this paper, we study inclusion problems where the involved operators may not be monotone in the classical sense. Specifically, we assume the operators to be generalized monotone, a weaker notion than classical monotonicity. This allows us to extend the applicability of our results to a broader class of operators. We apply the two-step inertial forward-reflected-anchored-backward splitting algorithm proposed in CHIN to these non-monotone inclusion problems. We establish the strong convergence of the sequence generated by the algorithm and demonstrate its applicability to other optimization problems, including Constrained Optimization Problems, Mixed Variational Inequalities, and Variational Inequalities.
Nam Van Tran (Tue,) studied this question.