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

DOI10.1007/S40305-014-0065-8zbMATH Open1338.90298OpenAlexW2070786871MaRDI QIDQ489145FDOQ489145

Wenxing Zhu, Jianli Chen, Yan Cui

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

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

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)

Cites Work

• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Smooth minimization of non-smooth functions
• Title not available (Why is that?)
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Title not available (Why is that?)
• 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
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Decentralized Resource Allocation in Dynamic Networks of Agents
• Handbook of Algorithms for Physical Design Automation

Cited In (2)

• Title not available (Why is that?)
• Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout

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)