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.











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)