Douglas-Rachford splitting algorithm for projected solution of quasi variational inequality with non-self constraint map
Maede Ramazannejad

TL;DR
This paper introduces a Douglas-Rachford splitting algorithm designed to find projected solutions for quasi-variational inequalities in Hilbert spaces, leveraging Lipschitz continuity and strong monotonicity of the operator.
Contribution
The paper develops a novel Douglas-Rachford splitting method tailored for quasi-variational inequalities with non-self constraint maps, under specific operator conditions.
Findings
Algorithm converges under Lipschitz and strong monotonicity assumptions.
Provides a new iterative method for quasi-variational inequalities.
Applicable to problems with non-self constraint maps.
Abstract
In this paper, we present a Douglas-Rachford splitting algorithm within a Hilbert space framework that yields a projected solution for a quasi-variational inequality. This is achieved under the conditions that the operator associated with the problem is Lipschitz continuous and strongly monotone. The proposed algorithm is based on the interaction between the resolvent operator and the reflected resolvent operator.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Numerical Analysis Techniques · Assembly Line Balancing Optimization
