REVIEW 1 cited by
A forward-reflected-anchored-backward splitting algorithm with double inertial effects for solving non-monotone inclusion problems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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 \cite{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.
Forward citations
Cited by 1 Pith paper
-
Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions
PMC-regularized LSTD solved by FRBS outperforms L1 sparse RL methods on noisy features, with new Lyapunov and weak-MVI guarantees for non-monotone FRBS.
Discussion (0). Continue with ORCID to comment.