Global lower bounds for the VLSI macrocell floorplanning problem using semidefinite optimization

Author(s):  
P.L. Takouda ◽  
M.F. Anjos ◽  
A. Vannelli
2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Guangming Zhou ◽  
Chao Deng ◽  
Kun Wu

Based on recent progress on moment problems, semidefinite optimization approach is proposed for estimating upper and lower bounds on linear functionals defined on solutions of linear integral equations with smooth kernels. The approach is also suitable for linear integrodifferential equations with smooth kernels. Firstly, the primal problem with smooth kernel is converted to a series of approximative problems with Taylor polynomials obtained by expanding the smooth kernel. Secondly, two semidefinite programs (SDPs) are constructed for every approximative problem. Thirdly, upper and lower bounds on related functionals are gotten by applying SeDuMi 1.1R3 to solve the two SDPs. Finally, upper and lower bounds series obtained by solving two SDPs, respectively infinitely approach the exact value of discussed functional as approximative order of the smooth kernel increases. Numerical results show that the proposed approach is effective for the discussed problems.


2016 ◽  
Vol 8 (4) ◽  
pp. 599-615
Author(s):  
Guangming Zhou ◽  
Chao Deng ◽  
Kun Wu

AbstractIn this paper, semidefinite optimization method is proposed to estimate bounds on linear functionals defined on solutions of linear ordinary differential equations (ODEs) with smooth coefficients. The method can get upper and lower bounds by solving two semidefinite programs, not solving ODEs directly. Its convergence theorem is proved. The theorem shows that the upper and lower bounds series of linear functionals discussed can approach their exact values infinitely. Numerical results show that the method is effective for the estimation problems discussed. In addition, in order to reduce calculation amount, Cheybeshev polynomials are applied to replace Taylor polynomials of smooth coefficients in computing process.


Author(s):  
Parinya CHALERMSOOK ◽  
Hiroshi IMAI ◽  
Vorapong SUPPAKITPAISARN

2020 ◽  
Vol 148 (2) ◽  
pp. 321-327
Author(s):  
Rodolfo Gutiérrez-Romo ◽  
Carlos Matheus
Keyword(s):  

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.


Sign in / Sign up

Export Citation Format

Share Document