paper-with-me

홈 › Papers

QCQP-Net: Reliably Learning Feasible Alternating Current Optimal Power Flow Solutions Under Constraints

2024-01-11 · Sihan Zeng, Youngdae Kim, Yuxuan Ren, Kibaek Kim

At the heart of power system operations, alternating current optimal power flow (ACOPF) studies the generation of electric power in the most economical way under network-wide load requirement, and can be formulated as a highly structured non-convex quadratically constrained quadratic program (QCQP). Optimization-based solutions to ACOPF (such as ADMM or interior-point method), as the classic approach, require large amount of computation and cannot meet the need to repeatedly solve the problem as load requirement frequently changes. On the other hand, learning-based methods that directly predict the ACOPF solution given the load input incur little computational cost but often generates infeasible solutions (i.e. violate the constraints of ACOPF). In this work, we combine the best of both worlds -- we propose an innovated framework for learning ACOPF, where the input load is mapped to the ACOPF solution through a neural network in a computationally efficient and reliable manner. Key to our innovation is a specific-purpose "activation function" defined implicitly by a QCQP and a novel loss, which enforce constraint satisfaction. We show through numerical simulations that our proposed method achieves superior feasibility rate and generation cost in situations where the existing learning-based approaches fail.

📄 PDF Abstract BibTeX arXiv:2401.06820

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

ADMM The alternating direction method of multipliers (ADMM) is an algorithm that solves convex optimization problems by breaking them into smaller pieces, each of which are…

Similar Papers 제목 키워드 기반

Anytime-Feasible First-Order Optimization via Safe Sequential QCQP

2025-11-24 · Jiarui Wang, Mahyar Fazlyab arxiv

This paper presents the Safe Sequential Quadratically Constrained Quadratic Programming (SS-QCQP) algorithm, a first-order method for smooth inequality-constrained nonconvex optimization that guarantees feasibility at ev…

Parabolic Relaxation for Quadratically-constrained Quadratic Programming -- Part II: Theoretical & Computational Results

2022-08-07 · Ramtin Madani, Mersedeh Ashraphijuo, Mohsen Kheirandishfard, Alper Atamturk

In the first part of this work [32], we introduce a convex parabolic relaxation for quadratically-constrained quadratic programs, along with a sequential penalized parabolic relaxation algorithm to recover near-optimal f…

On the Exactness of Dantzig-Wolfe Relaxation for Rank Constrained Optimization Problems

2022-10-28 · Yongchun Li, Weijun Xie

In the rank-constrained optimization problem (RCOP), it minimizes a linear objective function over a prespecified closed rank-constrained domain set and $m$ generic two-sided linear matrix inequalities. Motivated by the …

Constrained Least Squares, SDP, and QCQP Perspectives on Joint Biconvex Radar Receiver and Waveform design

2018-02-19

Joint radar receive filter and waveform design is non-convex, but is individually convex for a fixed receiver filter while optimizing the waveform, and vice versa. Such classes of problems are fre- quently encountered in…

Parabolic Relaxation for Quadratically-constrained Quadratic Programming -- Part I: Definitions & Basic Properties

2022-08-07 · Ramtin Madani, Mersedeh Ashraphijuo, Mohsen Kheirandishfard, Alper Atamturk

For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original …