Acceleration of Moment Bound Optimization for Stochastic Chemical Reactions Using Reaction-wise Sparsity of Moment Equations

Antonis Papachristodoulou; Tomoki Sadatoshi; Yutaka Hori

arxiv: 2604.03791 · v1 · submitted 2026-04-04 · 🧮 math.OC · cs.SY· eess.SY· q-bio.QM

Acceleration of Moment Bound Optimization for Stochastic Chemical Reactions Using Reaction-wise Sparsity of Moment Equations

Tomoki Sadatoshi , Antonis Papachristodoulou , Yutaka Hori This is my paper

Pith reviewed 2026-05-13 17:24 UTC · model grok-4.3

classification 🧮 math.OC cs.SYeess.SYq-bio.QM

keywords moment boundssemidefinite programmingsparsity exploitationstochastic chemical kineticschemical reaction networksmatrix decompositionstationary moments

0 comments

The pith

Reaction-wise sparsity permits decomposition of semidefinite constraints into smaller blocks for moment bound optimization in stochastic chemical kinetics.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper seeks to reduce the computational burden of using semidefinite programming to bound stationary moments in stochastic chemical reaction networks. Moment equations form an infinite hierarchy where lower moments depend on higher ones, and the associated semidefinite constraints grow combinatorially large with the number of species. Each reaction only couples a small subset of species, inducing a sparsity pattern across the moment equations. Exploiting this pattern allows the large semidefinite constraints to be decomposed into smaller independent blocks that preserve validity and tightness of the bounds. The result is a smaller semidefinite program that can be solved at lower cost while still delivering practically useful moment bounds.

Core claim

The sparsity structure of the moment equations, determined by the reactant species of each reaction, permits a matrix decomposition that breaks the original semidefinite constraints into smaller block constraints. This decomposition yields an equivalent but computationally lighter semidefinite program for computing guaranteed upper and lower bounds on stationary moments.

What carries the argument

Reaction-wise sparsity pattern of the moment equations, which identifies the variable subsets involved in each reaction and enables block decomposition of the semidefinite constraints.

If this is right

Larger reaction networks become tractable for stationary moment bounding.
The computed bounds remain valid upper and lower estimates on the true stationary moments.
Computational cost scales with the size of the reaction-induced blocks rather than the full moment space.
The method applies directly to any stationary moment bounding problem formulated as an SDP.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same sparsity pattern may allow decomposition for time-varying moment bounds if the differential equations preserve the block structure.
The approach could transfer to other sparse polynomial optimization problems arising in systems biology.
Numerical tests on realistic biochemical networks would quantify the actual runtime reduction for high-dimensional cases.

Load-bearing premise

The sparsity pattern induced by individual reactions permits a decomposition of the semidefinite constraints that keeps the bounds valid and tight without introducing extra conservatism.

What would settle it

Solve the original and decomposed semidefinite programs on a small, fully enumerated reaction network and check whether the decomposed version produces strictly weaker moment bounds or violates feasibility of the original constraints.

Figures

Figures reproduced from arXiv: 2604.03791 by Antonis Papachristodoulou, Tomoki Sadatoshi, Yutaka Hori.

**Figure 3.** Figure 3: Block arrow pattern of the coefficient matrices [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗

**Figure 2.** Figure 2: Comparison before and after matrix decomposition [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗

read the original abstract

Moment dynamics in stochastic chemical kinetics often involve an infinite chain of coupled equations, where lower-order moments depend on higher-order ones, making them analytically intractable. Moment bounding via semidefinite programming provides guaranteed upper and lower bounds on stationary moments. However, this formulation suffers from the rapidly growing size of semidefinite constraints due to the combinatorial growth of moments with the number of molecular species. In this paper, we propose a sparsity-exploiting matrix decomposition method for semidefinite constraints in stationary moment bounding problems to reduce the computational cost of the resulting semidefinite programs. Specifically, we characterize the sparsity structure of moment equations, where each reaction involves only a subset of variables determined by its reactants, and exploit this structure to decompose the semidefinite constraints into smaller ones. We demonstrate that the resulting formulation reduces the computational cost of the optimization problem while providing practically useful bounds.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The reaction-wise sparsity decomposition for SDP moment bounds looks workable for scaling but needs explicit checks that it does not relax the feasible set.

read the letter

The core contribution here is a decomposition that splits the large semidefinite constraint on the moment matrix into smaller per-reaction blocks by using the fact that each reaction only involves a subset of the species. This targets the combinatorial growth that makes stationary moment bounding SDPs expensive for networks with more than a handful of species. The approach builds on existing SDP moment bounding frameworks but adds a structure-specific step that exploits the reaction graph directly rather than applying a generic sparsity pattern. That is the part that feels new relative to the cited literature on moment closure and bounding. The write-up does a clear job laying out how the moment equations inherit sparsity from the reaction stoichiometry and why that permits the block decomposition. The claim that the resulting program stays cheaper while still delivering practically useful bounds is plausible given the problem size growth. The main soft spot is whether the decomposed constraints are equivalent to the original PSD constraint or whether their intersection is a strict relaxation. The abstract only says the bounds remain practically useful, without a proof that the feasible set is unchanged or numerical comparisons on small networks where both versions can be solved. If the decomposition loosens the bounds by more than a small amount, the computational saving comes at a cost that users need to know. Minor additional point: any extra overhead from assembling or solving the block system should be quantified, though that is secondary. This is aimed at people already working with SDP-based moment methods in stochastic chemical kinetics who need to push to larger models. A reader who cares about computational scaling in systems biology would get concrete value from the algorithmic idea. I would send it to peer review because the scaling problem is real and the proposed fix is specific enough to be checked and improved.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes a sparsity-exploiting matrix decomposition method for semidefinite constraints in stationary moment bounding problems for stochastic chemical reactions. It characterizes the reaction-wise sparsity structure of the moment equations, where each reaction affects only a subset of species determined by its reactants, and exploits this to decompose the large semidefinite constraints into smaller per-reaction blocks, claiming to reduce the computational cost of the resulting SDPs while providing practically useful bounds on stationary moments.

Significance. If the decomposition is shown to preserve the feasible set of the original SDP (or to introduce only controllable conservatism with tightness guarantees), the approach could meaningfully extend the applicability of moment-bound optimization to larger reaction networks by addressing the combinatorial scaling of moment matrices, which is a recognized bottleneck in the field.

major comments (2)

[Abstract] Abstract: the claim that the method 'reduces the computational cost of the optimization problem while providing practically useful bounds' is presented without numerical evidence, error bounds, or a proof sketch that the block decomposition recovers the original PSD cone. The intersection of the smaller per-reaction PSD constraints may constitute a relaxation, which would loosen the moment bounds; this is load-bearing for the central assertion of practical utility.
The manuscript provides no explicit characterization or theorem establishing that the reaction-wise sparsity pattern permits an exact (non-relaxing) decomposition of the semidefinite constraint; without this, the validity of the resulting bounds relative to the monolithic SDP remains unverified.

minor comments (1)

[Abstract] Abstract: a short illustrative example of the sparsity pattern or the resulting block structure would help readers assess the decomposition at a glance.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. The points raised about supporting evidence and formal characterization of the decomposition are well-taken, and we will revise the manuscript to strengthen these aspects while preserving the core contribution.

read point-by-point responses

Referee: [Abstract] Abstract: the claim that the method 'reduces the computational cost of the optimization problem while providing practically useful bounds' is presented without numerical evidence, error bounds, or a proof sketch that the block decomposition recovers the original PSD cone. The intersection of the smaller per-reaction PSD constraints may constitute a relaxation, which would loosen the moment bounds; this is load-bearing for the central assertion of practical utility.

Authors: We agree that the abstract claim requires explicit support. In the revision we will add a short proof sketch (leveraging the block-diagonal structure induced by reactant supports) showing equivalence to the original PSD constraint, together with numerical results on benchmark networks that quantify both the reduction in SDP solve time and the observed tightness of the resulting bounds relative to the monolithic formulation. revision: yes
Referee: The manuscript provides no explicit characterization or theorem establishing that the reaction-wise sparsity pattern permits an exact (non-relaxing) decomposition of the semidefinite constraint; without this, the validity of the resulting bounds relative to the monolithic SDP remains unverified.

Authors: We acknowledge the absence of a dedicated theorem. Section 3 already characterizes the reaction-wise sparsity pattern of the moment equations, but we will insert a new theorem (Theorem 3.2) that formally proves the per-reaction PSD constraints are equivalent to the original constraint because the moment matrix factors into independent blocks according to the disjoint variable supports of each reaction. This establishes that no relaxation is introduced. revision: yes

Circularity Check

0 steps flagged

No circularity: sparsity decomposition builds on standard SDP structure without self-referential reduction

full rationale

The paper's central contribution is a matrix decomposition that exploits the reaction-wise sparsity already present in the moment equations to break large semidefinite constraints into smaller blocks. This step relies on the combinatorial structure of the moment equations (each reaction affects only a subset of species) and standard properties of positive-semidefinite cones; it does not define any quantity in terms of itself, rename a fitted parameter as a prediction, or rest on a load-bearing self-citation whose validity is assumed rather than independently verified. The abstract and method description assert only that the resulting program yields practically useful bounds while lowering computational cost, without claiming equivalence to the monolithic SDP or proving tightness by construction. The derivation chain therefore remains self-contained against external SDP theory and does not reduce any claimed result to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The approach rests on standard mathematical properties of semidefinite programming and the known structure of moment equations in chemical reaction networks; no new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (1)

domain assumption Semidefinite programming yields valid upper and lower bounds on stationary moments of stochastic chemical kinetics
Standard assumption in the moment-bounding literature referenced by the abstract.

pith-pipeline@v0.9.0 · 5470 in / 1219 out tokens · 38428 ms · 2026-05-13T17:24:46.208018+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

[1]

Systems biology: a brief overview,

H. Kitano, “Systems biology: a brief overview,”Science, vol. 295, no. 5560, pp. 1662–1664, 2002

work page 2002
[2]

Del Vecchio and R

D. Del Vecchio and R. M. Murray,Biomolecular feedback systems. Princeton University Press Princeton, NJ, 2015

work page 2015
[3]

Stochastic gene expression in a single cell,

M. B. Elowitz, A. J. Levine, E. D. Siggia, and P. S. Swain, “Stochastic gene expression in a single cell,”Science, vol. 297, no. 5584, pp. 1183–1186, 2002

work page 2002
[4]

A rigorous derivation of the chemical master equa- tion,

D. T. Gillespie, “A rigorous derivation of the chemical master equa- tion,”Physica A: Statistical Mechanics and its Applications, vol. 188, no. 1, pp. 404–425, 1992

work page 1992
[5]

Fast evaluation of fluctuations in biochem- ical networks with the linear noise approximation,

J. Elf and M. Ehrenberg, “Fast evaluation of fluctuations in biochem- ical networks with the linear noise approximation,”Genome research, vol. 13, no. 11, pp. 2475–2484, 2003

work page 2003
[6]

The chemical langevin equation,

D. T. Gillespie, “The chemical langevin equation,”The Journal of Chemical Physics, vol. 113, no. 1, pp. 297–306, 2000

work page 2000
[7]

Cybergenetics: Theory and applications of genetic control systems,

M. H. Khammash, “Cybergenetics: Theory and applications of genetic control systems,”Proceedings of the IEEE, vol. 110, no. 5, pp. 631– 658, 2022

work page 2022
[8]

An extension of the moment closure method,

I. N ˚asell, “An extension of the moment closure method,”Theoretical Population Biology, vol. 64, no. 2, pp. 233–239, 2003

work page 2003
[9]

Moment closure for biochemical networks,

J. Hespanha, “Moment closure for biochemical networks,” inPro- ceedings of 2008 3rd International Symposium on Communications, Control and Signal Processing. IEEE, 2008, pp. 142–147

work page 2008
[10]

Approximate moment dynamics for chemically reacting systems,

A. Singh and J. P. Hespanha, “Approximate moment dynamics for chemically reacting systems,”IEEE Transactions on Automatic Con- trol, vol. 56, no. 2, pp. 414–418, 2010

work page 2010
[11]

A convex approach to steady state moment analysis for stochastic chemical reactions,

Y . Sakurai and Y . Hori, “A convex approach to steady state moment analysis for stochastic chemical reactions,” inProceedings of 2017 IEEE 56th Annual Conference on Decision and Control (CDC). IEEE, 2017, pp. 1206–1211

work page 2017
[12]

Optimization-based synthesis of stochastic biocircuits with statistical specifications,

——, “Optimization-based synthesis of stochastic biocircuits with statistical specifications,”Journal of The Royal Society Interface, vol. 15, no. 138, p. 20170709, 2018

work page 2018
[13]

Interval analysis of worst-case stationary moments for stochas- tic chemical reactions with uncertain parameters,

——, “Interval analysis of worst-case stationary moments for stochas- tic chemical reactions with uncertain parameters,”Automatica, vol. 146, p. 110647, 2022

work page 2022
[14]

Bounds on stochastic chemical kinetic systems at steady state,

G. R. Dowdy and P. I. Barton, “Bounds on stochastic chemical kinetic systems at steady state,”The Journal of Chemical Physics, vol. 148, no. 8, p. 084106, 2018

work page 2018
[15]

Exact lower and upper bounds on stationary moments in stochastic biochemical systems,

K. R. Ghusinga, C. A. Vargas-Garcia, A. Lamperski, and A. Singh, “Exact lower and upper bounds on stationary moments in stochastic biochemical systems,”Physical Biology, vol. 14, no. 4, p. 04LT01, 2017

work page 2017
[16]

Bounding the sta- tionary distributions of the chemical master equation via mathematical programming,

J. Kuntz, P. Thomas, G.-B. Stan, and M. Barahona, “Bounding the sta- tionary distributions of the chemical master equation via mathematical programming,”The Journal of chemical physics, vol. 151, no. 3, p. 034109, 2019

work page 2019
[17]

Moment-based parameter in- ference with error guarantees for stochastic reaction networks,

Z. Li, M. Barahona, and P. Thomas, “Moment-based parameter in- ference with error guarantees for stochastic reaction networks,”The Journal of Chemical Physics, vol. 162, no. 13, 2025

work page 2025
[18]

Bounding transient moments of stochastic chemical reactions,

Y . Sakurai and Y . Hori, “Bounding transient moments of stochastic chemical reactions,”IEEE Control Systems Letters, vol. 3, no. 2, pp. 290–295, 2018

work page 2018
[19]

Dynamic bounds on stochastic chem- ical kinetic systems using semidefinite programming,

G. R. Dowdy and P. I. Barton, “Dynamic bounds on stochastic chem- ical kinetic systems using semidefinite programming,”The Journal of Chemical Physics, vol. 149, no. 7, p. 074103, 2018

work page 2018
[20]

Tighter bounds on transient moments of stochastic chemical systems,

F. Holtorf and P. I. Barton, “Tighter bounds on transient moments of stochastic chemical systems,”Journal of Optimization Theory and Applications, vol. 200, no. 1, pp. 104–149, 2024

work page 2024
[21]

Exploiting sparsity in semidefinite programming via matrix completion i: General framework,

M. Fukuda, M. Kojima, K. Murota, and K. Nakata, “Exploiting sparsity in semidefinite programming via matrix completion i: General framework,”SIAM Journal on optimization, vol. 11, no. 3, pp. 647– 674, 2001

work page 2001
[22]

Chordal-TSSOS: a moment- sos hierarchy that exploits term sparsity with chordal extension,

J. Wang, V . Magron, and J.-B. Lasserre, “Chordal-TSSOS: a moment- sos hierarchy that exploits term sparsity with chordal extension,”SIAM Journal on optimization, vol. 31, no. 1, pp. 114–141, 2021

work page 2021
[23]

Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization,

Y . Zheng, G. Fantuzzi, and A. Papachristodoulou, “Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization,”Annual Reviews in Control, vol. 52, pp. 243–279, 2021

work page 2021
[24]

Exploiting

I. Klep, V . Magron, T. Metzlaff, and J. Wang, “Exploiting term sparsity in symmetry-adapted basis for polynomial optimization,” arXiv preprint arXiv:2511.18019, 2025

work page arXiv 2025
[25]

Nesterov,Introductory lectures on convex optimization: A basic course

Y . Nesterov,Introductory lectures on convex optimization: A basic course. Springer Science & Business Media, 2013, vol. 87

work page 2013
[26]

Synthetic protein-binding dna sponge as a tool to tune gene expression and mitigate protein toxicity,

X. Wan, F. Pinto, L. Yu, and B. Wang, “Synthetic protein-binding dna sponge as a tool to tune gene expression and mitigate protein toxicity,” Nature communications, vol. 11, no. 1, p. 5961, 2020

work page 2020
[27]

arXiv preprint arXiv:2405.12762 (2 024)

P. J. Goulart and Y . Chen, “Clarabel: An interior-point solver for conic programs with quadratic objectives,”arXiv preprint arXiv:2405.12762, 2024

work page arXiv 2024
[28]

A clique graph based merging strategy for decomposable SDPs,

M. Garstka, M. Cannon, and P. Goulart, “A clique graph based merging strategy for decomposable SDPs,”IFAC-PapersOnLine, vol. 53, no. 2, pp. 7355–7361, 2020

work page 2020
[29]

Positive definite completions of partial hermitian matrices,

R. Grone, C. R. Johnson, E. M. S ´a, and H. Wolkowicz, “Positive definite completions of partial hermitian matrices,”Linear algebra and its applications, vol. 58, pp. 109–124, 1984. APPENDIX A. Definition ofΦ i Fix a reaction indexiand consider the propensity func- tionw i(x). For zero-th order, unimolecular, and homo- bimolecular reactions (see Table I),...

work page 1984

[1] [1]

Systems biology: a brief overview,

H. Kitano, “Systems biology: a brief overview,”Science, vol. 295, no. 5560, pp. 1662–1664, 2002

work page 2002

[2] [2]

Del Vecchio and R

D. Del Vecchio and R. M. Murray,Biomolecular feedback systems. Princeton University Press Princeton, NJ, 2015

work page 2015

[3] [3]

Stochastic gene expression in a single cell,

M. B. Elowitz, A. J. Levine, E. D. Siggia, and P. S. Swain, “Stochastic gene expression in a single cell,”Science, vol. 297, no. 5584, pp. 1183–1186, 2002

work page 2002

[4] [4]

A rigorous derivation of the chemical master equa- tion,

D. T. Gillespie, “A rigorous derivation of the chemical master equa- tion,”Physica A: Statistical Mechanics and its Applications, vol. 188, no. 1, pp. 404–425, 1992

work page 1992

[5] [5]

Fast evaluation of fluctuations in biochem- ical networks with the linear noise approximation,

J. Elf and M. Ehrenberg, “Fast evaluation of fluctuations in biochem- ical networks with the linear noise approximation,”Genome research, vol. 13, no. 11, pp. 2475–2484, 2003

work page 2003

[6] [6]

The chemical langevin equation,

D. T. Gillespie, “The chemical langevin equation,”The Journal of Chemical Physics, vol. 113, no. 1, pp. 297–306, 2000

work page 2000

[7] [7]

Cybergenetics: Theory and applications of genetic control systems,

M. H. Khammash, “Cybergenetics: Theory and applications of genetic control systems,”Proceedings of the IEEE, vol. 110, no. 5, pp. 631– 658, 2022

work page 2022

[8] [8]

An extension of the moment closure method,

I. N ˚asell, “An extension of the moment closure method,”Theoretical Population Biology, vol. 64, no. 2, pp. 233–239, 2003

work page 2003

[9] [9]

Moment closure for biochemical networks,

J. Hespanha, “Moment closure for biochemical networks,” inPro- ceedings of 2008 3rd International Symposium on Communications, Control and Signal Processing. IEEE, 2008, pp. 142–147

work page 2008

[10] [10]

Approximate moment dynamics for chemically reacting systems,

A. Singh and J. P. Hespanha, “Approximate moment dynamics for chemically reacting systems,”IEEE Transactions on Automatic Con- trol, vol. 56, no. 2, pp. 414–418, 2010

work page 2010

[11] [11]

A convex approach to steady state moment analysis for stochastic chemical reactions,

Y . Sakurai and Y . Hori, “A convex approach to steady state moment analysis for stochastic chemical reactions,” inProceedings of 2017 IEEE 56th Annual Conference on Decision and Control (CDC). IEEE, 2017, pp. 1206–1211

work page 2017

[12] [12]

Optimization-based synthesis of stochastic biocircuits with statistical specifications,

——, “Optimization-based synthesis of stochastic biocircuits with statistical specifications,”Journal of The Royal Society Interface, vol. 15, no. 138, p. 20170709, 2018

work page 2018

[13] [13]

Interval analysis of worst-case stationary moments for stochas- tic chemical reactions with uncertain parameters,

——, “Interval analysis of worst-case stationary moments for stochas- tic chemical reactions with uncertain parameters,”Automatica, vol. 146, p. 110647, 2022

work page 2022

[14] [14]

Bounds on stochastic chemical kinetic systems at steady state,

G. R. Dowdy and P. I. Barton, “Bounds on stochastic chemical kinetic systems at steady state,”The Journal of Chemical Physics, vol. 148, no. 8, p. 084106, 2018

work page 2018

[15] [15]

Exact lower and upper bounds on stationary moments in stochastic biochemical systems,

K. R. Ghusinga, C. A. Vargas-Garcia, A. Lamperski, and A. Singh, “Exact lower and upper bounds on stationary moments in stochastic biochemical systems,”Physical Biology, vol. 14, no. 4, p. 04LT01, 2017

work page 2017

[16] [16]

Bounding the sta- tionary distributions of the chemical master equation via mathematical programming,

J. Kuntz, P. Thomas, G.-B. Stan, and M. Barahona, “Bounding the sta- tionary distributions of the chemical master equation via mathematical programming,”The Journal of chemical physics, vol. 151, no. 3, p. 034109, 2019

work page 2019

[17] [17]

Moment-based parameter in- ference with error guarantees for stochastic reaction networks,

Z. Li, M. Barahona, and P. Thomas, “Moment-based parameter in- ference with error guarantees for stochastic reaction networks,”The Journal of Chemical Physics, vol. 162, no. 13, 2025

work page 2025

[18] [18]

Bounding transient moments of stochastic chemical reactions,

Y . Sakurai and Y . Hori, “Bounding transient moments of stochastic chemical reactions,”IEEE Control Systems Letters, vol. 3, no. 2, pp. 290–295, 2018

work page 2018

[19] [19]

Dynamic bounds on stochastic chem- ical kinetic systems using semidefinite programming,

G. R. Dowdy and P. I. Barton, “Dynamic bounds on stochastic chem- ical kinetic systems using semidefinite programming,”The Journal of Chemical Physics, vol. 149, no. 7, p. 074103, 2018

work page 2018

[20] [20]

Tighter bounds on transient moments of stochastic chemical systems,

F. Holtorf and P. I. Barton, “Tighter bounds on transient moments of stochastic chemical systems,”Journal of Optimization Theory and Applications, vol. 200, no. 1, pp. 104–149, 2024

work page 2024

[21] [21]

Exploiting sparsity in semidefinite programming via matrix completion i: General framework,

M. Fukuda, M. Kojima, K. Murota, and K. Nakata, “Exploiting sparsity in semidefinite programming via matrix completion i: General framework,”SIAM Journal on optimization, vol. 11, no. 3, pp. 647– 674, 2001

work page 2001

[22] [22]

Chordal-TSSOS: a moment- sos hierarchy that exploits term sparsity with chordal extension,

J. Wang, V . Magron, and J.-B. Lasserre, “Chordal-TSSOS: a moment- sos hierarchy that exploits term sparsity with chordal extension,”SIAM Journal on optimization, vol. 31, no. 1, pp. 114–141, 2021

work page 2021

[23] [23]

Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization,

Y . Zheng, G. Fantuzzi, and A. Papachristodoulou, “Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization,”Annual Reviews in Control, vol. 52, pp. 243–279, 2021

work page 2021

[24] [24]

Exploiting

I. Klep, V . Magron, T. Metzlaff, and J. Wang, “Exploiting term sparsity in symmetry-adapted basis for polynomial optimization,” arXiv preprint arXiv:2511.18019, 2025

work page arXiv 2025

[25] [25]

Nesterov,Introductory lectures on convex optimization: A basic course

Y . Nesterov,Introductory lectures on convex optimization: A basic course. Springer Science & Business Media, 2013, vol. 87

work page 2013

[26] [26]

Synthetic protein-binding dna sponge as a tool to tune gene expression and mitigate protein toxicity,

X. Wan, F. Pinto, L. Yu, and B. Wang, “Synthetic protein-binding dna sponge as a tool to tune gene expression and mitigate protein toxicity,” Nature communications, vol. 11, no. 1, p. 5961, 2020

work page 2020

[27] [27]

arXiv preprint arXiv:2405.12762 (2 024)

P. J. Goulart and Y . Chen, “Clarabel: An interior-point solver for conic programs with quadratic objectives,”arXiv preprint arXiv:2405.12762, 2024

work page arXiv 2024

[28] [28]

A clique graph based merging strategy for decomposable SDPs,

M. Garstka, M. Cannon, and P. Goulart, “A clique graph based merging strategy for decomposable SDPs,”IFAC-PapersOnLine, vol. 53, no. 2, pp. 7355–7361, 2020

work page 2020

[29] [29]

Positive definite completions of partial hermitian matrices,

R. Grone, C. R. Johnson, E. M. S ´a, and H. Wolkowicz, “Positive definite completions of partial hermitian matrices,”Linear algebra and its applications, vol. 58, pp. 109–124, 1984. APPENDIX A. Definition ofΦ i Fix a reaction indexiand consider the propensity func- tionw i(x). For zero-th order, unimolecular, and homo- bimolecular reactions (see Table I),...

work page 1984