Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 13 min ago
PreprintarXiv licencearXiv

Solving Quasi-Variational Inequalities Using the Progressive Decoupling of Linkages

  • Manoel Jardim
  • Claudia Sagastizábal
  • Mikhail Solodov
Open at sourcePDFDOICite

Abstract

Inspired by the progressive decoupling of linkages methodology for optimization and variational inequalities, we propose an algorithm for solving quasi-variational inequalities as a sequence of variational inequalities. Our method is shown to converge locally under some regularity conditions and globally when such conditions hold throughout the entire domain. Separately, under other type of assumptions, global convergence with linear rate is also established for the class of quasi-variational inequalities said to have a moving set. Advantageous computational performance is shown for large-scale Walrasian equilibrium problems, a special case of generalized Nash equilibria, as well as for some other instances encountered in related literature.

Related

  1. Optimal High-Order Methods for Solving Monotone Variational Inequalities
    Xinliang Zhang, Lesi Chen, Linxuan Pan +3
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  2. On the Role of Geometry in Solving Variational Inequalities
    Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Semidefinite Implementations of the Proximal Point Algorithm and Consequences for Progressive Decoupling in Optimization
    Xudong Li, R. Tyrrell Rockafellar, Defeng Sun
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Energetic Variational Deep Learning for Solving High-Dimensional Stationary Fokker-Planck Equations
    Fanze Kong, Zhouyuan Qin, Shuangquan Xie
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  5. Weighted decoupling inequalities via fractal bilinear Kakeya estimates
    Robert Schippa
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv

Cite

BibTeXRIS
BibTeX
@misc{jardim2026solving,
  title = {{Solving Quasi-Variational Inequalities Using the Progressive Decoupling of Linkages}},
  author = {Manoel Jardim and Claudia Sagastizábal and Mikhail Solodov},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.27694},
  eprint = {2608.27694},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.27694},
}
RIS
TY  - UNPB
TI  - Solving Quasi-Variational Inequalities Using the Progressive Decoupling of Linkages
AU  - Manoel Jardim
AU  - Claudia Sagastizábal
AU  - Mikhail Solodov
PY  - 2026
DA  - 2026/08/27
PB  - arXiv
DO  - 10.48550/arxiv.2608.27694
UR  - https://arxiv.org/abs/2608.27694
AB  - Inspired by the progressive decoupling of linkages methodology for optimization and variational inequalities, we propose an algorithm for solving quasi-variational inequalities as a sequence of variational inequalities. Our method is shown to converge locally under some regularity conditions and globally when such conditions hold throughout the entire domain. Separately, under other type of assumptions, global convergence with linear rate is also established for the class of quasi-variational inequalities said to have a moving set. Advantageous computational performance is shown for large-scale Walrasian equilibrium problems, a special case of generalized Nash equilibria, as well as for some other instances encountered in related literature.
ER  -