2008•OptimizationRequires access

On general variable-step relaxed projection method for strongly quasivariational inequalities

Lu-Chuan Ceng, Changyu Wang, Jen‐Chih Yao

Abstract

In this article, a general variable-step basic projection algorithm for solving strongly quasivariational inequalities is proposed. Under certain conditions, the convergence of the general variable-step basic projection algorithm is established. For the practical consideration, we also give the relaxed version of this algorithm, in which the projection onto a closed convex set is replaced by another projection at each iteration which is easy to calculate. The convergence of relaxed scheme is also obtained under certain assumptions.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Projection (relational algebra), Mathematics, Convergence (economics), Projection method, Variable (mathematics), Dykstra's projection algorithm, Regular polygon, Set (abstract data type)