mlsanityData to 14 Oct 2026

An Augmented Lagrangian Approach to Conically Constrained Non-monotone Variational Inequality Problems

arXiv 2306.01214 ↗First posted 2 Jun 2023math.OC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper we consider a non-monotone (mixed) variational inequality model with (nonlinear) convex conic constraints. Through developing an equivalent Lagrangian function-like primal-dual saddle-point system for the VI model in question, we introduce an augmented Lagrangian primal-dual method, to be called ALAVI in the current paper, for solving a general constrained VI model. Under an assumption, to be called the primal-dual variational coherence condition in the paper, we prove the convergence of ALAVI. Next, we show that many existing generalized monotonicity properties are sufficient -- though by no means necessary -- to imply the above mentioned coherence condition, thus are sufficient to ensure convergence of ALAVI. Under that assumption, we further show that ALAVI has in fact an o(1/√k) global rate of convergence where k is the iteration count. By introducing a new gap function, this rate further improves to be O(1/k) if the mapping is monotone. Finally, we show that under a metric subregularity condition, even if the VI model may be non-monotone the local convergence rate of ALAVI improves to be linear. Numerical experiments on some randomly generated highly nonlinear and non-monotone VI problems show practical efficacy of the newly proposed method.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 51 references that are in the map. First posted on arXiv 2 Jun 2023.

Builds on

9 of 51 references.

References · 9

  1. 2018Golden Ratio Algorithms for Variational Inequalitiescited by 38
  2. 2020Non-convex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advancescited by 38
  3. 2018A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivitycited by 36
  4. 2019On Lower Iteration Complexity Bounds for the Saddle Point Problemscited by 28
  5. 2020A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based On the Augmented Lagrangiancited by 5
  6. 2022Perseus: A Simple and Optimal High-Order Method for Variational Inequalitiescited by 5
  7. 2021A Unifying Framework of Accelerated First-Order Approach to Strongly Monotone Variational Inequalitiescited by 3
  8. 2018On Error Bounds and Multiplier Methods for Variational Problems in Banach Spacescited by 1
  9. 2021Primal-Dual First-Order Methods for Affinely Constrained Multi-Block Saddle Point Problemscited by 1

Built on by

Not cited yet.