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

DOI10.1007/S40305-014-0065-8MaRDI QIDQ489145zbMATH OpenOpenAlexFDO

Authors Jianli Chen, Yan Cui, Wenxing 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 methodlarge-scale problemsnonsmooth convex optimizationsmoothing techniqueVLSI placement

Mathematics Subject Classification ID

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

Recommendations

• Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Smooth minimization of non-smooth functions
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems

Cites work

• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Convex risk measures for portfolio optimization and concepts of flexibility
• Decentralized Resource Allocation in Dynamic Networks of Agents
• Erratum to: ``Minimizing finite sums with the stochastic average gradient
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Handbook of Algorithms for Physical Design Automation
• NESTA: A fast and accurate first-order method for sparse recovery
• Smooth minimization of non-smooth functions
• Subgradient methods for huge-scale optimization problems

Cited in

(2)

• scientific article; zbMATH DE number 1860753 (Why is no real title available?)
• Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout

Describes a project that uses

Uses Software

• NESTA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489145)