Area-time complexity of the unconstrained minimization problem
From MaRDI portal
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.
Recommendations
- The complexity of constrained min-max optimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- scientific article; zbMATH DE number 895368
- Complexity of approximating bounded variants of optimization problems
- Convex programs for minimal-area problems
- The complexity of the computation of a global minimum in certain classes of optimization problems
- Complexity and approximation of an area packing problem
- Complexity aspects of local minima and related notions
- ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
Cites work
- Area-time tradeoff for rectangular matrix multiplication in VLSI models
- Area-time tradeoffs for matrix multiplication and related problems in VLSI models
- Quasi-Newton Methods and their Application to Function Minimisation
- VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
This page was built for publication: Area-time complexity of the unconstrained minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087137)
