No label defined (Q3985677)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 27647
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 27647

      Statements

      0 references
      27 June 1992
      0 references
      elliptic variational inequalities
      0 references
      convex optimization
      0 references
      convex quadratic program
      0 references
      coordinate ascent method with projection
      0 references
      gradient projection method
      0 references
      method of feasible directions
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references