New coordinate optimization method for non-smooth losses based on alternating direction method of multipliers

2013 ◽  
Vol 33 (7) ◽  
pp. 1912-1916
Author(s):  
Qiankun GAO ◽  
Yujun WANG ◽  
Jingxiao WANG
2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Hongbo Zhu ◽  
Yan Gao ◽  
Yong Hou

The real-time pricing (RTP) scheme is an ideal method to adjust the power balance between supply and demand in smart grid systems. This scheme has a profound impact on users’ behavior, system operation, and overall grid management in the electricity industry. In this research, we conduct an extended discussion of a RTP optimization model and give a theoretical analysis of the existence and uniqueness of the Lagrangian multiplier. A distributed optimization method based on the alternating direction method of multipliers (ADMM) algorithm with Gaussian back substitution (GBS) is proposed in this study. On the one hand, the proposed algorithm takes abundant advantage of the separability among variables in the model. On the other hand, the proposed algorithm can not only speed up the convergence rate to enhance the efficiency of computing, but also overcome the deficiency of the distributed dual subgradient algorithm, the possibility of nonconvergence in the iteration process. In addition, we give the theoretical proof of the convergence of the proposed algorithm. Furthermore, the interdependent relationship between variables has been discussed in depth during numerical simulations in the study. Compared with the dual subgradient method, the simulation results validate that the proposed algorithm has a higher convergence speed and better implementation effect.


2018 ◽  
Vol 141 (1) ◽  
Author(s):  
Yoshihiro Kanno

This paper presents a simple and effective heuristic for topology optimization of a truss under the constraint that all the members of the truss have the common cross-sectional area. The proposed method consists of multiple restarts of the alternating direction method of multipliers (ADMM) with random initial points. It is shown that each iteration of the ADMM can be carried out very easily. In the numerical experiments, the efficiency of the proposed heuristic is compared with the existing global optimization method based on the mixed-integer second-order cone programming (MISOCP). It is shown that even for large-scale problem instances that the global optimization method cannot solve within practically acceptable computational cost, the proposed method can often find a feasible solution having a fairly good objective value within moderate computational time.


Sign in / Sign up

Export Citation Format

Share Document