Mirror frameworks for relatively Lipschitz and monotone-like variational inequalities
Hui Zhang, Yu-Hong Dai

TL;DR
This paper introduces two unified mirror frameworks for solving relatively Lipschitz and monotone-like variational inequalities, unifying and improving convergence analysis of existing methods under weaker assumptions.
Contribution
The paper proposes two mirror frameworks that unify and extend existing VI solution methods, providing improved convergence analysis under weaker conditions.
Findings
Unified convergence analysis for multiple methods
Frameworks encompass known methods like mirror prox and extrapolation
Applicable under the weakest known assumptions
Abstract
Nonconvex-nonconcave saddle-point optimization in machine learning has triggered lots of research for studying non-monotone variational inequalities (VI). In this work, we introduce two mirror frameworks, called mirror extragradient method and mirror extrapolation method, for approximating solutions to relatively Lipschitz and monotone-like VIs. The former covers the well-known Nemirovski's mirror prox method and Nesterov's dual extrapolation method, and the recently proposed Bregman extragradient method; all of them can be reformulated into a scheme that is very similar to the original form of extragradient method. The latter includes the operator extrapolation method and the Bregman extrapolation method as its special cases. The proposed mirror frameworks allow us to present a unified and improved convergence analysis for all these existing methods under relative Lipschitzness and…
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
TopicsSparse and Compressive Sensing Techniques · Optimization and Variational Analysis · Advanced Optimization Algorithms Research
