arxiv: 2605.10929 · v1 · submitted 2026-05-11 · 🧮 math.NA · cs.NA

Recognition: 2 theorem links

· Lean Theorem

Efficient Admissible Set Projection in Optimization-based Invariant-Domain-Preserving Limiters for Ideal MHD

Chen Liu , Chi-Wang Shu , Xiangxiong Zhang

Authors on Pith no claims yet

Pith reviewed 2026-05-12 03:16 UTC · model grok-4.3

classification 🧮 math.NA cs.NA

keywords ideal MHDadmissible setoptimization-based limiterdiscontinuous Galerkinpositivity-preserving limiterBrent methodinvariant domain

0 comments

The pith

Decomposing the ideal MHD admissible set into magnetic-energy slices reduces projection to an efficient one-dimensional minimization.

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

This work develops an optimization-based approach to keep numerical solutions of the ideal MHD equations inside the physically admissible region. The key step is to break the admissible set into slices, each fixed by a value of the magnetic energy. Projection onto the set then collapses to minimizing a one-dimensional function that Brent's method can solve rapidly. The limiter maintains conservation properties and pairs with existing techniques to handle both cell averages and point values in discontinuous Galerkin discretizations.

Core claim

We decompose the admissible set into slices parameterized by the magnetic energy, so that the MHD projection reduces to a one-dimensional minimization, which can be solved efficiently by the Brent method. The splitting method can be used to efficiently solve the global minimization problem of the optimization-based limiter, which can be used to enforce cell average admissibility in discontinuous Galerkin schemes, and pointwise admissibility can be further enforced by the Zhang-Shu positivity-preserving limiter.

What carries the argument

Decomposition of the admissible set into slices parameterized by magnetic energy, enabling reduction of the projection to one-dimensional minimization via the Brent method.

If this is right

The global minimization is solved efficiently using a splitting method.
Cell average admissibility is enforced in DG schemes.
Pointwise admissibility is enforced using the Zhang-Shu limiter in combination.
The method is demonstrated on high-order DG schemes for several MHD test cases.

Where Pith is reading between the lines

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

Similar slicing strategies might simplify limiters for other conservation laws with complicated invariant sets.
The computational savings could allow optimization-based limiters to be used in three-dimensional or time-dependent MHD problems at higher resolutions.
Extensions to other numerical methods beyond DG, such as finite volume schemes, appear feasible.

Load-bearing premise

It is possible to decompose the ideal MHD admissible set into one-parameter slices by magnetic energy such that the resulting one-dimensional projection problem enforces all original constraints.

What would settle it

If a state produced by the one-dimensional minimization violates an admissibility condition such as non-negative density or positive magnetic energy, the proposed decomposition does not work.

read the original abstract

Preserving the admissible set of the ideal magnetohydrodynamics (MHD) equations is important not only for producing physically meaningful numerical solutions, but more importantly for achieving robust computations. In this paper, we develop an optimization-based limiter to enforce admissibility while preserving global conservation and accuracy. For an easy and efficient projection, we decompose the admissible set into slices parameterized by the magnetic energy, so that the MHD projection reduces to a one-dimensional minimization, which can be solved efficiently by the Brent method. The splitting method can be used to efficiently solve the global minimization problem of the optimization-based limiter, which can be used to enforce cell average admissibility in discontinuous Galerkin (DG) schemes, and pointwise admissibility can be further enforced by the Zhang-Shu positivity-preserving limiter. We apply the limiter to high-order DG schemes and present numerical results for a few representative MHD problems.

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 paper's main contribution is a practical efficiency trick that slices the MHD admissible set by magnetic energy to turn the projection into a fast 1D Brent minimization.

read the letter

The paper's key idea is to decompose the admissible set for ideal MHD into slices based on magnetic energy. This allows the projection onto that set, which is part of their optimization-based limiter, to be done via a one-dimensional minimization solved by the Brent method. That strikes me as a useful efficiency gain for applying these limiters in discontinuous Galerkin discretizations of MHD. They also mention using a splitting method to handle the global minimization and then layering on the Zhang-Shu positivity-preserving limiter for pointwise admissibility. The abstract indicates application to high-order DG schemes with numerical results for representative MHD problems. This approach targets a practical problem in producing robust simulations that stay physically meaningful. The strength is in the targeted technique for reducing computational cost in the projection step. If the slicing works as described, it could make invariant-domain-preserving methods more accessible for MHD without heavy overhead. However, since only the abstract is available, it's tough to verify the details. The abstract does not include any specific proofs, error bounds, or quantitative comparisons showing the efficiency or accuracy preservation. The numerical results are referenced but not presented, so we can't see how well it performs on the test cases or if there are any hidden costs or limitations in certain regimes. This is for people working on numerical methods for MHD, especially in contexts like astrophysics or fusion where robustness is critical. A reader focused on high-order schemes and limiters would get something out of it, provided the full paper delivers on the claims. I'd recommend sending it for peer review. The idea seems technically sound and addresses a real need, even if more evidence would strengthen it.

Referee Report

1 major / 1 minor

Summary. The manuscript develops an optimization-based limiter to enforce the admissible set for ideal MHD while preserving global conservation and accuracy in discontinuous Galerkin schemes. The central technical device is a decomposition of the admissible set into slices parameterized by magnetic energy, which reduces the projection to a one-dimensional minimization solved by the Brent method; cell-average admissibility is thereby enforced, with the Zhang-Shu limiter added for pointwise admissibility. Numerical results are presented for representative MHD problems.

Significance. If the decomposition is shown to preserve the full set of admissibility constraints without compromising conservation or accuracy, the approach would supply a computationally efficient alternative to existing optimization-based invariant-domain limiters for MHD, addressing a practical bottleneck in high-order robust simulations of plasma flows.

major comments (1)

[Abstract] Abstract: the claim that slicing the admissible set by magnetic energy reduces the projection to a one-dimensional Brent minimization that still enforces all admissibility constraints, conservation, and accuracy is presented without derivation, proof, or quantitative verification; this step is load-bearing for the efficiency and correctness assertions and requires explicit justification.

minor comments (1)

[Abstract] The abstract states that results are shown for 'a few representative MHD problems' but supplies neither the specific test cases nor any quantitative metrics (e.g., error norms, CPU timings, or constraint-violation measures).

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful review and constructive feedback. We address the single major comment below and will revise the manuscript to strengthen the presentation of the key technical step.

read point-by-point responses

Referee: [Abstract] Abstract: the claim that slicing the admissible set by magnetic energy reduces the projection to a one-dimensional Brent minimization that still enforces all admissibility constraints, conservation, and accuracy is presented without derivation, proof, or quantitative verification; this step is load-bearing for the efficiency and correctness assertions and requires explicit justification.

Authors: We agree that the abstract, as a concise summary, does not contain the full derivation or proofs. The manuscript develops the decomposition of the admissible set into slices parameterized by magnetic energy in the main text, reducing the projection to a one-dimensional minimization solved by Brent's method. This reduction is shown to enforce the full set of admissibility constraints (positivity of density and pressure, and the magnetic field constraints) while the optimization-based limiter preserves global conservation. Accuracy is retained because the limiter is inactive in smooth admissible regions and the underlying DG scheme is high-order. Quantitative verification appears in the numerical results for representative MHD problems, including convergence studies. To address the concern directly, we will revise the abstract to include a short clause noting that the slicing preserves all constraints (as detailed and proven in the body) and will ensure the main text contains an explicit statement or theorem summarizing the preservation properties. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The abstract presents a methodological decomposition of the MHD admissible set into magnetic-energy slices to reduce projection to a 1D Brent minimization. This is framed as an efficiency device motivated by the geometry of the admissible set and standard optimization techniques, with no equations, self-citations, fitted parameters, or uniqueness theorems provided that could create a self-referential loop. The central claim does not reduce to its own inputs by construction, and the paper is self-contained against external benchmarks for the described technique.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review prevents identification of specific free parameters, axioms, or invented entities. The approach appears to rest on standard mathematical optimization and existing MHD admissibility definitions rather than new postulates.

pith-pipeline@v0.9.0 · 5428 in / 1116 out tokens · 57067 ms · 2026-05-12T03:16:20.125436+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

we decompose the admissible set into slices parameterized by the magnetic energy, so that the MHD projection reduces to a one-dimensional minimization, which can be solved efficiently by the Brent method
IndisputableMonolith/Foundation/AlphaCoordinateFixation.lean costAlphaLog_high_calibrated_iff unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Lemma 3.6. The mapping β↦d₂(β) is continuous on [0,+∞). ... d₂(β) is strictly convex

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

50 extracted references · 50 canonical work pages

[1]

Anshika, J

A. Anshika, J. Li, D. Ghosh, and X. Zhang , A three-operator splitting scheme derived from three-block ADMM , Optimization and Engineering, (2025), pp. 1--41

work page 2025
[2]

D. S. Balsara and D. S. Spicer , A staggered mesh algorithm using high order G odunov fluxes to ensure solenoidal magnetic fields in magnetohydrodynamic simulations , Journal of Computational Physics, 149 (1999), pp. 270--292

work page 1999
[3]

R. P. Brent , Algorithms for minimization without derivatives , Courier Corporation, 2013

work page 2013
[4]

X. Cai, D. Han, and X. Yuan , The direct extension of ADMM for three-block separable convex minimization models is convergent when one function is strongly convex , Optimization Online, 229 (2014), p. 230

work page 2014
[5]

Chambolle and T

A. Chambolle and T. Pock , An introduction to continuous optimization for imaging , Acta Numerica, 25 (2016), pp. 161--319

work page 2016
[6]

Cheng, F

Y. Cheng, F. Li, J. Qiu, and L. Xu , Positivity-preserving DG and central DG methods for ideal MHD equations , Journal of Computational Physics, 238 (2013), pp. 255--280

work page 2013
[7]

A. J. Christlieb, Y. Liu, Q. Tang, and Z. Xu , Positivity-preserving finite difference weighted ENO schemes with constrained transport for ideal magnetohydrodynamic equations , SIAM Journal on Scientific Computing, 37 (2015), pp. A1825--A1845

work page 2015
[8]

Ciuc a , P

C. Ciuc a , P. Fernandez, A. Christophe, N. C. Nguyen, and J. Peraire , Implicit hybridized discontinuous G alerkin methods for compressible magnetohydrodynamics , Journal of Computational Physics: X, 5 (2020), p. 100042

work page 2020
[9]

T. A. Dao, M. Nazarov, and I. Tomas , A structure preserving numerical method for the ideal compressible MHD system , Journal of Computational Physics, 508 (2024), p. 113009

work page 2024
[10]

Davis and W

D. Davis and W. Yin , A three-operator splitting scheme and its optimization applications , Set-valued and variational analysis, 25 (2017), pp. 829--858

work page 2017
[11]

Demanet and X

L. Demanet and X. Zhang , Eventual linear convergence of the D ouglas-- R achford iteration for basis pursuit , Mathematics of Computation, 85 (2016), pp. 209--238

work page 2016
[12]

Derigs, A

D. Derigs, A. R. Winters, G. J. Gassner, and S. Walch , A novel high-order, entropy stable, 3 D AMR MHD solver with guaranteed positive pressure , Journal of Computational Physics, 317 (2016), pp. 223--256

work page 2016
[13]

Douglas and H

J. Douglas and H. H. Rachford , On the numerical solution of heat conduction problems in two and three space variables , Transactions of the American mathematical Society, 82 (1956), pp. 421--439

work page 1956
[14]

Fortin and R

M. Fortin and R. Glowinski , Augmented L agrangian methods: applications to the numerical solution of boundary-value problems , Elsevier, 2000

work page 2000
[15]

Frank, A

F. Frank, A. Rupp, and D. Kuzmin , Bound-preserving flux limiting schemes for DG discretizations of conservation laws with applications to the C ahn-- H illiard equation , Computer Methods in Applied Mechanics and Engineering, 359 (2020), p. 112665

work page 2020
[16]

Glowinski, S

R. Glowinski, S. J. Osher, and W. Yin , Splitting methods in communication, imaging, science, and engineering , Springer, 2017

work page 2017
[17]

Goldstein and S

T. Goldstein and S. Osher , The split B regman method for L 1-regularized problems , SIAM journal on imaging sciences, 2 (2009), pp. 323--343

work page 2009
[18]

O. Guba, M. Taylor, and A. St-Cyr , Optimization-based limiters for the spectral element method , Journal of Computational Physics, 267 (2014), pp. 176--195

work page 2014
[19]

Guermond, M

J.-L. Guermond, M. Maier, B. Popov, and I. Tomas , Second-order invariant domain preserving approximation of the compressible N avier-- S tokes equations , Computer Methods in Applied Mechanics and Engineering, 375 (2021), p. 113608

work page 2021
[20]

Guermond, M

J.-L. Guermond, M. Nazarov, B. Popov, and I. Tomas , Second-order invariant domain preserving approximation of the E uler equations using convex limiting , SIAM Journal on Scientific Computing, 40 (2018), pp. A3211--A3239

work page 2018
[21]

Hajduk , Monolithic convex limiting in discontinuous G alerkin discretizations of hyperbolic conservation laws , Computers & Mathematics with Applications, 87 (2021), pp

H. Hajduk , Monolithic convex limiting in discontinuous G alerkin discretizations of hyperbolic conservation laws , Computers & Mathematics with Applications, 87 (2021), pp. 120--138

work page 2021
[22]

J. S. Hesthaven and T. Warburton , Nodal discontinuous G alerkin methods: algorithms, analysis, and applications , Springer, 2008

work page 2008
[23]

M. S. Joshaghani, B. Riviere, and M. Sekachev , Maximum-principle-satisfying discontinuous G alerkin methods for incompressible two-phase immiscible flow , Computer Methods in Applied Mechanics and Engineering, 391 (2022), p. 114550

work page 2022
[24]

Lai and X

R. Lai and X. Zhang , Ubiquitous L aplacian: An Introduction to Numerical PDE s with Applications in Data Science , World Scientific, 2026

work page 2026
[25]

T. Lin, S. Ma, and S. Zhang , On the global linear convergence of the ADMM with multiblock variables , SIAM Journal on Optimization, 25 (2015), pp. 1478--1497

work page 2015
[26]

Lions and B

P.-L. Lions and B. Mercier , Splitting algorithms for the sum of two nonlinear operators , SIAM Journal on Numerical Analysis, 16 (1979), pp. 964--979

work page 1979
[27]

C. Liu, G. T. Buzzard, and X. Zhang , An optimization based limiter for enforcing positivity in a semi-implicit discontinuous G alerkin scheme for compressible N avier-- S tokes equations , Journal of Computational Physics, 519 (2024), p. 113440

work page 2024
[28]

C. Liu, J. Hu, W. T. Taitano, and X. Zhang , An optimization-based positivity-preserving limiter in semi-implicit discontinuous G alerkin schemes solving F okker-- P lanck equations , Computers & Mathematics with Applications, 192 (2025), pp. 54--71

work page 2025
[29]

C. Liu, D. Milesis, C.-W. Shu, and X. Zhang , Efficient optimization-based invariant-domain-preserving limiters in solving gas dynamics equations , Journal of Computational Physics, (2026), p. 114839

work page 2026
[30]

C. Liu, D. Ray, C. Thiele, L. Lin, and B. Riviere , A pressure-correction and bound-preserving discretization of the phase-field method for variable density two-phase flows , Journal of Computational Physics, 449 (2022), p. 110769

work page 2022
[31]

C. Liu, B. Riviere, J. Shen, and X. Zhang , A simple and efficient convex optimization based bound-preserving high order accurate limiter for C ahn-- H illiard-- N avier-- S tokes system , SIAM Journal on Scientific Computing, 46 (2024), pp. A1923--A1948

work page 2024
[32]

Liu and X

C. Liu and X. Zhang , A positivity-preserving implicit-explicit scheme with high order polynomial basis for compressible N avier-- S tokes equations , Journal of Computational Physics, 493 (2023), p. 112496

work page 2023
[33]

Pazner , Sparse invariant domain preserving discontinuous G alerkin methods with subcell convex limiting , Computer Methods in Applied Mechanics and Engineering, 382 (2021), p

W. Pazner , Sparse invariant domain preserving discontinuous G alerkin methods with subcell convex limiting , Computer Methods in Applied Mechanics and Engineering, 382 (2021), p. 113876

work page 2021
[34]

D. W. Peaceman and H. H. Rachford, Jr , The numerical solution of parabolic and elliptic differential equations , Journal of the Society for industrial and Applied Mathematics, 3 (1955), pp. 28--41

work page 1955
[35]

J. A. Rossmanith , An unstaggered, high-resolution constrained transport method for magnetohydrodynamic flows , SIAM Journal on Scientific Computing, 28 (2006), pp. 1766--1797

work page 2006
[36]

Ruppenthal and D

F. Ruppenthal and D. Kuzmin , Optimal control using flux potentials: A way to construct bound-preserving finite element schemes for conservation laws , Journal of Computational and Applied Mathematics, 434 (2023), p. 115351

work page 2023
[37]

E. K. Ryu and W. Yin , Large-scale convex optimization: algorithms & analyses via monotone operators , Cambridge University Press, 2022

work page 2022
[38]

T \'o th , The B = 0 constraint in shock-capturing magnetohydrodynamics codes , Journal of Computational Physics, 161 (2000), pp

G. T \'o th , The B = 0 constraint in shock-capturing magnetohydrodynamics codes , Journal of Computational Physics, 161 (2000), pp. 605--652

work page 2000
[39]

J. J. van der Vegt, Y. Xia, and Y. Xu , Positivity preserving limiters for time-implicit higher order accurate discontinuous Galerkin discretizations , SIAM Journal on Scientific Computing, 41 (2019), pp. A2037--A2063

work page 2019
[40]

Wu , Positivity-preserving analysis of numerical schemes for ideal magnetohydrodynamics , SIAM Journal on Numerical Analysis, 56 (2018), pp

K. Wu , Positivity-preserving analysis of numerical schemes for ideal magnetohydrodynamics , SIAM Journal on Numerical Analysis, 56 (2018), pp. 2124--2147

work page 2018
[41]

K. Wu, H. Jiang, and C.-W. Shu , Provably positive central discontinuous G alerkin schemes via geometric quasilinearization for ideal MHD equations , SIAM Journal on Numerical Analysis, 61 (2023), pp. 250--285

work page 2023
[42]

Wu and C.-W

K. Wu and C.-W. Shu , A provably positive discontinuous G alerkin method for multidimensional ideal magnetohydrodynamics , SIAM Journal on Scientific Computing, 40 (2018), pp. B1302--B1329

work page 2018
[43]

Wu and C.-W

K. Wu and C.-W. Shu , Provably positive high-order schemes for ideal magnetohydrodynamics: analysis on general meshes , Numerische Mathematik, 142 (2019), pp. 995--1047

work page 2019
[44]

Wu and C.-W

K. Wu and C.-W. Shu , Geometric quasilinearization framework for analysis and design of bound-preserving schemes , SIAM Review, 65 (2023), pp. 1031--1073

work page 2023
[45]

K. Wu, X. Zhang, and C.-W. Shu , High order numerical methods preserving invariant domain for hyperbolic and related systems , SIAM Review (to appear) arXiv preprint arXiv:2512.09116, (2025)

work page arXiv 2025
[46]

Z. Xu , Parametrized maximum principle preserving flux limiters for high order schemes solving hyperbolic conservation laws: one-dimensional scalar problem , Mathematics of Computation, 83 (2014), pp. 2213--2238

work page 2014
[47]

S. T. Zalesak , Fully multidimensional flux-corrected transport algorithms for fluids , Journal of Computational Physics, 31 (1979), pp. 335--362

work page 1979
[48]

Zhang , On positivity-preserving high order discontinuous G alerkin schemes for compressible N avier-- S tokes equations , Journal of Computational Physics, 328 (2017), pp

X. Zhang , On positivity-preserving high order discontinuous G alerkin schemes for compressible N avier-- S tokes equations , Journal of Computational Physics, 328 (2017), pp. 301--343

work page 2017
[49]

Zhang and C.-W

X. Zhang and C.-W. Shu , On maximum-principle-satisfying high order schemes for scalar conservation laws , Journal of Computational Physics, 229 (2010), pp. 3091--3120

work page 2010
[50]

Zhang and C.-W

X. Zhang and C.-W. Shu , On positivity-preserving high order discontinuous G alerkin schemes for compressible E uler equations on rectangular meshes , Journal of Computational Physics, 229 (2010), pp. 8918--8934

work page 2010