Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement
type: Item
instance of: scholarly article
title: Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement
zbMATH Open document ID: 1338.90298
author: Jianli Chen
author: Yan Cui
author: Wenxing Zhu
published in: Journal of the Operations Research Society of China
publication date: 2015-01-27T00:00:00Z
review text: 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.
reviewed by: Igor V. Konnov
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6391366
zbMATH Keywords: VLSI placement
zbMATH Keywords: nonsmooth convex optimization
zbMATH Keywords: large-scale problems
zbMATH Keywords: smoothing technique
zbMATH Keywords: iterative method
describes a project that uses: NESTA
MaRDI profile type: Publication
full work available at URL: s40305-014-0065-8
OpenAlex ID: W2070786871
cites work: Handbook of Algorithms for Physical Design Automation
cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
cites work: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
cites work: Q4198056
cites work: Convex risk measures for portfolio optimization and concepts of flexibility
cites work: Decentralized Resource Allocation in Dynamic Networks of Agents
cites work: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
cites work: Q3967358
cites work: Smooth minimization of non-smooth functions
cites work: Excessive Gap Technique in Nonsmooth Convex Minimization
cites work: Subgradient methods for huge-scale optimization problems
cites work: Erratum to: ``Minimizing finite sums with the stochastic average gradient''
DOI: 10.1007/S40305-014-0065-8
description: scientific article; zbMATH DE number 6391366