Area-time complexity of the unconstrained minimization problem

DOI10.1007/BF02579428zbMath0609.90096OpenAlexW1977930326MaRDI QIDQ1087137

Bruno Codenotti, Paola Favati

Publication date: 1986

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579428

zbMATH Keywords

VLSI modelscomplexity of unconstrained optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Area-time tradeoff for rectangular matrix multiplication in VLSI models
• VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
• Area-time tradeoffs for matrix multiplication and related problems in VLSI models
• Quasi-Newton Methods and their Application to Function Minimisation

This page was built for publication: Area-time complexity of the unconstrained minimization problem