Area-time complexity of the unconstrained minimization problem

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.