In this paper we intestigate the complexity of unconstrained optimization in VLSI models. We present a design providing an upper bound to the areax(time)?2 complexity of unconstrained minimization, in the case of quadratic functions, which falls short of logarithmic factors to the known areax(time)?2 lower bound to matrix inversion.
Area-time complexity of the unconstrained minimization problem
Codenotti B;Favati P
1986
Abstract
In this paper we intestigate the complexity of unconstrained optimization in VLSI models. We present a design providing an upper bound to the areax(time)?2 complexity of unconstrained minimization, in the case of quadratic functions, which falls short of logarithmic factors to the known areax(time)?2 lower bound to matrix inversion.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_420047-doc_148701.pdf
solo utenti autorizzati
Descrizione: Area-time complexity of the unconstrained minimization problem
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.43 MB
Formato
Adobe PDF
|
1.43 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
