The revisit of a projection algorithm with variable steps for variational inequalities

Qingzhi Yang

doi:10.3934/jimo.2005.1.211

Article Contents

2005, Volume 1, Issue 2: 211-217. Doi: 10.3934/jimo.2005.1.211

This issue Previous Article An iterative method for general variational inequalities Next Article A discretization based smoothing method for solving semi-infinite variational inequalities

The revisit of a projection algorithm with variable steps for variational inequalities

Qingzhi Yang^1,

1.
School of Mathematics and LPMC, Nankai University, Tianjin 300071, P.R.

Received: July 31, 2004

Revised: December 31, 2004

Published: March 2005

Abstract Related Papers Cited by

Abstract

The projection-type methods are a class of important methods for solving variational inequalities(VI). This paper presents a new treatment to a classical projection algorithm with variable steps, which was first proposed by Auslender in 1970s and later was developed by Fukushima in 1980s. The main purpose of this work is to weaken the assumption conditions while the convergence of original method is still valid.

Keywords:

Mathematics Subject Classification: 90C30, 90C33, 65K05.

Citation:

Article Metrics

HTML views() PDF downloads(111) Cited by(0)

The revisit of a projection algorithm with variable steps for variational inequalities

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

The revisit of a projection algorithm with variable steps for variational inequalities

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content