A parallel computing scheme for minimizing a class of large scale functions (Q1822903)
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 4113869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel computing scheme for minimizing a class of large scale functions |
scientific article; zbMATH DE number 4113869 |
Statements
A parallel computing scheme for minimizing a class of large scale functions (English)
0 references
1989
0 references
This paper deals with the problem of globally minimizing over \({\mathbb{R}}^ n\) functions of the form \[ f(x)=\sum^{m}_{i=1}f_ i(x_ i)+\sum^{m}_{i=1}\sum_{j>i}f_{ij}(x_ i,x_ j), \] where \(x_ i\in {\mathbb{R}}^{n(i)}\) (1\(\leq i\leq m)\), \(f_ i\) is twice continuously differentiable and \(f_{ij}\) is bilinear. An algorithm of solving this problem is presented and it is shown that, under some conditions, it converges with a specific relative convergence rate. Also, it is proved that the algorithm can be adapted for solving systems of homogeneous equations in which the right-hand-side functions have forms similar with f above.
0 references
parallel computing scheme
0 references
large scale functions
0 references
function with partially separable variables
0 references
global minimization
0 references
algorithm
0 references
convergence rate
0 references
0 references
0 references
0.8293067216873169
0 references
0.7826133370399475
0 references
0.7806063294410706
0 references
0.780129075050354
0 references