Bregman-Golden ratio algorithms for variational inequalities

DOI10.1007/s10957-023-02320-2arXiv2208.05102OpenAlexW4388217958MaRDI QIDQ6145051

Daniel J. Uteda, Matthew K. Tam

Publication date: 8 January 2024

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.05102

zbMATH Keywords

variational inequalitysaddle-point problemsBregman distancelocal Lipschitzadaptive step size

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Complexity and performance of numerical algorithms (65Y20) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-cost modification of Korpelevich's methods for monotone equilibrium problems
• Dual extrapolation and its applications to solving variational inequalities and related problems
• A modification of the Arrow-Hurwicz method for search of saddle points
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• A simplified view of first order methods for optimization
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• On the convergence of projection methods: Application to the decomposition of affine variational inequalities
• Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities
• New inertial forward-backward type for variational inequalities with quasi-monotonicity
• Golden ratio algorithms for variational inequalities
• Fast and simple Bregman projection methods for solving variational inequalities and related problems in Banach spaces
• Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity
• Convergence of two-stage method with Bregman divergence for solving variational inequalities
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
• Adaptive two-stage Bregman method for variational inequalities
• Dykstras algorithm with bregman projections: A convergence proof
• A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Iterative methods for variational and complementarity problems
• A variant of korpelevich’s method for variational inequalities with a new search strategy
• Bregman Monotone Optimization Algorithms
• Proximal extrapolated gradient methods for variational inequalities
• A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
• Modified extragradient method with Bregman distance for variational inequalities
• On the linear convergence of a Bregman proximal point algorithm
• Two Bregman projection methods for solving variational inequalities
• A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity
• Projected Reflected Gradient Methods for Monotone Variational Inequalities
• Elements of Information Theory
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Bregman-Golden ratio algorithms for variational inequalities