Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement (Q489145)

In the paper, the authors consider a general VLSI placement problem that is formulated as a high-dimensional convex optimization problem containing nonsmooth functions. They propose to solve this problem with the smoothing technique and so-called excessive gap function by \textit{Yu. Nesterov} [Math. Program. 103, No. 1 (A), 127--152 (2005; Zbl 1079.90102)] and [[SIAM J. Optim. 16, No. 1, 235--249 (2005; Zbl 1096.90026)] and provide the proper adjustment. In such a way, they take the corresponding iterative method and substantiate its convergence and give also the convergence rate. They illustrate the performance by series of test experiments.