A quasi-Newton-based floorplanner for fixed-outline floorplanning
From MaRDI portal
Publication:2668641
DOI10.1016/j.cor.2021.105225OpenAlexW3119990280MaRDI QIDQ2668641
Jigang Wu, Zhengli Wang, Yan Jin, Kun He, Pengli Ji
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105225
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Representations of quasi-Newton matrices and their use in limited memory methods
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- Line search algorithms with guaranteed sufficient decrease
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
This page was built for publication: A quasi-Newton-based floorplanner for fixed-outline floorplanning