An efficient algorithm for statistical circuit optimization using Lagrangian relaxation.

I-Jye Lin Yao-Wen Chang

Published in: ICCAD (2007)

Keyphrases

lagrangian relaxation
np hard
computational complexity
optimal solution
learning algorithm
subgradient method
cost function
dynamic programming
search space
probabilistic model
np complete
shortest path
knapsack problem
convex optimization
lower bound
dual decomposition
neural network