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

DOI10.1007/s40305-014-0065-8zbMath1338.90298OpenAlexW2070786871MaRDI QIDQ489145

Jian-Li Chen, Yan Cui, Wen-Xing Zhu

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-014-0065-8

zbMATH Keywords

iterative methodsmoothing techniquelarge-scale problemsnonsmooth convex optimizationVLSI placement

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Uses Software

• NESTA

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Subgradient methods for huge-scale optimization problems
• Erratum to: ``Minimizing finite sums with the stochastic average gradient
• Convex risk measures for portfolio optimization and concepts of flexibility
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Handbook of Algorithms for Physical Design Automation
• Decentralized Resource Allocation in Dynamic Networks of Agents
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

This page was built for publication: Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement