scientific article; zbMATH DE number 4045496
The purpose of this paper is to propose a new penalty method for solving a class of variational inequalities of the following form: \[ (1)\quad Find\quad \bar x\in D,\quad \bar y\in F(\bar x)\quad such\quad that\quad <\bar y,x-\bar x>+\phi(x)-\phi (\bar x)\geq 0\quad \forall x\in D, \] where D is a closed convex subset of \(R^ n\), F is a maximal monotone (multivalued) mapping of \(R^ n\) into itself and \(\phi\) is a lower semicontinuous function on \(R^ n\). We use a penalty function P which is convex on \(R^ n\) and may be negative at points of the feasible region. This function thus, different from all other penalty functions, can measure the level of feasibility of each point. The value of this function at a point is a quantity of award or penalty for this point depending on its being feasible or not. The starting point may be arbitrary and a sequence of trial solutions will be determined so that they are feasible if the penalty function is not identical with zero on the feasible region. Otherwise the method becomes an exterior algorithm. In many cases of interest, a variational inequality for a monotone mapping (not necessary strictly) can be converted into a sequence of subproblems in each of which one calculates a solution of an unconstrained variational inequality for a certain strictly monotone mapping. This is very essential, since there are some available algorithms that may be used only in the problems with strictly monotone mappings. When \(F\equiv 0\) the problem (1) becomes one of minimizing the function \(\phi\) over the closed convex set D. Our method then allows to write it in the form of variational inequalities and this way is quite different from the usual techniques as it does not require convexity of the objective function.
- An augumented penalty function method for solving a class of variational inequalities
- A lagrangian penalty function method for monotone variational inequalities
- Combining the projection method and the penalty function to solve the variational inequalities with monotone mappings
- Penalty functions for the vector variational inequality problem
- Penalty method for variational inequalities with multivalued mappings. III
- Penalty method for variational inequalities with multivalued mappings. III
- Penalty functions for the vector variational inequality problem
- Combining the projection method and the penalty function to solve the variational inequalities with monotone mappings
- On the multiplier-penalty-approach for quasi-variational inequalities
- A lagrangian penalty function method for monotone variational inequalities
- An augumented penalty function method for solving a class of variational inequalities
- An augmented Lagrangian technique for variational inequalities
- Approximation and regularization properties of augmented penalty functions in convex programming
- An exact penalty method for monotone variational inequalities and order optimal algorithms for finding saddle points
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783086)