No label defined (Q4763007)
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 1569656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1569656 |
Statements
25 February 2001
0 references
optimization problems
0 references
penalty function method
0 references
finite elements method
0 references
0.9038017
0 references
0.9037587
0 references
0.89967597
0 references
0.89833117
0 references
0.89736724
0 references
0.8972474
0 references
Many problems of mathematical physics are formulated as minimization problems for an integral functional \(J\) defined on a set \(K\) of a Hilbert space \(H\) of a function of the real argument \(x\in \Omega\), \(\Omega \subset R^n\): \[ \min_{v\in K}J(v), J(v) = \int_\Omega \Phi (v,x)dx. \] It is supposed that the functional \(J(v)\) is continuous and strongly convex in \(H\); \(\Omega\) is a many-sided domain in \(R^n\) with a boundary; \(K\) is a bounded convex set in \(H\). The possibility to combine the penalty function method and the finite-element method for the numerical optimization of the functional \(J(v)\) is considered. An algorithm suggested is based on an iterative procedure for enlargement of the number of nodes of finite elements and of penalty parameters. The conditions obtained for combining the mentioned methods not only guarantees the convergence of calculations proposed but also may be used in practice if these calculations are combined in addition with some concrete methods of the unconstrained optimization.
0 references