1 citations · 1 across the 4 of their papers we have counts for
5 papers · 1 filter
Successive Fixing for Large-Scale SCUC Using First-Order Methods
Jinxin Xiong, Yanting Huang, Yingxiao Wang +4
Security-Constrained Unit Commitment is a fundamental optimization problem in power systems operations. The primary computational bottleneck arises from the need to solve large-sca…
Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting
Jinxin Xiong, Xi Gao, Linxin Yang +3
Convex quadratic programs (QPs) are fundamental to numerous applications, including finance, engineering, and energy systems. Among the various methods for solving them, the Dougla…
Relax-and-Cut for Temporal SCUC Decomposition
Jinxin Xiong, Linxin Yang, Yingxiao Wang +4
The Security-Constrained Unit Commitment (SCUC) problem presents formidable computational challenges due to its combinatorial complexity, large-scale network dimensions, and numero…
A Learning-Based Inexact ADMM for Solving Quadratic Programs
Xi Gao, Jinxin Xiong, Linxin Yang +3
Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The…
IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs
Xi Gao, Jinxin Xiong, Akang Wang +3
Solving constrained nonlinear programs (NLPs) is of great importance in various domains such as power systems, robotics, and wireless communication networks. One widely used approa…