Qi Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qi Wang has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Wenchuan Wu
Tsinghua University
14 shared publications - Chenhui Lin
Tsinghua University
12 shared publications - Yue Yang
Hefei University of Technology
6 shared publications - Defeng Sun
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China
4 shared publications - Bin Wang
Department of Electrical Engineering, Tsinghua University, Beijing, China
3 shared publications Guannan Wang
State Grid Jibei Electric Power Company Limited, Beijing, China
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4875-4878
A High-Fidelity Time Domain Model for Gas Network Transients via Network-Level Rational Approximation
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4875-4878
A High-Fidelity Time Domain Model for Gas Network Transients via Network-Level Rational Approximation
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 5688-5700
Exact Analytical Solution for Self-Scheduling of Energy Storage With Piecewise Objective and Energy Loss Functions
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 5688-5700
Exact Analytical Solution for Self-Scheduling of Energy Storage With Piecewise Objective and Energy Loss Functions
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (5) , 4041-4044
An Efficient Algorithm to Calculate Locational Marginal Emissions in ACOPF via Adjoint Optimization Reformulation
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (5) , 4041-4044
An Efficient Algorithm to Calculate Locational Marginal Emissions in ACOPF via Adjoint Optimization Reformulation
- 16 July 2026
- Published by Springer Nature in Nature Reviews Electrical Engineering
- Vol. 3 (8) , 469-470
Space energy is infrastructure, not just generation
- 16 July 2026
- Published by Springer Nature in Nature Reviews Electrical Engineering
- Vol. 3 (8) , 469-470
Space energy is infrastructure, not just generation
- Open Access
- 23 April 2026
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 177
Coordinated primary and secondary robust voltage control for islanded microgrids with hybrid grid-following and grid-forming photovoltaics
- 23 April 2026
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 177
Open AccessCoordinated primary and secondary robust voltage control for islanded microgrids with hybrid grid-following and grid-forming photovoltaics
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (3) , 2187-2204
An Efficient GPU-Based Halpern Accelerating Algorithm for Large-Scale DC Optimal Power Flow
With numerous renewable generators and energy storage systems integrated into the power grids, the security-constrained DC optimal power flow (DCOPF) is essential for power system operation. For large-scale power grids, traditional CPU-based optimization algorithms (such as the simplex and barrier methods) have saturated in computational efficiency and are inherently difficult to parallelize. To tackle these issues, by incorporating the symmetric Gauss–Seidel (sGS) decomposition, this work develops a GPU-based Halpern Peaceman-Rachford algorithm, termed the sGS-HPR, which enjoys an $O(1/k)$ iteration complexity in terms of the KKT residual. Moreover, the closed-form solutions for all subproblems are derived, which only consist of matrix-vector multiplications and vector operations, and thus can be easily parallelized on GPUs. As a consequence, the developed sGS-HPR algorithm enjoys a $O({N_{L} \times n} / \epsilon)$ non-ergodic computational complexity in terms of floating-point operations for obtaining an $\epsilon$-optimal solution measured by the KKT residual for large-scale DCOPF problems, where $n$ represents the variable dimension, and $N_{L}$ denotes the number of branches in the power grid. Extensive numerical tests on large-scale power grids, reaching up to the 9241-bus PEGASE system, demonstrate the scalability and superior efficiency of the developed GPU-based sGS-HPR algorithm compared to state-of-the-art methods. Notably, the proposed method achieves a 6× speedup compared with Gurobi for large-scale instances. Additionally, for ultra-large-scale cases, Gurobi throws an “out-of-memory” error, while the proposed sGS-HPR algorithm maintains its computational scalability and efficiency.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (3) , 2187-2204
An Efficient GPU-Based Halpern Accelerating Algorithm for Large-Scale DC Optimal Power Flow
With numerous renewable generators and energy storage systems integrated into the power grids, the security-constrained DC optimal power flow (DCOPF) is essential for power system operation. For large-scale power grids, traditional CPU-based optimization algorithms (such as the simplex and barrier methods) have saturated in computational efficiency and are inherently difficult to parallelize. To tackle these issues, by incorporating the symmetric Gauss–Seidel (sGS) decomposition, this work develops a GPU-based Halpern Peaceman-Rachford algorithm, termed the sGS-HPR, which enjoys an $O(1/k)$ iteration complexity in terms of the KKT residual. Moreover, the closed-form solutions for all subproblems are derived, which only consist of matrix-vector multiplications and vector operations, and thus can be easily parallelized on GPUs. As a consequence, the developed sGS-HPR algorithm enjoys a $O({N_{L} \times n} / \epsilon)$ non-ergodic computational complexity in terms of floating-point operations for obtaining an $\epsilon$-optimal solution measured by the KKT residual for large-scale DCOPF problems, where $n$ represents the variable dimension, and $N_{L}$ denotes the number of branches in the power grid. Extensive numerical tests on large-scale power grids, reaching up to the 9241-bus PEGASE system, demonstrate the scalability and superior efficiency of the developed GPU-based sGS-HPR algorithm compared to state-of-the-art methods. Notably, the proposed method achieves a 6× speedup compared with Gurobi for large-scale instances. Additionally, for ultra-large-scale cases, Gurobi throws an “out-of-memory” error, while the proposed sGS-HPR algorithm maintains its computational scalability and efficiency.
- 19 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (3) , 2250-2264
Dynamic Network Usage Fee for Joint Kilowatt and Negawatt Peer-to-Peer Energy Market Based on Knowledge Distillation
Existing research on joint kilowatt-negawatt peer-to-peer (P2P) electricity markets predominantly relies on iterative coordination between prosumers and the distribution system operator (DSO). This not only undermines real-time market efficiency but also compromises prosumers’ privacy. Such drawbacks pose significant barriers to the practical deployment of P2P markets, where fast response and strict privacy protection are critical requirements. Therefore, there is a pressing need for a market-clearing design that can simultaneously achieve scalability, efficiency, and privacy preservation. Our paper proposes a novel system-aware and privacy-preserving market-clearing framework based on knowledge distillation. Distribution locational marginal prices (DLMPs) first capture the system operation signals. These DLMPs are embedded as soft constraints into individual prosumer optimization problems via Kullback-Leibler divergence minimization. A single-level and iteration-free market structure can thus be formulated. A dynamic network usage fee mechanism is then developed by integrating electrical distances. The network usage fee is refined through an iterative penalty-based adjustment process to ensure robust cost allocation. To preserve scalability and privacy, a decentralized market-clearing algorithm is finally constructed based on the Alternating Direction Method of Multipliers (ADMM). The exchanged data during iteration is protected with a differential privacy algorithm. Two cases are imported to validate the proposed framework’s ability to enhance social welfare, maintain grid operational feasibility, and guarantee cost recovery.
- 19 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (3) , 2250-2264
Dynamic Network Usage Fee for Joint Kilowatt and Negawatt Peer-to-Peer Energy Market Based on Knowledge Distillation
Existing research on joint kilowatt-negawatt peer-to-peer (P2P) electricity markets predominantly relies on iterative coordination between prosumers and the distribution system operator (DSO). This not only undermines real-time market efficiency but also compromises prosumers’ privacy. Such drawbacks pose significant barriers to the practical deployment of P2P markets, where fast response and strict privacy protection are critical requirements. Therefore, there is a pressing need for a market-clearing design that can simultaneously achieve scalability, efficiency, and privacy preservation. Our paper proposes a novel system-aware and privacy-preserving market-clearing framework based on knowledge distillation. Distribution locational marginal prices (DLMPs) first capture the system operation signals. These DLMPs are embedded as soft constraints into individual prosumer optimization problems via Kullback-Leibler divergence minimization. A single-level and iteration-free market structure can thus be formulated. A dynamic network usage fee mechanism is then developed by integrating electrical distances. The network usage fee is refined through an iterative penalty-based adjustment process to ensure robust cost allocation. To preserve scalability and privacy, a decentralized market-clearing algorithm is finally constructed based on the Alternating Direction Method of Multipliers (ADMM). The exchanged data during iteration is protected with a differential privacy algorithm. Two cases are imported to validate the proposed framework’s ability to enhance social welfare, maintain grid operational feasibility, and guarantee cost recovery.