Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 31 March
This paper addresses constrained smooth saddle-point problems in settings where projection onto the feasible sets is computationally expensive. We bridge the gap between projection-based and projection-free optimization by introducing a unified dual dynamic smoothing framework that enables the design of efficient single-loop algorithms. Within this framework, we establish convergence results for nonconvex-concave and nonconvex-strongly concave settings. Furthermore, we show that this framework is naturally applicable to convex-concave problems. We propose and analyze three algorithmic variants based on the application of a linear minimization oracle over the minimization variable, the maximization variable, or both. Notably, our analysis yields anytime convergence guarantees without requiring a pre-specified iteration horizon. These results significantly narrow the performance gap between projection-free and projection-based methods for minimax optimization.
Optimization and Control
Analyzing Performance and Scalability of Benders Decomposition for Generation and Transmission Expansion Planning Models
Generation and Transmission Expansion Planning (GTEP) problems co-optimize generation and transmission expansion, enabling them to provide better planning decisions than traditional Generation Expansion Planning or Transmission Expansion Planning problems, but GTEPs can be computationally complex or intractable. Benders Decomposition (BD) has been applied to expansion planning problems, with various methods applied to accelerate convergence. In this work, we test strategies for improving the performance of BD on GTEP models with nodal resolution and DCOPF constraints. We also present an alternative approach for handling the bilinear constraints that can result in these problems. These tests included combinations of using generalized Benders decomposition (GBD), hot-starting via a transport constrained model, using linear relaxations of the master problem, and using regularization. We test these methods on mixed-integer linear programming GTEP models with up to 146 buses (10 million continuous variables and 400 mixed-integer decisions). With selected accelerated Benders decomposition approaches, the problems can be solved to under a 1% gap in as little as 5 hours where they were otherwise intractable. Results also suggest that using regularization on these initial hot-starting and relaxation steps and turning it off after they are complete was generally the best combination of strategies.
Read the full abstract
Numerical Analysis
Minimum residual discretization of a semilinear elliptic problem
We propose a least-squares penalization as a means to extend the discontinuous Petrov-Galerkin (DPG) method with optimal test functions to a class of semilinear elliptic problems. The nonlinear contributions are replaced with independent unknowns so that standard DPG techniques apply to the resulting linear problem with non-trivial kernel. The nonlinear relations are added as least-squares constraints. Assuming solvability of the semilinear problem and an Aubin–Nitsche-type approximation property for the primal variable, we prove a Céa estimate for the approximation error in canonical norms. We also give conditions ensuring unique solvability and, under additional regularity and stability assumptions, derive the required nonlinear Aubin-Nitsche estimate. Numerical results with uniform and adaptively refined meshes illustrate the performance of the scheme, also in comparison with the Gauss-Newton approach.
Read the full abstract
Dynamical Systems
Bayesian methods for the identification of model parameters for water transport in porous media
The structure of the nonlinear inverse problem arising from capillarity-driven imbibition in porous media is investigated, considering a degenerate parabolic PDE with compactly supported diffusivity and boundary-driven fluxes as the governing forward model. The inverse problem – inferring hydraulic model parameters from sparse integral absorption measurements – is inherently ill-posed: the nonlinear forward operator induces anisotropic parameter sensitivity and structured correlations that render the calibration landscape non-convex and partially unidentifiable. To characterise this structure rigorously, Approximate Bayesian Computation with Sequential Monte Carlo (ABC-SMC) is adopted as a likelihood-free inferential framework, bypassing the analytical intractability of the likelihood while providing full posterior distributions over the parameter space. Two physically motivated parameterisations of the diffusivity function are analysed – the Natalini-Nitsch (NN) and the BkP formulations. It is shown that the posterior geometry obtained via ABC-SMC encodes, in directly readable form, the sensitivity structure of the nonlinear forward operator: the principal component decomposition of the posterior covariance provides a natural hierarchy of parameter sensitivity, with low-variance eigendirections identifying the parameter combinations to which the forward map is most responsive. This geometric decomposition constitutes a principled and computationally efficient alternative to classical sensitivity analysis, arising as a byproduct of the calibration procedure. These findings are established through both synthetic experiments, confirming accurate parameter recovery, and real laboratory imbibition data from materials of cultural heritage relevance.
Read the full abstract
Algebraic Geometry
The local geometry of the stack of $A_r$-stable curves
In this paper we study the local geometry of the stack of pointed $A_r$-stable curves. In particular, we analyze the deformation theory of $A_r$-stable curves and their automorphism groups in order to study the combinatorics of families of curves over $[\mathbb{A}^1/\mathbb{G}_m]$, and use this to classify all closed points of the stack of $A_r$-stable curves. As a byproduct, we also classify all open substacks of the moduli stack of degree $2$ cyclic covers of $\mathbb{P}^1$ that admit a separated good moduli space. This is the first in a series of three papers aimed at studying obstructions for the existence of good moduli spaces for stacks of curves with $A$-type singularities, and using these to find an open substack of the stack of $A_r$-stable curves that admits a proper non-projective good moduli space when $r=5$.
Read the full abstract
Geometric Topology
Free Circle Actions and Positive Ricci Curvature on Manifolds with the Cohomology Ring of $S^2\times S^5$
We classify which of the 672 oriented diffeomorphism types of closed, simply-connected spin 7-manifolds with the cohomology ring of $S^2\times S^5$ admit a free circle action. In addition, we show that whenever such an action exists, there exist infinitely many pairwise non-equivalent free circle actions. Finally, in almost all cases where such an action exists, we construct invariant Riemannian metrics of positive Ricci curvature.
Read the full abstract
Combinatorics
Two Littlewood identities for fully inhomogeneous spin Hall-Littlewood symmetric rational functions
Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_\lambda$ arise as partition functions of certain path configurations in the $\mathfrak{sl}_2$ higher spin six vertex models. They are multiparameter generalizations of the classical Hall-Littlewood symmetric polynomials. We establish two new generalizations of the classical Littlewood identity, where we express a weighted sum of $F_\lambda$'s over all partitions $\lambda$ as a product of the Littlewood kernel and another simple product in one case, and a product of the Littlewood kernel and a Pfaffian in the other case. As a corollary we obtain a novel Littlewood identity for Hall-Littlewood symmetric polynomials. We also elaborate on the newly established connection between the fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_\lambda$ and the modified Robbins polynomials, the latter being multivariate generating functions for alternating sign matrices. This connection allowed us to discover the two generalizations of the Littlewood identity and we provide a bijection between the underlying combinatorial models in the case where $\lambda$ is strictly decreasing.
Read the full abstract
General Mathematics
On the shortest open cubic equations
We use cubic reciprocity to prove that the equation $7x^3+2y^3=3z^2+1$ has no integer solutions. Prior to this work, it was the shortest cubic equation for which the existence of integer solutions remained open. We conclude with a list of the new shortest open cubic equations.
Algebraic Geometry
The boundary of K-moduli of prime Fano threefolds of genus twelve
We study the K-moduli stack of prime Fano threefolds of genus twelve, known as $V_{22}$. We prove that its boundary, which parametrizes singular members, is purely divisorial and consists of four irreducible components corresponding to the four families of Prokhorov's one-nodal $V_{22}$. A key ingredient is a modular relation between Fano threefolds $X$ and their anticanonical K3 surfaces $S$. We prove that the forgetful morphism from the moduli of Fano–K3 pairs $(X,S)$ where $X$ is a K-semistable degeneration of $V_{22}$ to the moduli space of genus $12$ polarized K3 surfaces $(S,{-K_X}|_S)$ is an open immersion. In particular, the K-moduli of $V_{22}$ is governed by the moduli of their anticanonical K3 surfaces, providing a modular realization of Mukai's philosophy. Along the way, we develop a general deformation framework for Fano threefolds of large volume, which may be useful beyond the study of K-moduli.
Read the full abstract
Mathematical Physics · Cross-listed from gr-qc
Beyond Expectation Values: Generalized Semiclassical Expansions for Matrix Elements of Gauge Coherent States
We derive an asymptotic expansion for off-diagonal coherent-state matrix elements of non-polynomial operators in gauge theories admitting holomorphic coherent-state representations. The derivation combines stationary-phase analysis with an operator-level treatment of the Taylor remainder, and yields explicit semiclassical error control under stated assumptions. As a primary application, we formulate the expansion for volume and flux related operators in Loop Quantum Gravity and compare it with the standard diagonal expansion proposed in arXiv:gr-qc/0607101. By organizing the expansion around the genuine off-diagonal Berezin symbol rather than a diagonal expectation value, the resulting formula preserves the full holomorphic structure of the geometric phase and reproduces benchmark matrix elements accurately in the numerical regimes tested here, particularly when the coherent-state labels are well separated.
Read the full abstract
Analysis of PDEs
A new Duhamel-type principle with applications to geometric (in)equalities
We introduce a simple new method, based on the Caffarelli-Silvestre extension and a Duhamel-type formula, to derive exact pointwise identities for fractional commutators and nonlinear compositions associated with the fractional Laplacian on general Riemannian manifolds. As applications, we obtain a pointwise fractional Leibniz rule, a fractional Bochner's formula with an explicit Ricci curvature term, apparently the first of this kind, and exact remainders in the Córdoba-Córdoba and Kato inequalities for the fractional Laplacian. All these formulas are new even in the Euclidean space.
Read the full abstract
Category Theory
Day convolution for algebraic patterns
We characterize the exponentiable objects for a wide range of structures prevalent in $\infty$-categorical algebra, extending the construction of Day convolution to more general structures than $\infty$-operads. More precisely, we give a criterion that is both necessary and sufficient for many of these structures encountered in practice, such as (equivariant) $\infty$-operads and virtual double $\infty$-categories. We work within the framework of algebraic patterns of Chu-Haugseng that describe these structures in terms of weak Segal fibrations. As part of the proof, we give a new description of weak Segal fibrations in terms of generalized Segal spaces on certain "tree" categories. We also define the "underlying graph" of a weak Segal fibration, extending the notion of the underlying $\infty$-category for $\infty$-operads, and explicitly describe the underlying graph of exponential objects in weak Segal fibrations.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Floquet Codes from Derived Semi-Regular Hyperbolic Tessellations on Orientable and Non-Orientable Surfaces
In this paper, we construct several new quantum Floquet codes on compact, orientable, as well as non-orientable surfaces. In order to obtain such codes, we identify these surfaces with hyperbolic polygons and examine hyperbolic semi-regular tessellations on such surfaces. The method of construction presented here generalizes similar constructions concerning hyperbolic Floquet codes on connected and compact surfaces with genus $g \geq 2$. A performance analysis and an investigation of the asymptotic behavior of these codes are also presented.
Read the full abstract
Analysis of PDEs
Partial regularity for minimizing constraint maps for the Alt-Phillips energy
In this paper, we establish an $\varepsilon$-regularity theorem for minimizers of an Alt-Phillips type functional subject to constraint maps. We prove that under sufficiently small energy, the minimizers exhibit regularity, and hence proving the smoothness of these maps. From here, we bootstrap to optimal regularity.
Read the full abstract
Numerical Analysis · Cross-listed from cs.MS
BioNetFlux: A Python Framework for Reaction–Diffusion–Chemotaxis Simulations on One-Dimensional Network Geometries
We present BioNetFlux, an open-source Python framework for the numerical simulation of coupled systems of partial differential equations (PDEs) on one-dimensional multi-arc networks by the Hybridized Discontinuous Galerkin method. Its design targets biological transport phenomena on graph-like geometries that arise naturally in microfluidic organ-on-chip (OoC) devices, vascular networks, and in-vitro cell-migration assays.
Read the full abstract
Number Theory
Weber modular curves and modular isogenies
We study the modular curves defined by Weber functions, and associated modular polynomials, action of $\mathrm{SL}_2(\mathbb{Z})$, and parametrizations of elliptic curves with a view to the study of the isogeny graphs that they determine, particularly for supersingular elliptic curves. In addition to applications to efficient isogeny computation in cryptographic applications, we present an application to explicit Galois representations.
Read the full abstract
Analysis of PDEs
Wave propagation of a generic non–conservative compressible two–fluid model
The generalized Huygens principle for the Cauchy problem of a generic non-conservative compressible two-fluid model in R3 was established. This work fills a key gap in the theory, as previous results were confined to systems with full conservation laws or “equivalent" conservative structures from specific compensatory cancellations in Green's function. Indeed, the genuinely non-conservative model studied here falls outside these categories and presents two major analytical challenges. First, its inherent non-conservative structure blocks the direct use of techniques (e.g., variable reformulation) effective for conservative systems. Second, its Green's function contains a -1-order Riesz operator associated with the fraction densities, which generates a so-called Riesz wave-IV exhibiting both slower temporal decay and poorer spatial integrability compared to the standard heat kernel, necessitating novel sharp convolution estimates with the Huygens wave. To overcome these difficulties, we develop a framework for precise nonlinear coupling, including interaction of Riesz wave-IV and Huygens wave. A pivotal step is extracting enhanced decay rates for the non-conservative pressure terms. By reformulating these terms into a product involving the fraction densities and the specific combination of fractional densities, and then proving this combination decays faster than the individual densities, we meet the minimal requirements for the crucial convolution estimates. This allows us to close the nonlinear ansatz by constructing essentially new nonlinear estimates. The success of our analysis stems from the model's special structure, particularly the equal-pressure condition. More broadly, the sharp nonlinear estimates developed herein is applicable to a wide range of non-conservative compressible fluid models.
Read the full abstract
Geometric Topology
On smooth structures over $4$-manifolds with fundamental group of even order
We show that any topological, closed, oriented, non-spin $4$-manifold with fundamental group $\mathbb{Z}_{4k}$ and $\min(b_2^+, b_2^-)\geq 15$, has either none or infinitely many distinct smooth structures. Furthermore, we construct infinitely many non-diffeomorphic, irreducible, smooth structures on manifolds with signature zero, $b_2^+$ even and fundamental group $\mathbb{Z}_2\times G$, for any finite group $G$. This extends the results of Baykur-Stipsicz-Szabó.
Read the full abstract
Number Theory
From Orientations to $\ell$-adic Period Vectors
We propose a bridge between oriented supersingular elliptic curves and the arithmetic of modular curves. To an $\mathcal{O}$-oriented supersingular curve, we attach a class in the relative homology group $H(X_0(N),C,\mathbb{Z})$, i.e. modular symbols, compatible with the Hecke action. We then compute vectors of $\ell$-adic periods by pairing with weight $2$ cusp forms via Coleman integration. This yields an explicit, computable map from short combinatorial homology representatives to truncated vectors in $(\mathbb{Z}/\ell^m\mathbb{Z})^d$. Motivated by this encoding, we formulate the Modular Symbol Inversion (MSI) problem – recovering a short homology representative from its truncated $\ell$-adic period data – and discuss its arithmetic structure, its relation to path problems on isogeny graphs and Bruhat-Tits trees, and potential applications to cryptographic constructions.
Read the full abstract
Optimization and Control
Noncooperative Game in Multi-controller System under Delayed and Asymmetric Information
We address a noncooperative game problem in multi-controller system under delayed and asymmetric information structure. Under these conditions, the classical separation principle fails as estimation and control design become strongly coupled, complicating the derivation of an explicit Nash equilibrium. To resolve this, we employ a common-private information decomposition approach, effectively decoupling control inputs and state estimation to obtain a closed-form Nash equilibrium. By applying a forward iterative method, we establish the convergence of the coupled Riccati and estimation error covariance recursions, yielding both the steady-state Kalman filter and the Nash equilibrium. Furthermore, we quantify the impact of asymmetric information, proving that a richer information set reduces the costs for the corresponding player. Finally, numerical examples are provided to demonstrate the effectiveness of the results.
Read the full abstract
Functional Analysis
Exceptional Sets for Quasiconformal Mappings in General Metric Spaces II
A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation – a purely metric quantity – is uniformly bounded. Gehring proved that it will suffice to verify the uniform bound up to a set of measure zero as long as we can show that the dilatation is finite outside a subset of finite Hausdorff–$(n-1)$ measure. In short, we say that we can allow an exceptional codimension $1$ subset. In the metric setting, it has been proved, roughly speaking, that one can allow an exceptional codimension $p$ subset, $p \ge 1$, if the source space satisfies a $p$-Poincaré inequality. We prove, effectively, the sharpness of the latter claim.
Read the full abstract
Optimization and Control
Generalizing Output-Feedback Covariance Steering to Incorporate Non-Orthogonal Estimation Errors
This paper addresses the problem of steering a state distribution over a finite horizon in discrete time with output feedback. The incorporation of output feedback introduces additional challenges arising from the statistical coupling between the true state distribution and the corresponding filtered state distribution. In particular, this paper extends existing covariance steering formulations to scenarios in which estimation errors are not orthogonal to the state estimates. This paper presents a sequential convex programming framework with rank constraints to solve this more general covariance steering with output feedback problem. The proposed approach is validated through numerical examples and Monte Carlo simulations, including cases with non-orthogonal estimation errors that prior techniques cannot address.
Read the full abstract
Rings and Algebras
Semilattice sums of algebras and Mal'tsev products of varieties
The Mal'tsev product of two varieties of similar algebras is always a quasivariety. We consider the question of when this quasivariety is a variety. The main result asserts that if $\mathcal{V}$ is a strongly irregular variety with no nullary operations and at least one non-unary operation, and $\mathcal{S}$ is the variety, of the same type as $\mathcal{V}$, equivalent to the variety of semilattices, then the Mal'tsev product $\mathcal{V} \circ \mathcal{S}$ is a variety. It consists precisely of semilattice sums of algebras in $\mathcal{V}$. We derive an equational base for the product from an equational base for $\mathcal{V}$. However, if $\mathcal{V}$ is a regular variety, then the Mal'tsev product may not be a variety. We discuss various applications of the main result, and examine some detailed representations of algebras in $\mathcal{V} \circ \mathcal{S}$.
Read the full abstract
Probability
From $L$-domination maximal inequalities to infinite-dimensional martingales, towards high-dimensional statistics
A novel approach is proposed to establish a sharp upper bound on the expected supremum of a separable martingale random field, serving as an alternative to classical universal chaining-based methods. The proposed approach begins by deriving a new "$L$-domination maximal inequality" for a finite class of discrete-time martingales. This is achieved by using some variations of log-sum-exp and softmax functions, as well as martingale transforms, avoiding the simple use of the triangle inequality. We apply this inequality to obtain a generalization of Lenglart's inequality for discrete-time martingales, extending it from the one-dimensional case to finite-dimensional settings, and further to certain infinite-dimensional cases through a "finite approximation device." The primary applications include several weak convergence theorems for sequences of separable martingale random fields under the uniform topology. In particular, new results are established for i.i.d. sequences, including a necessary and sufficient condition for classes of functions to possess the Donsker property. Additionally, we provide new moment bounds for the supremum of empirical processes indexed by classes of sets or functions. The results and methods presented in this paper are also expected to be highly useful for high-dimensional statistics, including LASSO and Dantzig selectors, as they are demonstrated in the last part of this paper.
Read the full abstract
Analysis of PDEs
Dispersive estimates for Schrödinger operators with negative Coulomb-like potentials in one dimension
In this paper, we consider the dispersive estimates for Schrödinger operators with Coulomb-like decaying potentials, such as $V(x)=-c|x|^{-\mu}$ for $|x|\gg 1$ with $0<\mu<2$, in one dimension. As an application, we establish both the standard and orthonormal Strichartz estimates for this model. One of the difficulties here is that perturbation arguments, which are typically applicable to rapidly decaying potentials, are not available. To overcome this, we derive a WKB expression for the spectral density and use a variant of the degenerate stationary phase formula to exploit its oscillatory behavior in the low-energy regime.
Read the full abstract
Combinatorics
Reciprocity of Skew Hall-Littlewood-Schubert Series
Carnevale, Schein and Voll proved self-reciprocity of the generalized Igusa functions, and Maglione and Voll did the same for the Hall-Littlewood-Schubert series. We introduce a simultaneous generalization and refinement of these two rational functions, and prove that it satisfies a self-reciprocity property. This answers a problem posed by Maglione and Voll. Our method of proof is elementary, avoiding the use of $p$-adic integration.
Read the full abstract
Dynamical Systems
Entropy structures with continuous partitions of unity
Using only continuous partitions of unity, we provide equivalent definitions for the metric, topological and topological tail entropies and pressures of a continuous self-map of a compact set, as well as their conditional versions. A tail variational principle for these new definitions is proved. We extend Downarowicz's notions of candidates and entropy structures to account for almost-increasing sequences of functions arising from the new definitions. Finally, we deduce a partial answer to a question raised by Newhouse.
Read the full abstract
Numerical Analysis
Adaptive Multilevel Methods for the Maxwell Eigenvalue Problem
In this paper, we propose an adaptive multilevel preconditioned Helmholtz-Jacobi-Davidson (PHJD) method for the Maxwell eigenvalue problem with singularities. The key idea in this work is to employ the local multilevel method for preconditioning the Jacobi-Davidson correction equation. It is shown that our convergence factor is quasi-optimal, which means the convergence factor is independent of mesh sizes and mesh levels provided the coarse mesh is sufficiently fine. Numerical experiments on complex domains are carried out to confirm the theoretical results and demonstrate the efficiency of the proposed method.
Read the full abstract
Information Theory
{\alpha}-Fair Multistatic ISAC Beamforming for Multi-User MIMO-OFDM Systems via Riemannian Optimization
This paper proposes an $\alpha$-fair multistatic integrated sensing and communication (ISAC) framework for multi-user multi-input multi-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems, where communication users act as passive bistatic receivers to enable multistatic sensing. Unlike existing works that optimize aggregate sensing metrics and thus favor geometrically advantageous targets, we minimize the $\alpha$-fairness utility over per-target Cramér–Rao lower bounds (CRLBs) subject to per-user minimum data rate and transmit power constraints. The resulting non-convex problem is solved via the Riemannian conjugate gradient (RCG) method with a smooth penalty reformulation. Simulation results validate the effectiveness of the proposed scheme in achieving a favorable sensing fairness–communication trade-off.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Nonnegative Matrix Factorization in the Component-Wise L1 Norm for Sparse Data
Nonnegative matrix factorization (NMF) approximates a nonnegative matrix, X, by the product of two nonnegative factors, WH, where W has r columns and H has r rows. In this paper, we consider NMF using the component-wise L1 norm as the error measure (L1-NMF), which is suited for data corrupted by heavy-tailed noise, such as Laplace noise or salt and pepper noise, or in the presence of outliers. Our first contribution is an NP-hardness proof for L1-NMF, even when r=1, in contrast to the standard NMF that uses least squares. Our second contribution is to analyze, under simplified probabilistic assumptions, how the sparsity in the data enforces zero solution in the optimal scalar update in the factors of L1-NMF when all the other entries are kept fixed. This provides an intuition of the connection between the sparsity of the L1-NMF factors with the sparsity of the input. Even though sparsity favors interpretability, if the data is affected by false zeros, too sparse solutions might degrade the model. Our third contribution is a new, more general, L1-NMF model for sparse data, dubbed weighted L1-NMF (wL1-NMF), where the sparsity of the factorization is controlled by adding a penalization parameter to the entries of WH associated with zeros in the data. The fourth contribution is a new coordinate descent (CD) approach for wL1-NMF, denoted as sparse CD (sCD), where each subproblem is solved by a weighted median algorithm. Although it lacks convergence guarantees to a stationary point, sCD is, to the best of our knowledge, the first algorithm for L1-NMF whose complexity scales with the number of nonzero entries in the data, making it efficient in handling large-scale, sparse data. We perform extensive numerical experiments on synthetic and real-world data, including imaging mass spectrometry and topic modeling, to show the effectiveness of our new proposed model (wL1-NMF) and algorithm (sCD).