Copertina

Comparative Evaluation of SDP, SOCP, and QC Convex Relaxations for Large-Scale Market-Based AC Optimal Power Flow

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Keskin, Ata
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 90C26, 90C22 G.1.6; G.3; J.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
di: Neira, David E. Bernal, et al.
Pubblicazione: (2021)

OPM, a collection of Optimization Problems in Matlab
di: Gratton, Serge, et al.
Pubblicazione: (2021)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
di: Fu, Wenhao, et al.
Pubblicazione: (2023)

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

Anisotropic Gaussian Smoothing for Gradient-based Optimization
di: Starnes, Andrew, et al.
Pubblicazione: (2024)

Adaptive Methods for Multiobjective Unit Commitment
di: Tevruez, Ece, et al.
Pubblicazione: (2025)

Last-iterate Convergence of ADMM on Multi-affine Quadratic Equality Constrained Problem
di: Chao, Yutong, et al.
Pubblicazione: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
di: Bui, Quang Minh, et al.
Pubblicazione: (2022)

Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification
di: Ueda, Ryota, et al.
Pubblicazione: (2025)

Natural Gradient VI: Guarantees for Non-Conjugate Models
di: Sun, Fangyuan, et al.
Pubblicazione: (2025)

Quadratic Programming over Linearly Ordered Fields: Decidability and Attainment of Optimal Solutions
di: Plutenko, Dmytro O.
Pubblicazione: (2026)

Multi-Objective Optimization with Desirability and Morris-Mitchell Criterion
di: Bartz-Beielstein, Thomas, et al.
Pubblicazione: (2025)

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2024)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
di: Circelli, Michele
Pubblicazione: (2026)

Global Optimality for Constrained Exploration via Penalty Regularization
di: Wolf, Florian, et al.
Pubblicazione: (2026)

Adaptive Conditional Forest Sampling for Spectral Risk Optimisation under Decision-Dependent Uncertainty
di: Kurbucz, Marcell T.
Pubblicazione: (2026)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
di: Gao, Yan, et al.
Pubblicazione: (2025)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
di: Yildirim, E. Alper
Pubblicazione: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
di: Gratton, Serge, et al.
Pubblicazione: (2026)

Refining Graphical Neural Network Predictions Using Flow Matching for Optimal Power Flow with Constraint-Satisfaction Guarantee
di: Khanal, Kshitiz
Pubblicazione: (2025)

A Structured Tour of Optimization with Finite Differences
di: Rando, Marco, et al.
Pubblicazione: (2025)

Adaptive direct search algorithms for constrained optimization
di: Audet, Charles, et al.
Pubblicazione: (2025)

A cutting plane algorithm for globally solving low dimensional k-means clustering problems
di: Ryner, Martin, et al.
Pubblicazione: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
di: Hikima, Yuya, et al.
Pubblicazione: (2024)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
di: Cheng, Cong-Dian
Pubblicazione: (2017)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
di: Warme, David M.
Pubblicazione: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
di: Warme, David M.
Pubblicazione: (2024)

Iterative Exploration-Driven Sparse SDP Clustering via Thompson Sampling
di: Mun, Jongmin, et al.
Pubblicazione: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Axis-Aligned Relaxations for Mixed-Integer Nonlinear Programming
di: Zhu, Haisheng, et al.
Pubblicazione: (2026)

Where's Ben Nevis? A 2D optimisation benchmark with 957,174 local optima based on Great Britain terrain data
di: Wei, Yuhang, et al.
Pubblicazione: (2024)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
di: Li, Zijun, et al.
Pubblicazione: (2026)

Multi-Objective Optimization and Hyperparameter Tuning With Desirability Functions
di: Bartz-Beielstein, Thomas
Pubblicazione: (2025)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
di: Gratton, S., et al.
Pubblicazione: (2022)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
di: Morinaga, Daiki, et al.
Pubblicazione: (2022)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
di: Schwientek, Jan, et al.
Pubblicazione: (2025)