scholarly journals Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods

Author(s):  
Hao Wang ◽  
Fan Zhang ◽  
Yuanming Shi ◽  
Yaohua Hu
Keyword(s):  
2021 ◽  
Vol 161 ◽  
pp. 107877
Author(s):  
Zhaohui Du ◽  
Han Zhang ◽  
Xuefeng Chen ◽  
Yixin Yang

2018 ◽  
Vol 2018 ◽  
pp. 1-19 ◽  
Author(s):  
Ziyan Luo ◽  
Xiaoyu Li ◽  
Naihua Xiu

In this paper, we propose a sparse optimization approach to maximize the utilization of regenerative energy produced by braking trains for energy-efficient timetabling in metro railway systems. By introducing the cardinality function and the square of the Euclidean norm function as the objective function, the resulting sparse optimization model can characterize the utilization of the regenerative energy appropriately. A two-stage alternating direction method of multipliers is designed to efficiently solve the convex relaxation counterpart of the original NP-hard problem and then to produce an energy-efficient timetable of trains. The resulting approach is applied to Beijing Metro Yizhuang Line with different instances of service for case study. Comparison with the existing two-step linear program approach is also conducted which illustrates the effectiveness of our proposed sparse optimization model in terms of the energy saving rate and the efficiency of our numerical optimization algorithm in terms of computational time.


Sensors ◽  
2018 ◽  
Vol 18 (2) ◽  
pp. 644 ◽  
Author(s):  
Shang Zhang ◽  
Yuhan Dong ◽  
Hongyan Fu ◽  
Shao-Lun Huang ◽  
Lin Zhang

2021 ◽  
Vol 29 (10) ◽  
pp. 2495-2503
Author(s):  
Xiao-wei FENG ◽  
◽  
Hai-yun HU ◽  
Rui-qing ZHUANG ◽  
Min HE

Sign in / Sign up

Export Citation Format

Share Document