Implementation and numerical results of an approximation method for constrained saddle point problems (Q3700722)

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 3926122
Language Label Description Also known as
default for all languages
No label defined
    English
    Implementation and numerical results of an approximation method for constrained saddle point problems
    scientific article; zbMATH DE number 3926122

      Statements

      Implementation and numerical results of an approximation method for constrained saddle point problems (English)
      0 references
      0 references
      0 references
      1984
      0 references
      algorithms
      0 references
      constrained saddle point problems
      0 references
      strong convergence
      0 references
      convex-concave
      0 references
      penalization
      0 references
      discretization
      0 references
      In ibid. 15, 53-64 (1984; Zbl 0539.65049) the authors considered an implementable iterative procedure which generates a sequence of finite dimensional unconstrained optimization problems. Numerical results are given in this paper for the finite and infinite dimensional case. Applications to distributed control problems governed by Dirichlet elliptic systems are also presented. The finite dimensional optimization step is implemented by use of three different methods (local variation, conjugate gradient and quasi-Newton). A detailed and interesting study of the performances of the algorithm is made.
      0 references

      Identifiers