Copertina

Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bienstock, Daniel, Villagra, Matias
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Accurate Linear Cutting-Plane Relaxations for ACOPF
di: Bienstock, Daniel, et al.
Pubblicazione: (2023)

Advanced Cutting-Plane Algorithms for ACOPF
di: Bienstock, Daniel, et al.
Pubblicazione: (2025)

A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
di: Romero, Matías, et al.
Pubblicazione: (2025)

A Dynamic Relaxation Framework for Global Solution of ACOPF
di: Tang, Yu-Yang, et al.
Pubblicazione: (2025)

Warm-Startable Progressive Integrality Outer-Inner Approximation for AC Unit Commitment with Conic Formulation
di: Dai, Yongzheng
Pubblicazione: (2026)

De-risking solutions to optimization problems
di: Bienstock, Daniel, et al.
Pubblicazione: (2026)

Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
di: Zhang, Xuefeng, et al.
Pubblicazione: (2024)

Synergizing Machine Learning with ACOPF: A Comprehensive Overview
di: Zhao, Meng, et al.
Pubblicazione: (2024)

Probabilistic Modeling versus Robust Optimization: A tutorial based on a humanitarian logistics use case
di: Kilb, Justin, et al.
Pubblicazione: (2026)

Linear Programming Hierarchies Collapse under Symmetry
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints
di: Rafiei, Saba, et al.
Pubblicazione: (2026)

Bucketized Active Sampling for Learning ACOPF
di: Klamkin, Michael, et al.
Pubblicazione: (2022)

Relax-and-Cut for Temporal SCUC Decomposition
di: Xiong, Jinxin, et al.
Pubblicazione: (2025)

Solving convex QPs with structured sparsity under indicator conditions
di: Bienstock, Daniel, et al.
Pubblicazione: (2024)

Cutting Planes for Binarized Network Flow Problems
di: Bonami, Pierre, et al.
Pubblicazione: (2025)

Risk-Aware Security-Constrained Unit Commitment: Taming the Curse of Real-Time Volatility and Consumer Exposure
di: Bienstock, Daniel, et al.
Pubblicazione: (2023)

Virtual Trading in Multi-Settlement Electricity Markets
di: Capponi, Agostino, et al.
Pubblicazione: (2025)

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
di: van Rossum, Bart, et al.
Pubblicazione: (2026)

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations
di: Bugosen, Sergio I., et al.
Pubblicazione: (2024)

On the Strength of Linear Relaxations in Ordered Optimization
di: Blanco, Víctor, et al.
Pubblicazione: (2025)

A Parallelized Cutting-Plane Algorithm for Computationally Efficient Modelling to Generate Alternatives
di: Lau, Michael, et al.
Pubblicazione: (2025)

Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids
di: Nguyen, Duong Thuy Anh, et al.
Pubblicazione: (2026)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
di: Qiu, Yeqing, et al.
Pubblicazione: (2024)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
di: Shah, Prachi, et al.
Pubblicazione: (2024)

Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
di: Lozano, Leonardo, et al.
Pubblicazione: (2024)

Tightening QC Relaxations of AC Optimal Power Flow through Improved Linear Convex Envelopes
di: Narimani, Mohammad Rasoul, et al.
Pubblicazione: (2023)

Dual Acceleration for Minimax Optimization: Linear Convergence Under Relaxed Assumptions
di: Li, Jingwang, et al.
Pubblicazione: (2025)

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
di: Kelley, Shannon, et al.
Pubblicazione: (2025)

Sufficient A Priori Conditions for the Linear Relaxation of the Energy Storage Scheduling Problem
di: Prat, Eléa, et al.
Pubblicazione: (2025)

Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
di: Zhang, Erica, et al.
Pubblicazione: (2024)

Progressive Bound Strengthening via Doubly Nonnegative Cutting Planes for Nonconvex Quadratic Programs
di: Qu, Zheng, et al.
Pubblicazione: (2025)

Filtering-Linearization: A First-Order Method for Nonconvex Trajectory Optimization with Filter-Based Warm-Starting
di: Yuan, Minsen, et al.
Pubblicazione: (2024)

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
di: Mana, Kyle, et al.
Pubblicazione: (2023)

Learning Cuts via Enumeration Oracles
di: Thuerck, Daniel, et al.
Pubblicazione: (2023)

A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
di: Yang, Lujie, et al.
Pubblicazione: (2025)

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
di: Zhou, Duo, et al.
Pubblicazione: (2024)

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
di: Bhattacharyya, Bikrant, et al.
Pubblicazione: (2025)

MIP Relaxations in Factorable Programming
di: He, Taotao, et al.
Pubblicazione: (2023)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
di: Anderson, Brendon G., et al.
Pubblicazione: (2021)

Deepest Cuts for Benders Decomposition
di: Hosseini, Mojtaba, et al.
Pubblicazione: (2021)