scientific article; zbMATH DE number 27647
From MaRDI portal
Publication:3985677
The paper is concerned with methods for computing solutions to elliptic variational inequalities. First, a given variational inequality is transformed to a convex optimization problem in an infinite-dimensional space. Then the resulting optimization problem is approximated by a convex quadratic program in a finite-dimensional space. The author analyzes three methods for solving the resulting finite- dimensional problem: a coordinate ascent method with projection, a gradient projection method, and a method of feasible directions.
Recommendations
Cited in
(8)- Monotone multigrid methods for elliptic variational inequalities. I
- Block monotone iterative methods for elliptic variational inequalities.
- On the numerical solution of a variational inequality.
- On the Solution of Variational Inequalities by the Ellipsoid Method
- scientific article; zbMATH DE number 1240763 (Why is no real title available?)
- scientific article; zbMATH DE number 1341695 (Why is no real title available?)
- A differential equation method for solving the variational inequality problem with the cyclically monotone mapping
- Duality methods with an automatic choice of parameters. Application to shallow water equations in conservative form
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 Q3985677)