betaFeedback

WorksPhysics and Astronomy

Positivity, Noise, and Cones

Abstract

As a consequence of causality, Euclidean-time correlation functions in quantum field theory are subject to constraints in the form of positivity conditions on certain Hankel matrices. Such conditions define convex conic structures. Correlation functions computed numerically using Monte Carlo techniques generally contain statistical fluctuations that violate the positivity conditions. This work describes a projection procedure, based on the convex conic geometry induced by the positivity conditions and a statistical covariance matrix, that can be used to restore positivity, providing a unique decomposition for noisy correlators into causal and acausal components. In contrast to previous literature, this work explicitly leverages the conic structure and not just the convex nature of the causal space. The projection can be computed using primal-dual interior-point methods. Constrained projection gives rise to observable-specific frequentist confidence intervals for smeared spectral densities in the causal bootstrap of [Phys. Rev. D 114, 074510 (2026)]. Analytic results are supported with numerical examples.

Introduction

Causality imposes stringent conditions on correlation functions in quantum field theory (QFT), often in the form of a positivity condition or a constraint on their complex analytic structure. However, the rigidity of complex analytic functions which makes such conditions so powerful from a formal perspective can sometimes form an obstruction to their application to data, experimental or theoretical, known with finite precision.

Constraints from causality, together with exact Euclidean inputs, give rise to tight rigorous bounds on smeared spectral quantities. The bounds are calculable either via Nevanlinna–Pick (NP) [1] interpolation or moment problems [2]. Ref. [3] has initiated a program to include the effects of statistical uncertainties in NP interpolation (see also Refs. [4, 5, 6, 7] for additional field-theoretic applications of NP interpolation theory). Lawrence has shown that bounds from noisy data are also accessible via convex optimization [8, 9]. Ref. [10] has shown that bounds are accessible from finite-dimensional semidefinite programs (SDPs) for an important class of problems and that these bounds reproduce the tight bounds of NP interpolation and moment problems, given the same inputs. Closely related work in Ref. [11] provides a different perspective on computational tractability of the SDPs, employing a limiting sequence of finite-dimensional “relaxations.”

The goal of the present work is to lay out the geometric underpinnings for a new covariance-weighted causal decomposition, which uniquely and unambiguously partitions noisy samples into causal and acausal pieces, together with an algorithmic scheme based on convex optimization to carry out the projection in practice. The resulting decomposition is given in Eq. (69). The present proposal is in sympathy with previous works in Refs. [12, 13], which focus clearly on the positivity of certain Hankel matrices.

In contrast to prior work in the literature on lattice field theory, the present work develops a geometric picture to analyze noisy Euclidean correlators based on the conic, and not just convex, structure of causal constraints; a key novel element is the interplay between the conic geometry and the inner product induced by the covariance matrix. In particular, we formulate a conic projection for lattice correlators that enforces spectral-positivity constraints respecting the full covariance matrix of any input data, without prescribing a finite-state spectral model. The projected data nevertheless possess a unique, minimal spectral representation.

The present work also studies the statistical behavior of the projection in terms of the mean squared error (L2L_2 risk) and effective degrees of freedom. A short calculation and dimensional argument give a variational bound on the critical sample size below which acausal fluctuations become unavoidable.

Constrained projections provide the basis for defining frequentist confidence intervals in the causal bootstrap of Ref. [10]. We construct an observable-specific profile-likelihood statistic and calibrate it through a parametric bootstrap procedure. Tests of the resulting conic calibration on realistic mock data demonstrate the desired frequentist coverage.1

The conic geometry discussed in this work is closely related to the notion of positive geometry that has recently been used to constrain the structure of QFTs (see, e.g., Refs. [15, 16, 17]). Here spectral positivity, a consequence of causality, provides strong constraints on the space of causal correlation functions. In contrast to previous work, however, the noise in the correlation function plays a crucial role, adding a secondary geometric structure.

The current proposal for causal projection is phrased in terms of a convex optimization problem and is intimately connected to the ellipsoidal statistical regularization (cf. Chapter 6 of Ref. [18]) employed in Refs. [8, 9, 10, 11]. Numerical methods based on semidefinite programming are not new to theoretical physics. The renaissance in the numerical conformal bootstrap [19] has been based in part on the realization that established techniques from convex optimization [18] could be brought to bear on bootstrap problems [20]. New applications of SDPs continue to appear in theoretical physics, including bootstrap approaches to matrix quantum mechanics [21, 22, 23, 24, 25], lattice gauge theories and quantum many-body systems [26, 27, 28, 29], scattering amplitudes [30, 31, 32], and sign problems in lattice field theory [33, 34].

The remainder of the work is structured as follows. Section II reviews well-known consequences of positivity constraints, placing the present work in the context of the existing literature on lattice field theory and establishing notation. Section III describes the conic geometry implied by positivity constraints; this geometric perspective is novel to the present work. Section IV considers statistical consequences of the conic geometry when correlation functions are viewed as (approximately) Gaussian random variables. Section V connects conic projection to the causal bootstrap and develops an observable-specific statistical calibration. Section VI gives a detailed comparison of the present work to existing methods and recent proposals in the literature. Section VII provides numerical examples. Section VIII presents conclusions. Technical results are collected in two appendices.

Review of spectroscopy and constraints from positivity

Consider a quantum field theory with inverse temperature β\beta. Consider a positive-definite Hermitian matrix of two-point correlation functions at positive Euclidean time t>0t > 0

Cab(t)=∫d3x⟨Oa(t,x)Ob†(0,0)⟩(1)C_{ab}(t) = \int d^3x \langle O_a(t, x) O_b^\dagger(0, 0)\rangle \tag*{(1)}
=∫0∞dω ρab(ω)[e−ωt+e−ω(β−t)1±e−βω](2)= \int_0^\infty d\omega\,\rho_{ab}(\omega)\left[\frac{e^{-\omega t} + e^{-\omega(\beta-t)}}{1 \pm e^{-\beta\omega}}\right] \tag*{(2)}
→β→∞∫0∞dω ρab(ω)e−ωt,(3)\xrightarrow{\beta\to\infty} \int_0^\infty d\omega\,\rho_{ab}(\omega)e^{-\omega t}, \tag*{(3)}

where {Oa:a∈{1,2,…,p}}\{O_a : a \in\{1, 2, \ldots, p\}\} is a set of suitable local operators and ρab(ω)\rho_{ab}(\omega) is the spectral function. For each positive time, Cab(t)∈HpC_{ab}(t) \in\mathbb{H}_p, where Hp\mathbb{H}_p is the space of p×pp \times p Hermitian matrices. Throughout this work, the operators {Oa}\{O_a\} are taken to transform under an irreducible representation, or irrep, of the relevant global symmetry group so that the operators couple to states with definite quantum numbers. Causality and reflection positivity imply that the correlation function and spectral function are both positive semidefinite. It will be assumed, as an additional but standard physical hypothesis (see Refs. [35, 36]), that linearly independent operators have been chosen so that the correlation function is actually positive in the sense that Cab(t)≻0C_{ab}(t) \succ0 for all t>0t > 0. Spectroscopy refers to the problem of determining properties of the spectral function from the correlation function, i.e., inverting the Laplace transform in Eq. (3).

At zero temperature and in a finite spatial volume, the spectral function consists of a discrete but generally infinite sum over finite-volume energy levels with a given set of quantum numbers,2

ρab(ω)=∑n=1∞⟨0∣Oa∣n⟩⟨n∣Ob†∣0⟩2Enδ(ω−En)(4)\rho_{ab}(\omega) = \sum_{n=1}^{\infty}\frac{\langle0|O_a|n\rangle\langle n|O_b^\dagger|0\rangle}{2E_n}\delta(\omega-E_n) \tag*{(4)}
=∑n=1∞ZanZbn∗δ(ω−En).(5)= \sum_{n=1}^{\infty} Z_{an}Z_{bn}^{*}\delta(\omega-E_n). \tag*{(5)}

The overlaps will often be written as a vector Zn∈CpZ_n \in\mathbb{C}^p. States with vanishing overlaps (Zn=0Z_n = 0), except for reasons of symmetry, are excluded from the sum. Positivity of the spectral function implies that, for each energy level nn, the matrices of overlap factors

Wn=ZnZn†∈Hp(6)W_n = Z_n Z_n^\dagger\in\mathbb{H}_p \tag*{(6)}

are positive semidefinite. When distinct states in the physical Hilbert space share the same energy, these states are said to be degenerate. Unless otherwise indicated, all energy levels are hereafter assumed to be non-degenerate. The role of possible degeneracies is discussed briefly in Appendix A.

Numerical lattice field theory gives access to unbiased statistical estimators for the correlation functions Cab(t)C_{ab}(t) of the lattice quantum field theory. Unless otherwise noted, the present work uses lattice units a=1a = 1 so that t∈Nt \in\mathbb{N}. When viewed as vectors indexed by t∈{1,2,…,m}t \in\{1, 2, \ldots, m\}, correlators will be written in boldface as C∈(Hp)mC \in(\mathbb{H}_p)^m. The choice of the letter mm is meant to stand for the number of “moments,” a perspective described in Section IIB below. Clearly, m≤Ntm \leq N_t with NtN_t the temporal extent of the lattice, and in some cases it may be desirable to restrict the number of moments fur-

⟨n′,p′∣n,p⟩=2En(p)L3δnn′δp′p.\langle n', p'|n, p\rangle= 2E_n(p)L^3\delta_{nn'}\delta_{p'p}.

ther.3 For scalar-valued correlators, C∈RmC \in\mathbb{R}^{m} without loss of generality.

The central limit theorem guarantees that, for a sufficiently large number of independent and identically distributed random samples C^1′,C^2′,…,C^N′\hat{C}'_{1}, \hat{C}'_{2}, \ldots, \hat{C}'_{N}, the sample mean will be Gaussian distributed:

C^N=1N∑i=1NC^i′∼N→∞N(C,ΣN),(7)\hat{C}_{N} = \frac{1}{N}\sum_{i=1}^{N}\hat{C}'_{i} \mathop{\sim}_{N\to\infty} \mathcal{N}(C,\Sigma_{N}), \tag*{(7)}

where ΣN≡Σ/N\Sigma_{N} \equiv\Sigma/N is the covariance matrix of the sample mean and where Σ\Sigma is the covariance matrix associated with C(t)C(t). Here and throughout the present work, hatted variables denote instances of a random variable that follow a known distribution, e.g., N(C,ΣN)\mathcal{N}(C,\Sigma_{N}) in Eq. (7). All covariance matrices are assumed to be Hermitian and positive definite. For notational brevity, the subscript on ΣN\Sigma_{N} will be omitted when the value of NN is immaterial. As usual, the inverse covariance matrix defines a real inner-product structure via

⟨u,v⟩Σ−1≡u†Σ−1v=utab†Σtab,t′a′b′−1vt′a′b′,(8)\langle u,v\rangle_{\Sigma^{-1}} \equiv u^{\dagger}\Sigma^{-1}v = u^{\dagger}_{tab}\Sigma^{-1}_{tab,t'a'b'}v_{t'a'b'}, \tag*{(8)}

where u,v∈(Hp)mu,v \in(\mathbb{H}_{p})^{m}. The induced norm is ∥a∥Σ−1\lVert a\rVert_{\Sigma^{-1}}, with

∥a∥Σ−12≡⟨a,a⟩Σ−1=a†Σ−1a,a∈(Hp)m.(9)\lVert a\rVert_{\Sigma^{-1}}^{2} \equiv\langle a,a\rangle_{\Sigma^{-1}} = a^{\dagger}\Sigma^{-1}a,\qquad a \in(\mathbb{H}_{p})^{m}. \tag*{(9)}

When the relevant covariance matrix is clear from context and a statistical interpretation is being emphasized, particularly for a difference a−b∈(Hp)ma-b \in(\mathbb{H}_{p})^{m}, the previous equation will be written

χ2(a−b)=(a−b)†Σ−1(a−b).(10)\chi^{2}(a-b) = (a-b)^{\dagger}\Sigma^{-1}(a-b). \tag*{(10)}

The generalized eigenvalue problem

A common and successful approach to spectroscopy phrases the problem using the variational method [37] in terms of a generalized eigenvalue problem (GEVP) [35]

C(t)un(t,t0)=λn(t,t0)C(t0)un(t,t0),(11)C(t)u_{n}(t,t_{0}) = \lambda_{n}(t,t_{0})C(t_{0})u_{n}(t,t_{0}), \tag*{(11)}

where C(t)≻0C(t) \succ0 for all t>0t>0 and t0>0t_{0}>0 is an arbitrary reference time. The eigenvectors are un∈Cpu_{n} \in\mathbb{C}^{p}, and the generalized eigenvalues λn\lambda_{n} are positive real numbers. At large t0t_{0} and t>t0t>t_{0}, they satisfy [36, 38]

λn(t,t0)=e−En(t−t0)[1+O(e−(Ep+1−En)(t−t0))],(12)\lambda_{n}(t,t_{0}) = e^{-E_{n}(t-t_{0})}\left[1+\mathcal{O}\left(e^{-(E_{p+1}-E_{n})(t-t_{0})}\right)\right], \tag*{(12)}

where Ep+1−En>0E_{p+1}-E_{n}>0. As t→∞t\to\infty, the energies extracted from the generalized eigenvalues of a p×pp\times p matrix of correlation functions converge to the pp lowest finite-volume energy levels that overlap with operators in the given variational set. The eigenvectors are conventionally normalized such that

un†(t,t0)C(t0)um(t,t0)=δnm.(13)u_{n}^{\dagger}(t,t_{0})C(t_{0})u_{m}(t,t_{0}) = \delta_{nm}. \tag*{(13)}

With this normalization for the eigenvectors, the nthn^{\mathrm{th}} matrix of spectral weights is accessible for large Euclidean times via

References

  1. [1]T. Bergamaschi, W. I. Jay, and P. R. Oare, Hadronic structure, conformal maps, and analytic continuation, Phys. Rev. D 108, 074516 (2023), arXiv:2305.16190 [hep-lat].arxiv.org/abs/2305.16190
  2. [2]R. Abbott, W. I. Jay, and P. R. Oare, Moment problems and bounds for matrix-valued smeared spectral functions (2025), arXiv:2508.01377 [hep-lat].arxiv.org/abs/2508.01377
  3. [3]S. Fields and N. Christ, Nevanlinna-Pick interpolation from uncertain data, Phys. Rev. D 113, 054502 (2026), arXiv:2510.12136 [hep-lat].DOI
  4. [4]K. Nogaki, J. Fei, E. Gull, and H. Shinaoka, Nevanlinna.jl: A Julia implementation of Nevanlinna analytic continuation, SciPost Phys. Codebases 19 (2023), arXiv:2302.10476 [physics.comp-ph].DOI
  5. [5]K. Nogaki and H. Shinaoka, Bosonic Nevanlinna analytic continuation, J. Phys. Soc. Jpn. 92, 035001 (2023), arXiv:2305.03449 [quant-ph].DOI
  6. [6]J. Fei, C.-N. Yeh, and E. Gull, Nevanlinna analytical continuation, Phys. Rev. Lett. 126, 056402 (2021).DOI
  7. [7]L. Huang and S. Liang, Reconstructing lattice QCD spectral functions with stochastic pole expansion and Nevanlinna analytic continuation, Phys. Rev. D 109, 054508 (2024), arXiv:2309.11114 [hep-lat].DOI
  8. [8]S. Lawrence, Model-free spectral reconstruction via Lagrange duality (2024), arXiv:2408.11766 [hep-lat].arxiv.org/abs/2408.11766
  9. [9]S. Lawrence, Real-time dynamics from convex geometry, PoS LATTI CE2024, 057 (2025), arXiv:2502.01880 [hep-lat].arxiv.org/abs/2502.01880
  10. [10]R. Abbott, S. Fields, W. I. Jay, P. Oare, and M. Saccardi, Causal bootstrap: Bounding smeared spectral functions from nonperturbative Euclidean data, Phys. Rev. D 114, 074510 (2026), arXiv:2605.20509 [hep-lat].arxiv.org/abs/2605.20509
  11. [11]S. Mutzel and A. Tilloy, Certified spectral functions from lattice Monte Carlo data (2026), arXiv:2606.09791 [hep-lat].arxiv.org/abs/2606.09791
  12. [12]Y. Yu, A. F. Kemper, C. Yang, and E. Gull, Denoising of imaginary time response functions with Hankel projections, Phys. Rev. Res. 6, L032042 (2024).DOI
  13. [13]J. Ostmeyer and C. Urbach, The truncated Hankel correlator method (2025), arXiv:2510.15500 [hep-lat].arxiv.org/abs/2510.15500
  14. [14]C. Lehner, Interpretable uncertainties for bounds on spectral functions from Euclidean correlators (2026), in preparation.
  15. [15]N. Arkani-Hamed, T.-C. Huang, and Y.-t. Huang, The EFT-Hedron, JHEP 2021 (05), 259, arXiv:2012.15849 [hep-th].
  16. [16]N. Arkani-Hamed, Y.-T. Huang, and S.-H. Shao, On the positive geometry of conformal field theory, JHEP 2019 (06), 124, arXiv:1812.07739 [hep-th].
  17. [17]B. Bellazzini, J. Elias Miró, R. Rattazzi, M. Riembau, and F. Riva, Positive moments for scattering amplitudes, Phys. Rev. D 104, 036006 (2021), arXiv:2011.00037 [hep-th].DOI
  18. [18]H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, International Series in Operations Research & Management Science, Vol. 27 (Springer Science+Business Media, New York, NY, USA, 2000).
  19. [19]D. Poland, S. Rychkov, and A. Vichi, The conformal bootstrap: Theory, numerical techniques, and applications, Rev. Mod. Phys. 91, 015002 (2019), arXiv:1805.04405 [hep-th].DOI
  20. [20]D. Simmons-Duffin, A semidefinite program solver for the conformal bootstrap, JHEP 2015 (06), 174, arXiv:1502.02033 [hep-th].
  21. [21]H. W. Lin, TASI lectures on Matrix Theory from a modern viewpoint (2025), arXiv:2508.20970 [hep-th].arxiv.org/abs/2508.20970
  22. [22]H. W. Lin, Bootstrap bounds on D0-brane quantum mechanics, JHEP 2023 (06), 038, arXiv:2302.04416 [hep-th].DOI
  23. [23]H. W. Lin and Z. Zheng, Bootstrapping ground state correlators in matrix theory. Part I, JHEP 2025 (01), 190, arXiv:2410.16467 [hep-th].
  24. [24]M. Cho, B. Gabai, J. Sandor, and X. Yin, Thermal bootstrap of matrix quantum mechanics, JHEP 2025 (04), 186, arXiv:2410.04262 [hep-th].arxiv.org/abs/2410.04262
  25. [25]H. W. Lin and Z. Zheng, High-precision bootstrap of multimarix quantum mechanics, Phys. Rev. Lett. 136, 181603 (2026), arXiv:2507.21007 [hep-th].DOI
  26. [26]V. Kazakov and Z. Zheng, Bootstrap for finite N lattice Yang-Mills theory, JHEP 2025 (03), 099, arXiv:2404.16925 [hep-th].arxiv.org/abs/2404.16925
  27. [27]M. G. Scheer, Bootstrapping quantum Hamiltonians with symmetry, Phys. Rev. Lett. 136, 246501 (2026), arXiv:2410.00810 [cond-mat.str-el].DOI
  28. [28]M. Cho, C. O. Nancarrow, P. Tadić, Y. Xin, and Z. Zheng, Coarse-grained bootstrap of quantum many-body systems, JHEP 2026 (02), 222, arXiv:2412.07837 [hep-th].arxiv.org/abs/2412.07837
  29. [29]H. Fawzi, O. Fawzi, and S. O. Scalet, Certified algorithms for equilibrium states of local quantum Hamiltonians, Nature Commun. 15, 7394 (2024), arXiv:2311.18706 [quant-ph].DOI
  30. [30]Y. He and M. Kruczenski, Gauge theory bootstrap: Pion amplitudes and low energy parameters (2024), arXiv:2403.10772 [hep-th].arxiv.org/abs/2403.10772
  31. [31]A. Guerrieri, A. Homrich, and P. Vieira, Multiparticle flux-tube S-matrix bootstrap, Phys. Rev. Lett. 134, 041601 (2025), arXiv:2404.10812 [hep-th].arxiv.org/abs/2404.10812
  32. [32]C. d. Rham, A. J. Tolley, Z.-H. Wang, and S.-Y. Zhou, Primal S-matrix bootstrap with dispersion relations, JHEP 2026 (01), 027, arXiv:2506.22546 [hep-th].
  33. [33]S. Lawrence, Semidefinite programs at finite fermion density, Phys. Rev. D 107, 094511 (2023), arXiv:2211.08874 [hep-lat].DOI
  34. [34]S. Lawrence and Y. Yamauchi, Convex optimization of contour deformations, Phys. Rev. D 110, 014508 (2024), arXiv:2311.13002 [hep-lat].DOI
  35. [35]M. Lüscher and U. Wolff, How to calculate the elastic scattering matrix in two-dimensional quantum field theories by numerical simulation, Nucl. Phys. B 339, 222 (1990).DOI
  36. [36]B. Blossier, M. Della Morte, G. von Hippel, T. Mendes, and R. Sommer, On the generalized eigenvalue method for energies and matrix elements in lattice field theory, JHEP 2009 (04), 094, arXiv:0902.1265 [hep-lat].DOI
  37. [37]C. Michael and I. Teasdale, Extracting glueball masses from lattice QCD, Nucl. Phys. B 215, 433 (1983).DOI
  38. [38]M. Lüscher and P. Weisz, Definition and general properties of the transfer matrix in continuum limit improved lattice gauge theories, Nucl. Phys. B 240, 349 (1984).DOI
  39. [39]M. Fischer, B. Kotzura, J. Ostmeyer, K. Ottnad, M. Ueding, and C. Urbach, On the generalised eigenvalue method and its relation to Prony and generalised pencil of function methods, Eur. Phys. J. A 56, 206 (2020), arXiv:2004.10472 [hep-lat].DOI
  40. [40]K. Schmüdgen, The Moment Problem, Graduate Texts in Mathematics (Springer Cham, 2017).DOI
  41. [41]H. Hamburger, Über eine Erweiterung des Stieltjesschen Momentenproblems (Teil I), Mathematische Annalen 81, 235 (1920).
  42. [42]I. V. Kovalishina, Analytic theory of a class of interpolation problems, Mathematics of the USSR-Izvestiya 22, 419 (1984).DOI
  43. [43]G. Bailas, S. Hashimoto, and T. Ishikawa, Reconstruction of smeared spectral function from Euclidean correlation functions, PTEP 2020, 043B07 (2020), arXiv:2001.11779 [hep-lat].DOI
  44. [44]M. Bruno, L. Giusti, and M. Saccardi, Spectral densities from Euclidean lattice correlators via the Mellin transform, Phys. Rev. D 111, 094515 (2025), arXiv:2407.04141 [hep-lat].arxiv.org/abs/2407.04141
  45. [45]L. Giusti, M. Saccardi, and D. Toniolo, Spectral densities from Euclidean correlators via integral transforms: theoretical framework (2026), arXiv:2606.28167 [hep-lat].arxiv.org/abs/2606.28167
  46. [46]B. Beckermann, The condition number of real Vandermonde, Krylov and positive definite Hankel matrices, Numerische Mathematik 85, 553 (2000).DOI
  47. [47]C. D. Aliprantis and R. Tourky, Cones and Duality, Graduate Studies in Mathematics, Vol. 84 (American Mathematical Society, Providence, RI, USA, 2007).
  48. [48]M. Dimmicoli, Fundamentals of cone regression (2016), arXiv:1507.06496 [stat.CO].
  49. [49]Y. Nesterov, Squared functional systems and optimization problems, in High Performance Optimization, edited by H. Frenk, K. Roos, T. Terlaky, and S. Zhang (Springer US, Boston, MA, 2000) pp. 405–440.
  50. [50]J.-J. Moreau, Décomposition orthogonale d’un espace hbertien selon deux cônes mutuellement polaires, Comptes rendus hebdomadaires des séances de l’Académie des sciences 255, 238 (1962), HAL preprint archive.
  51. [51]M. Nakata, A numerical evaluation of highly accurate multiple-precision arithmetic version of semidefinite programming solver: SDPA-GMP, -QD and -DD, in 2010 IEEE International Symposium on Computer-Aided Control System Design (2010) pp. 29–34.DOI
  52. [52]M. Yamashita, K. Fujisawa, and M. Kojima, Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0), Optimization Methods and Software 18, 491 (2003).
  53. [53]M. Yamashita, K. Fujisawa, K. Nakata, M. Nakata, M. Fukuda, K. Kobayashi, and K. Goto, A high-performance software package for semidefinite programs: SDPA 7, Tech. Rep. B-460 (Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, Japan, 2010).
  54. [54]F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM Journal on Optimization 5, 13 (1995).DOI
  55. [55]L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38, 49 (1996).
  56. [56]C. M. Stein, Estimation of the mean of a multivariate normal distribution, The Annals of Statistics 9, 1135 (1981).DOI
  57. [57]A. Stuart, K. Ord, and S. Arnold, Kendall’s Advanced Theory of Statistics, Vol. 2A: Classical Inference and the Linear Model, 6th ed. (Oxford Univ. Press, 1999).
  58. [58]P. A. Zyla et al. (Particle Data Group), Review of Particle Physics, PTEP 2020, 083C01 (2020).
  59. [59]P. Batlle, P. Patil, M. Stanley, H. Owhadi, and M. Kusela, Optimization-based frequentist confidence intervals for functionals in constrained inverse problems: Resolving the Burrus conjecture (2024), arXiv:2310.02461 [math.ST].
  60. [60]M. Stanley, P. Batlle, P. Patil, H. Owhadi, and M. Kusela, Confidence intervals for functionals in constrained inverse problems via data-adaptive sampling-based calibration (2026), arXiv:2502.02674 [stat.ME].arxiv.org/abs/2502.02674
  61. [61]S. S. Wilks, The large-sample distribution of the likelihood ratio for testing composite hypotheses, The Annals of Mathematical Statistics 9, 60 (1938).DOI
  62. [62]K. S. Cranmer, Frequentist hypothesis testing with back ground uncertainty, eConf C030908, WEMT004 (2003), arXiv:1902.04223 [hep-lat].
  63. [63]K. Cranmer, Statistical challenges for searches for new physics at the LHC, in PHYSTAT (2005): Statistical Problems in Particle Physics, Astrophysics and Cosmology (2006) pp. 112–123, arXiv:physics/0511028.DOI
  64. [64]G. Cowan, K. Cranmer, E. Gross, and O. Vitells, Asymptotic formulae for likelihood-based tests of new physics, Eur. Phys. J. C 71, 1554 (2011), [Erratum: Eur.Phys.J.C 73, 2501 (2013)], arXiv:1007.1727 [physics.data-an].
  65. [65]M. A. Acero et al. (NOvA), Monte Carlo method for constructing confidence intervals with unconstrained and constrained nuisance parameters in the NOvA experiment, JINST 20, T02001 (2025), arXiv:2207.14353 [hep-ex].DOI
  66. [66]R. L. Berger and D. D. Boos, P values maximized over a confidence set for the nuisance parameter, Journal of the American Statistical Association 89, 1012 (1994).
  67. [67]J. P. Boyle and R. L. Dykstra, A method for finding projections onto the intersection of convex sets in Hilbert spaces, in Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics, Vol. 37, edited by R. Dykstra, T. Robertson, and F. T. Wright (Springer, New York, NY, 1986) pp. 28–47.
  68. [68]N. J. Higham, Computing a nearest symmetric positive semidefinite matrix, Linear Algebra and its Applications 103, 103 (1988).DOI
  69. [69]M. G. Eberle and M. C. Maciel, Finding the closest Toeplitz matrix, Computational & Applied Mathematics 22, 1 (2003).
  70. [70]M. L. Wagman, Lanczos algorithm, the transfer matrix, and the signal-to-noise problem, Phys. Rev. Lett. 134, 241901 (2025), arXiv:2406.20009 [hep-lat].arxiv.org/abs/2406.20009
  71. [71]J. Ostmeyer, A. Sen, and C. Urbach, On the equivalence of Prony and Lanczos methods for Euclidean correlation functions, Eur. Phys. J. A 61, 26 (2025), arXiv:2411.14981 [hep-lat].DOI
  72. [72]R. Abbott, D. C. Hackett, G. T. Fleming, D. A. Pefkou, and M. L. Wagman, Filtered Rayleigh-Ritz and the Prony-Ritz equivalence class, Phys. Rev. E 114, 015302 (2026), arXiv:2503.17357 [hep-lat].
  73. [73]C. Aubin and K. Orginos, A new approach for Delta form factors, AIP Conf. Proc. 1374, 621 (2011), arXiv:1010.0202 [hep-lat].DOI
  74. [74]C. Aubin and K. Orginos, An improved method for extracting matrix elements from lattice three-point functions, PoS LATTICE2011, 148 (2011).DOI
  75. [75]D. C. Hackett and M. L. Wagman, Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements, Phys. Rev. D 112, 014514 (2025), arXiv:2412.04444 [hep-lat].arxiv.org/abs/2412.04444
  76. [76]A. Bazavov et al. (Fermilab Lattice, MILC), D-meson semileptonic decays to pseudoscalars from four-flavor lattice QCD, Phys. Rev. D 107, 094516 (2023), arXiv:2212.12648 [hep-lat].DOI
  77. [77]C. T. H. Davies et al. (Fermilab Lattice, HPQCD, MILC), Hadronic-vacuum-polarization contribution to the muon’s anomalous magnetic moment from four-flavor lattice QCD, Phys. Rev. D 101, 034512 (2020), arXiv:1902.04223 [hep-lat].
  78. [78]N. Cabibbo, G. Parisi, and M. Testa, Hadron production in e+e− collisions, Lett. Nuovo Cim. 4S1, 35 (1970).DOI
  79. [81]W. I. Jay and M. Saccardi, Kernel transformations and bounds for smeared spectral functions (2026), arXiv:2606.19503 [hep-lat].arxiv.org/abs/2606.19503
  80. [82]D. P. Kimsey and M. Trachana, On a solution of the multidimensional truncated matrix-valued moment problem, Milan Journal of Mathematics 90, 17 (2022).DOI
  81. [83]S. van der Walt, S. C. Colbert, and G. Varoquaux, The NumPy array: A structure for efficient numerical computation, Comput. Sci. Eng. 13, 22 (2011), arXiv:1102.1523 [cs.MS].DOI
  82. [84]C. R. Harris et al., Array programming with NumPy, Nature 585, 357 (2020), arXiv:2006.10256 [cs.MS].DOI
  83. [85]The mpmath development team, mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 1.3.0) (2023), http://mpmath.org/.
  84. [86]S. Diamond and S. Boyd, CVXPY: A Python-embedded modeling language for convex optimization, Journal of Machine Learning Research 17, 1 (2016).
  85. [87]A. Agrawal, R. Verschueren, S. Diamond, and S. Boyd, A rewriting system for convex optimization problems, Journal of Control and Decision 5, 42 (2018).arxiv.org/abs/1709.04494
  86. [88]J. D. Hunter, Matplotlib: A 2D graphics environment, Comput. Sci. Eng. 9, 90 (2007).DOI
  87. [89]M. L. Waskom, Seaborn: Statistical data visualization, Journal of Open Source Software 6, 3021 (2021).DOI
  88. [90]R. E. Curto and L. A. Fialkow, Flat extensions of positive moment matrices: Recursively generated relations, Memoirs of the American Mathematical Society 136, 1 (1998).DOI
  89. [91]R. E. Curto and L. A. Fialkow, Recursiveness, positivity, and truncated moment problems, Houston Journal of Mathematics 17, 603 (1991).
  90. [92]E. Follana, Q. Mason, C. Davies, K. Hornbostel, G. P. Lepage, J. Shigemitsu, H. Trottier, and K. Wong (HPQCD, UKQCD), Highly improved staggered quarks on the lattice, with applications to charm physics, Phys. Rev. D 75, 054502 (2007), arXiv:hep-lat/0610092.DOI
  91. [93]K. Gatermann and P. A. Parrilo, Symmetry groups, semidefinite programs, and sums of squares, Journal of Pure and Applied Algebra 192, 95 (2004), arXiv:math/0211450v1.DOI
  92. [94]Y. Kanno, M. Ohsaki, K. Murota, and N. Katoh, Group symmetry in interior-point methods for semidefinite program, Optimization and Engineering 2, 293 (2001).DOI
  93. [95]K.-C. Toh, An inexact primal–dual path following algorithm for convex quadratic SDP, Mathematical Programming 112, 221 (2008).DOI

Paper details

vlnc:W_fqunexdf
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Claude Code, Codex

View statement
Looking for related papers…
Contents