Enhanced SOCR for Tighter Convex Relaxations

• Enhanced SOCR is a conic modeling method that augments basic second-order cone relaxations with design patterns like convex-hull tightening and adaptive cut generation.
• It improves the approximation of underlying nonconvex, semidefinite, or higher-order structures while preserving SOCP tractability in applications such as power systems, QCQP, and polynomial optimization.
• The approach balances tighter relaxations with computational efficiency, achieving near-exact reformulations in structured settings and demonstrating significant performance gains over plain SOCR.

Searching arXiv for the papers on arXiv and closely related second-order cone relaxation work. Enhanced second-order cone relaxation (SOCR) denotes a strengthened conic modeling paradigm in which a baseline second-order cone relaxation is augmented so that it remains computationally tractable while representing an underlying nonconvex, semidefinite, or higher-order structure more faithfully. Across the cited literature, the expression is application-dependent rather than canonical. This suggests that enhanced SOCR is best understood as a family of design patterns: convex-hull strengthening, polyhedral outer approximation of SOCs, local positive-semidefinite block enforcement, scaled diagonally dominant surrogates, adaptive cut generation, sparsity-aware decomposition, moment-based consistency constraints, and, in some structured settings, exact second-order cone representability rather than mere approximation (Li et al., 2021, Huber et al., 2024, Ahmadi et al., 2015).

1. Scope and representative meanings

In the cited literature, enhanced SOCR appears in power systems, nonconvex quadratic programming, polynomial and semialgebraic optimization, and quantum many-body optimization. The baseline object being relaxed differs sharply across these domains: AC branch-flow equations, lifted-voltage semidefinite formulations, SOS/SDP cones, mutually consistent reduced density matrices, and sparse continuous QCQPs over the unit hypercube. What remains stable is the operational objective: preserve second-order cone tractability while substantially reducing the looseness of a plain SOCR.

Domain	Baseline relaxation target	Enhancement mechanism
Active distribution networks	DistFlow SOCR	Convex hull tightening, polyhedral SOC approximation, adaptive constraint generation
AC optimal power flow	Principal-minor or branch-flow SOCR	3-cycle SOCs, $3\times 3$ PSD minors, RLT, Taylor terms, rolling cuts
SOS/SDP and polynomial optimization	SOS or SDP cone approximations	SDSOS/SDD constraints, bounded-degree hierarchies, basis pursuit
Sparse QCQP	Lifted bilinear/quadratic hulls	RLT extension, perspective SOCs, plus-loop decomposition, aggregate sparsity
Quantum Max Cut	3-qubit RDM positivity	Exact triangle SOCs from Lieb–Mattis and Parekh–Thompson inequalities, plus Pauli level-1

A recurring distinction is between enhanced SOCR as a tighter outer approximation and enhanced SOCR as an exact lifted reformulation. In dispatchable-region construction for radial distribution grids, the final object is explicitly an outer approximation of the true feasible uncertainty set (Li et al., 2021). By contrast, in first-order SDSOS-convex semi-algebraic optimization, under suitable assumptions the associated SOCP has the same optimal value and recovers optimal solutions of the original problem (Yang et al., 9 Sep 2025).

2. Recurring mathematical constructions

The most basic technical ingredient is the conversion of a quadratic or $2\times 2$ positive-semidefinite relation into an SOC constraint. In radial branch-flow models, the nonconvex equality

$P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$

is relaxed to

$$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$

or equivalently

$$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$

The cited distribution-network formulation then strengthens this rotated SOC by adding supporting hyperplanes derived from current and apparent-power limits, and further replaces the cone by a polyhedral outer approximation for linear tractability (Li et al., 2021).

A second mechanism is the extraction of new SOC inequalities from larger PSD objects. In meshed AC-OPF, standard principal-minor SOCR uses only $2\times 2$ minors: $|W_{ij}|^2 \le W_{ii}W_{jj}.$ The 3-cycle enhancement instead derives SOC families from $3\times 3$ Hermitian PSD submatrices indexed by network triangles, using the complex extension of the Kim–Kojima–Yamashita inequality

$(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$

thereby coupling the three edges of a cycle without introducing explicit polar-angle variables (Geth et al., 2021).

A third mechanism is replacement of full PSD constraints by scaled diagonally dominant structure. For SDSOS formulations, a symmetric $2\times 2$ block

$2\times 2$0

is enforced by

$2\times 2$1

which converts an SOS or SDP condition into an SOCP-compatible constraint system (Ahmadi et al., 2015).

A fourth mechanism is decomposition of an indefinite quadratic into SOC-representable pieces followed by RLT-type strengthening. For nonconvex QCQP, the GSRT framework splits each indefinite quadratic constraint into two SOC constraints and then linearizes products of SOC constraints with linear constraints, as well as SOC×SOC products and selected Hadamard/Kronecker constructions (Jiang et al., 2016). This pushes SOCR beyond plain Shor-type lifting, particularly when multiple nonconvex quadratic constraints are present.

A fifth mechanism is exact local marginal consistency. In quantum Max Cut, positivity of a real, unitary-invariant 3-qubit state is characterized exactly by the Lieb–Mattis linear inequality

$2\times 2$2

and the Parekh–Thompson inequality

$2\times 2$3

which is written as a standard SOC constraint on the three swap expectations of a triangle. This yields an SOCR over mutually consistent 3-qubit marginals without materializing $2\times 2$4 PSD matrices (Huber et al., 2024).

These constructions show that enhancement is rarely a single extra inequality. It is more often a structural upgrade that imports information from convex hulls, cycle geometry, moment consistency, local irreducible representations, or decomposition identities into an SOCP-compatible form.

3. Power-system formulations

In active distribution networks, enhanced SOCR has been used to construct dispatchable regions under renewable uncertainty directly from AC branch-flow equations. The exact dispatchable region is

$2\times 2$5

where $2\times 2$6 encodes DistFlow equations, line limits, voltage limits, and generator ramping/capacity limits. The cited method relaxes the current–power equality to SOC form, strengthens it by the SOC-based convex hull of branch variables $2\times 2$7, replaces SOCs by polyhedral outer approximations, and constructs the boundary of the region through adaptive constraint generation. On the modified IEEE 33-bus 2D case, the reported effective percentage is $2\times 2$8 for $2\times 2$9 versus $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$0 for the linearized AC region, while computation time is $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$1 s for $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$2 and $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$3 s for sampled AC reference construction; in larger 3D cases the method fully covers the exact region with reported EP values $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$4, $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$5, and $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$6 on 33-, 69-, and 141-bus systems, respectively (Li et al., 2021).

In AC optimal power flow, one line of enhancement augments principal-minor SOCR by explicit 3-cycle SOCs derived from $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$7 PSD submatrices in the lifted-voltage model. For each triangle, the added constraints specialize the complex Hermitian KKY inequality and recover the ordinary $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$8 PM-SOC when the free parameter $P_{ij}^2 + Q_{ij}^2 = v_i \ell_{ij}$9 is set to zero. The reported numerical illustration shows that the resulting “Kim+PM SOC” improves over PM-SOC on case3_lmbd, case5_pjm, and case14_ieee, including elimination of the $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$0 PM-SOC gap on IEEE 14 (Geth et al., 2021).

A second line of enhancement combines small PSD blocks with RLT-like voltage information. The “tight-and-cheap” relaxation introduces $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$1 PSD constraints

$$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$2

for each line, together with slack-bus RLT inequalities. Its stronger variant uses $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$3 minors of $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$4 involving the slack bus. On MATPOWER cases up to 6515 buses, the reported average optimality gaps under loss minimization are $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$5 for SOCR, $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$6 for TCR, $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$7 for STCR, and $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$8 for CHR/SDR, with average solve times approximately $$P_{ij}^2 + Q_{ij}^2 \le v_i \ell_{ij}, \qquad v_i \ge 0,\;\ell_{ij} \ge 0,$$9 s, $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$0 s, $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$1 s, $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$2 s, and $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$3 s, respectively (Bingane et al., 2019).

A third line of enhancement targets wind-integrated AC-OPF. There, second-order Taylor expansions of the trigonometric terms are combined with SOC relaxations for voltage products and angle-square surrogates, and a rolling cutting plane technique adds local cuts

$$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$4

$$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$5

On IEEE 118, the reported maximum branch-flow errors are $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$6 p.u. for active power and $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$7 p.u. for reactive power for the proposed method, compared with $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$8 p.u. and $$\big\|[\,2P_{ij},\,2Q_{ij},\,v_i-\ell_{ij}\,]\big\|_2 \le v_i+\ell_{ij}.$$9 p.u. for the linear cold-start baseline, and $2\times 2$0 p.u. and $2\times 2$1 p.u. for the SOCR cold-start baseline. On PEGASE 1354-bus, the reported wind-integrated solve time is approximately $2\times 2$2 s, with post-AC restoration errors below $2\times 2$3 p.u. (Ruan et al., 17 Aug 2025).

Power-system work also exposes a central caveat: tight local SOC constraints do not automatically imply globally AC-feasible angles in meshed networks. The 2026 letter on angle recovery emphasizes the cycle consistency condition

$2\times 2$4

for every cycle and shows that replacing nonlinear KVL phase equations by linearized angle relations does not guarantee recovery of nodal voltage angles in meshed grids. In the reported IEEE 39-bus experiment, the least-squares residual for cycle-inconsistent branch angles reaches $2\times 2$5 degrees, with resulting branch power-flow errors on the order of $2\times 2$6 p.u. (Larroux et al., 18 Feb 2026).

4. Polynomial, QCQP, and SDP/SOS surrogates

In polynomial optimization, a major enhanced-SOCR line replaces PSD Gram matrices by diagonally dominant or scaled diagonally dominant structure. For a polynomial $2\times 2$7, DSOS requires $2\times 2$8 to be diagonally dominant, whereas SDSOS requires $2\times 2$9 to be scaled diagonally dominant. The basis-pursuit scheme iteratively changes basis $|W_{ij}|^2 \le W_{ii}W_{jj}.$0 so that the transformed Gram matrix $|W_{ij}|^2 \le W_{ii}W_{jj}.$1 is more likely DD or SDD. For minimization SDPs, the update is $|W_{ij}|^2 \le W_{ii}W_{jj}.$2; for maximization SDPs, it is driven by the Cholesky factor of the dual slack. The paper proves monotonic improvement and reports that, on the complement of the Petersen graph, DSOS/SDSOS iterative bounds approach Lovász theta rapidly, while on 100 Erdős–Rényi graphs with $|W_{ij}|^2 \le W_{ii}W_{jj}.$3 and $|W_{ij}|^2 \le W_{ii}W_{jj}.$4, SDSOS$|W_{ij}|^2 \le W_{ii}W_{jj}.$5 already attains $|W_{ij}|^2 \le W_{ii}W_{jj}.$6 success under the paper’s “within 1 unit of $|W_{ij}|^2 \le W_{ii}W_{jj}.$7” criterion (Ahmadi et al., 2015).

A related line develops bounded-degree SOCP hierarchies for global polynomial optimization. The hierarchy keeps the size and number of SOC and SDP blocks fixed with respect to the hierarchy level and uses Krivine–Stengle certificates together with SDSOS polynomials. Under Assumption A, the reported result is convergence of both the mixed SDP–SOCP hierarchy and the pure SOCP hierarchy to the global optimum. The paper further proves one-step exactness for problems with SOCP-convex polynomials and for a class with essentially non-positive coefficients, and uses a Jensen-type inequality to recover global solutions from the dual moment relaxation (Chuong et al., 2017).

For nonconvex QCQP, enhanced SOCR appears as GSRT. Each indefinite quadratic constraint is decomposed into two SOC constraints, and then strengthened with RLT-like products of SOC constraints with linear constraints, products of two SOC constraints, and selected Hadamard or Kronecker LMI constructions. The paper reports consistent bound improvements over SDP, RLT, and SOC-RLT baselines, including instances where GSRT-A and GSRT-B attain the exact optimal value (Jiang et al., 2016).

A different exactness route arises in sparse QCQPs over the unit hypercube. There, the proposed RLT extension for continuous quadratic sets produces perspective-based SOC inequalities for plus-loop variables. If $|W_{ij}|^2 \le W_{ii}W_{jj}.$8, the set of nodes with positive diagonal terms, is a stable set of the sparsity graph $|W_{ij}|^2 \le W_{ii}W_{jj}.$9, then $3\times 3$0 is SOC-representable. Under tree-decomposition conditions labeled (C1)–(C3), the paper establishes a polynomial-size SOC-representable formulation constructible in polynomial time, and states that the optimal value of the nonconvex quadratic program coincides with that of a polynomial-size SOCP (Dey et al., 25 Aug 2025).

Sparsity can also enhance a fixed SOCR without changing its bound. For lifted QCQPs, replacing full edgewise $3\times 3$1 PSD constraints by those indexed only by the aggregate sparsity graph $3\times 3$2 yields the sparse cone $3\times 3$3. The paper proves equality of optimal values between the full and sparse SOCR and shows that zero-filling unspecified off-diagonals preserves a max-determinant property in the SOCR sense. On lattice QCQPs and pooling problems, sparse SOCR substantially reduces the number of SOCs and solve times while retaining the same objective value as the SDP relaxation on the tested instances (Sheen et al., 2019).

5. Quantum, geometric, and exact SOC-representable settings

In quantum Max Cut, enhanced SOCR does not simply approximate PSD constraints; it exploits an exact representation of 3-qubit positivity in terms of triangle SOCs. For each triple $3\times 3$4, the swap expectations $3\times 3$5 satisfy the Lieb–Mattis linear inequality and the Parekh–Thompson SOC inequality

$3\times 3$6

The enhanced version adds a global Pauli level-1 moment matrix $3\times 3$7 of size $3\times 3$8 with $3\times 3$9 and $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$0. The resulting relaxation is reported to achieve an approximation ratio of $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$1 to the ground-state energy and to be solvable on lattices with up to 256 qubits, whereas optimized SWAP-based hierarchies become impractical beyond tens of qubits (Huber et al., 2024).

Another direction studies when an SOCR is exact because the target cone itself is SOC-representable. One result shows that every Nash-smooth hyperbolicity cone is second-order cone representable, strengthening the earlier spectrahedral-shadow statement for smooth hyperbolicity cones. The proof proceeds through tensor evaluation and establishes that every compact convex semialgebraic set with Nash-smooth boundary and strictly positive curvature admits a lifted LMI with blocks of size at most $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$2, hence an SOC lift (Scheiderer, 21 Sep 2025).

A more local exactness result concerns slices of $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$3. A slice $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$4 is SOC-representable if and only if $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$5 or $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$6 is orthogonal to a nonzero singular matrix. Equivalently, a 5-dimensional slice is SOC-representable precisely when it is orthogonal to a nonzero singular indefinite $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$7. This yields explicit $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$8-lifts for slices such as $(c^{H} a)^{H}(c^{H} a) \le \alpha\,(C\bullet A),$9, and simultaneously delineates a boundary: the full cone $2\times 2$0 is not SOC-representable (Averkov, 2019).

Convexification results for intersections of an SOCr cone and a nonconvex quadratic provide another exact template. For sets $2\times 2$1 and $2\times 2$2, with $2\times 2$3 SOCr and $2\times 2$4 a homogeneous quadratic cone, the aggregation $2\times 2$5 is traced up to a critical parameter $2\times 2$6 at which $2\times 2$7 becomes singular while maintaining exactly one negative eigenvalue. The resulting $2\times 2$8 yields $2\times 2$9, and under Conditions 1–4 the paper proves

$2\times 2$00

with an analogous convex-hull statement on affine cross-sections under Condition 5 (Burer et al., 2014).

Exact enhanced SOCR also appears in semialgebraic convex optimization. For first-order SDSOS-convex semi-algebraic functions, the associated SOCP

$2\times 2$01

uses SDSOS certificates and SDD matrix representations of compact uncertainty sets $2\times 2$02. Under assumption $2\times 2$03, the paper proves equality of the primal optimum and the SOCP optimum; under the additional strictness condition $2\times 2$04, the moment dual $2\times 2$05 also has the same value, and the optimizer is recovered as $2\times 2$06 (Yang et al., 9 Sep 2025).

6. Exactness, trade-offs, and limitations

A persistent theme is that enhancement improves but does not automatically eliminate relaxation error. In distribution-network dispatchable-region construction, the polyhedral SOC approximation quality improves with the number of facets $2\times 2$07, with empirical guidance that $2\times 2$08 yields a high-quality region at modest cost. The same paper reports that, on the 141-bus system, the effective percentage of $2\times 2$09 decreases from $2\times 2$10 to $2\times 2$11 as the number of renewable units grows from 1 to 5, while computation time increases from $2\times 2$12 s to $2\times 2$13 s (Li et al., 2021).

In AC-OPF, enhancement frequently improves principal-minor SOCR, but sampling and topology matter. The 3-cycle method is strictly stronger than PM-SOC, yet the paper explicitly notes that a finite sample of $2\times 2$14 values does not in general recover all $2\times 2$15 PSD conditions, so the formulation may remain weaker than full SDP (Geth et al., 2021). The “tight-and-cheap” family narrows gaps dramatically, but its strongest version still remains dominated by SDR except under the specific topology condition that the graph obtained by removing the slack bus is acyclic (Bingane et al., 2019). The 2026 angle-recovery letter pushes the limitation further: a zero or small local relaxation gap does not certify cycle-consistent AC-feasible angles in meshed networks (Larroux et al., 18 Feb 2026).

In SOS/SDSOS and QCQP settings, enhancement often trades expressive power for scalability. Basis pursuit improves SDSOS and DSOS bounds without increasing per-iteration problem size, but the paper also documents slow convergence and failure modes on partition instances, including trivial odd-sum cases lying on the boundary of the SOS cone (Ahmadi et al., 2015). The bounded-degree SOCP hierarchy is globally convergent, yet one-step exactness requires SOCP-convexity or essentially non-positive coefficients (Chuong et al., 2017). The GSRT framework strengthens QCQP relaxations substantially, but the strongest product and LMI variants can be computationally heavy, so the paper recommends selective or dynamic cut generation (Jiang et al., 2016).

Quantum and geometric exactness results likewise come with structural hypotheses. The QMC triangle SOCR captures exact 3-body feasibility but does not include the star constraints available at Pauli level-2; the paper identifies this as a source of looseness on dense or highly frustrated graphs (Huber et al., 2024). Nash-smooth hyperbolicity cones are SOCr, but the cited work does not claim universality for all hyperbolicity cones, and explicitly notes that it is unknown whether there exist hyperbolicity cones that are not SOCr (Scheiderer, 21 Sep 2025). The slice classification for $2\times 2$16 is exact, but it simultaneously proves that some 5-dimensional slices and the full $2\times 2$17 cone are not SOC-representable (Averkov, 2019).

Taken together, these results suggest a precise interpretation of enhanced SOCR. It is neither a single algorithm nor a uniform hierarchy. It is a structural methodology for importing just enough information from nonconvex, semidefinite, or high-order models into second-order cone form to obtain a materially tighter relaxation—or, under favorable algebraic, geometric, or sparsity conditions, an exact conic reformulation.