Solving the chiplet placement problem via accelerated perturbed ADMM
From MaRDI portal
Cites work
- A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses
- A new Lagrangian-based first-order method for nonconvex constrained optimization
- A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming
- A survey of nonlinear conjugate gradient methods
- A survey on some recent developments of alternating direction method of multipliers
- A survey on the Dai–Liao family of nonlinear conjugate gradient methods
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition
- Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising
- Variational Analysis
This page was built for publication: Solving the chiplet placement problem via accelerated perturbed ADMM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240133)