An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities

Xiaoming Yuan*, Min Li

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

32 Citations (Scopus)
27 Downloads (Pure)

Abstract

The alternating direction method (ADM) is an influential decomposition method for solving a class of variational inequalities with block-separable structures. In the literature, the subproblems of the ADM are usually regularized by quadratic proximal terms to ensure a more stable and attractive numerical performance. In this paper, we propose to apply the logarithmic-quadratic proximal (LQP) terms to regularize the ADM subproblems, and thus develop an LQP-based decomposition method for solving a class of variational inequalities. Global convergence of the new method is proved under standard assumptions.

Original languageEnglish
Pages (from-to)1309-1318
Number of pages10
JournalSIAM Journal on Optimization
Volume21
Issue number4
DOIs
Publication statusPublished - 22 Nov 2011

Scopus Subject Areas

  • Software
  • Theoretical Computer Science

User-Defined Keywords

  • Alternating direction method
  • Complementarity problem
  • Logarithmic-quadratic proximal method
  • System of nonlinear equations
  • Variational inequality

Fingerprint

Dive into the research topics of 'An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities'. Together they form a unique fingerprint.

Cite this