Area-time complexity of the unconstrained minimization problem (Q1087137)
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 3987064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Area-time complexity of the unconstrained minimization problem |
scientific article; zbMATH DE number 3987064 |
Statements
Area-time complexity of the unconstrained minimization problem (English)
0 references
1986
0 references
We investigate the complexity of unconstrained optimization in VLSI models. We present a design providing an upper bound to the \(area\times (time)^ 2\) complexity of unconstrained minimization, in the case of quadratic functions, which falls short of logarithmic factors to the known \(area\times (time)^ 2\) lower bound to matrix inversion.
0 references
complexity of unconstrained optimization
0 references
VLSI models
0 references
0 references
0.88482475
0 references
0.8842204
0 references
0.8689788
0 references
0.8645142
0 references
0.86008674
0 references
0.85868233
0 references
0.85861075
0 references
0.85523903
0 references
