AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5802/ojmo.17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4308115151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility-Based Bounds Tightening via Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming formulations for the alternating current optimal power flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5871911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong SOCP Relaxations for the Optimal Power Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary proof for Sion's minimax theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank

Latest revision as of 19:25, 30 July 2024

scientific article
Language Label Description Also known as
English
AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
scientific article

    Statements

    AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (English)
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    ACOPF
    0 references
    global optimization
    0 references
    semidefinite programming
    0 references
    mixed-integer linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references