A Logarithmic-Quadratic Proximal Method for Variational Inequalities

被引：18

作者：

Alfred Auslender

Marc Teboulle

Sami Ben-Tiba

机构：

[1] Laboratoire d' Econometrie de L'Ecole Polytechnique,School of Mathematical Sciences

[2] Tel-Aviv University,undefined

[3] Laboratoire d' Econometrie de L'Ecole Polytechnique,undefined

来源：

Computational Optimization and Applications | 1999年 / 12卷

关键词：

variational inequalities; nonlinear complementarity; proximal-like methods; maximal monotone operators; global convergence; interior point methods; saddle point computation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We present a new method for solving variational inequalities on polyhedra. The method is proximal based, but uses a very special logarithmic-quadratic proximal term which replaces the usual quadratic, and leads to an interior proximal type algorithm. We allow for computing the iterates approximately and prove that the resulting method is globally convergent under the sole assumption that the optimal set of the variational inequality is nonempty.

引用

页码：31 / 40

页数：9

共 12 条

[1]

Auslender A.(1995)An interior proximal method for convex linearly constrained problems and its extension to variational inequalities Mathematical Programming 71 77-100

[2]

Haddou M.(1975)An iterative solution of a variational inequality for certain monotone operators in Hilbert space Bulletin of the American Math. Soc. 81 890-892

[3]

Bruck R.D.(1998)A generalized proximal point algorithm for the variational inequality problem in a Hilbert space SIAM Journal on Optimization 8 197-216

[4]

Burachik R.S.(1993)Error bounds and convergence analysis of feasible descent methods: A general approach Annals of Operations Research 46 157-178

[5]

Iusem A.N.(1970)Monotone operators and the proximal point algorithm Regularisation d'inéquations variationnelles par approximations successives, Revue Francaise d'Automatique et Informatique recherche Opérationnelle 4 154-159

[6]

Luo Z.Q.(1970)Augmented Lagrangians and applications of the proximal point algorithm in convex programming On the maximality of sums of nonlinear monotone operators, Transactions of the American Mathematical Society 149 75-88

[7]

Tseng P.(1976)Convergence of proximal-like algorithms SIAM J. of Control and Optimization 14 877-898

[8]

Martinet B.(1976)undefined Mathematics of Operations Research 1 97-116

[9]

Rockafellar R.T.(1997)undefined SIAM J. of Optimization 7 1069-1083

[10]

Rockafellar R.T.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →