Bilevel Stackelberg model with KKT single-level reformulation and LDD-ADMM distributed algorithm coordinates LV communities and MV network on IEEE 33-bus and 206-bus LV feeders, achieving 1.7e-4 average deviation from exact solution.
Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
This paper establishes convergence rate bounds for a variant of the proximal alternating direction method of multipliers (ADMM) for solving nonconvex linearly constrained optimization problems. The variant of the proximal ADMM allows the inclusion of an over-relaxation stepsize parameter belonging to the interval $(0,2)$. To the best of our knowledge, all related papers in the literature only consider the case where the over-relaxation parameter lies in the interval $(0,(1+\sqrt{5})/2)$.
verdicts
UNVERDICTED 2representative citing papers
A new symmetric accelerated ADMM is introduced with convergence and iteration-complexity analysis for nonconvex problems, tested on sparse signal processing minimization.
citing papers explorer
-
A Bilevel Optimization Model for Bottom-Up Coordination of Multiple Low-Voltage Energy Communities and the Medium-Voltage Network
Bilevel Stackelberg model with KKT single-level reformulation and LDD-ADMM distributed algorithm coordinates LV communities and MV network on IEEE 33-bus and 206-bus LV feeders, achieving 1.7e-4 average deviation from exact solution.
-
Accelerated Symmetric ADMM and Its Applications in Signal Processing
A new symmetric accelerated ADMM is introduced with convergence and iteration-complexity analysis for nonconvex problems, tested on sparse signal processing minimization.