Area-time complexity of the unconstrained minimization problem (Q1087137)

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.