Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 24 April
Many engineered systems must balance competing objectives, such as performance and safety, cost and reliability, or efficiency and sustainability, and are naturally modeled as compositions of interacting subsystems. We study online multi-objective decision-making in monotone co-design, where functionalities and resources are partially ordered, and the goal is to identify the target-feasible antichain of non-dominated trade-offs using few expensive evaluations. We introduce optimistic evaluators: history-dependent bounds on functionality and resource mappings that enable safe elimination of implementations before full evaluation. Based on these evaluators, we develop an elimination-based rejection-sampling algorithm, prove its soundness, and show that the admissible region shrinks monotonically as information accumulates. We instantiate the framework under monotonicity, Lipschitz continuity, and linear-parametric structure. For compositional co-design problems modeled by multigraphs, we show how local optimistic certificates propagate through the tractable remainder of the graph to yield system-level optimistic feasibility and resource bounds. Experiments on multi-robot fleet design, intermodal mobility systems, and synthetic monotone and Lipschitz benchmarks show substantial sample-efficiency gains over uniform sampling, Bayesian optimization, and multi-objective evolutionary algorithms.
Mathematical Physics
Two-layer sharply stratified Euler fluids in three dimensions: a Hamiltonian setting
Three-dimensional two-layer incompressible Euler fluids are studied from a Hamiltonian perspective. A natural Hamiltonian structure for the effective 2D model described by the interface-value of the field variables is obtained by means of a Hamiltonian reduction process from the 3D Poisson structure. The problem of expressing the fluid's energy in terms of the reduced variables is considered, and it is shown that in the weakly non linear approximation our procedure gives rise to a so-called 2D Kaup-Broer-Kupershmidt Boussinesq (KBK-B) model with “critical" parameters. A model weakly dependent on one of the two horizontal directions is also discussed, whose unidirectionalization turns out to be the well-known Kadomtsev-Petviashvili (KP) equation. A Dirac-type reduction process of the Hamiltonian structure of the KBK-B model yields a natural Hamiltonian structure for KP qua 2+1-dimensional model.
Read the full abstract
Classical Analysis and ODEs
Skew-orthogonal polynomials for a quartic Freud weight: two classes of quasi-orthogonal polynomials
This work is a thorough investigation of skew-orthogonal polynomials with respect to a quartic Freud weight. We provide an explicit method to evaluate skew-orthogonal polynomials of any degree as linear combinations of orthogonal polynomials. The coefficients of these combinations can be evaluated via novel recursive relations. Moreover, we observe that skew-orthogonal polynomials with even and odd degree constitute two families of quasi-orthogonal polynomials with respect to two different semi-classical Laguerre weights, and we provide the first instance of closed recursive relations involving skew-orthogonal polynomials only.
Read the full abstract
Representation Theory
Degeneration order of $3\times 3$ nilpotent matrix tuples
The degeneration order of simultaneous similarity classes of $3\times 3$ nilpotent matrix tuples is determined, and is shown to be given by rank conditions.
Rings and Algebras
On the rank of quaternion Hankel matrices
This paper discusses the left and right ranks of quaternion matrices with Hankel structure. While they are in general different for arbitrary quaternion matrices, we show that the left and right ranks of quaternion Hankel matrices are equal. Moreover, we establish the relation between Hankel matrices and the existence of linear recurrence relations with quaternion coefficients and discuss some practical implications for computational methods relying on low-rank properties of quaternion Hankel matrices.
Read the full abstract
Analysis of PDEs
Strong solutions and stability for a thin-film equation of shear-thinning fluids with contact line in partial wetting
We consider a power-law thin-film equation for strongly shear-thinning fluids. Weak solutions to this equation have been constructed more than twenty years ago by Ansini and Giacomelli. Here, we pass over to analyzing strong solutions with nonzero contact angle (partial-wetting regime), and place emphasis on studying the behavior of solutions near points where the film height vanishes (the contact-line region) by considering perturbations of a linear profile. The leading-order equation in von-Mises coordinates shows similarities with the evolution equation for the $p$-Laplace, though being of fourth order. Using a time discretization, we reduce the leading-order problem to finding a variational solution, and pass to the limit in the discretization scheme on suitably estimating higher-order nonlinear terms in conjunction with compactness arguments. This proves existence and asymptotic stability of strong solutions that are perturbations of the linear profile, and yields control on the contact-line velocity on carefully tracking singular terms in our estimates. While we believe that the transformed equation shows mathematical features the analysis of which stands on its own merit, it also physically corroborates shear thinning behavior as an alternative in resolving the no-slip paradox, as opposed to more standard approaches like introducing slip at the liquid-solid interface.
Read the full abstract
Numerical Analysis
Nonconforming virtual element method for the Monge-Ampère equation
In this article, we develop the $C^1$-nonconforming $C^0$-conforming virtual element method (VEM) for the vanishing moment approximation of the second-order fully nonlinear Monge-Ampère equation in two dimensions. In the vanishing moment equation an artificial biharmonic term is introduced which produces a quasilinear fourth order problem. We derive optimal a priori error estimates in the $H^2$-, $H^1$- and $L^2$-norms for the virtual element method, and show the existence and uniqueness of the virtual element solution. We perform several numerical experiments to validate the convergence rate of the error with respect to the mesh size.
Read the full abstract
Information Theory
On the Optimum Secrecy Outage Probability and Ergodic Secrecy Rate over Wireless Channels
We study the secrecy of wireless channels in the presence of an eavesdropper, where the channels are random and the transmitter only has knowledge of the channel statistics. We investigate the optimal input distribution with respect to several secrecy metrics: the Secrecy Outage Probability (SOP), defined as the probability that the coding rate $r$ exceeds the instantaneous secrecy rate; the Ergodic Secrecy Rate (ESR), defined as the expected secrecy rate over channel realizations; and the Ergodic Positive Secrecy Rate (EPSR), defined as the expected value of the positive part of the secrecy rate. We introduce two partial orderings for random channels: the uniformly less noisy order and the less noisy on average order. We show that when the main channel is uniformly less noisy than the eavesdropper channel, the optimal input distribution is a non-precoded Gaussian input for both the SOP and the EPSR. Furthermore, we show that the same input distribution is optimal for the ESR when the less noisy on average order holds. In addition, similar optimality results for the SOP and the EPSR are obtained for single-transmit-antenna channels without requiring any channel ordering assumptions. Closed-form expressions of the secrecy metrics are derived for special cases of Rayleigh fading channels.
Read the full abstract
Differential Geometry
Static Vacuum Spacetimes with $\Lambda<0$ as Attractors of the Ricci-Harmonic Flow
We prove dynamical stability and instability theorems for asymptotically hyperbolic static solutions of Einstein's equation with $\Lambda<0$, viewed as self-similar solutions of the Ricci-harmonic flow. More precisely, we show that static metrics are dynamically stable if and only if a positive mass type theorem holds for nearby metrics. Our key tool is a new variant of the expander entropy for the Ricci-harmonic flow.
Read the full abstract
Combinatorics
Increasing arc-connectivity by bounded- and fixed-size inversions
For a digraph $D$ and some $X \subseteq V(D)$, the inversion of $X$ is the operation of flipping all arcs both of whose endvertices are in $X$. We initiate the study of establishing arc-connectivity properties by applying inversions of bounded or fixed size. For fixed-size inversions, the feasibility problem is interesting. For all integers $p \geq 2$ and $k \geq 1$, we give a characterization of the digraphs that can be made $k$-arc-strong by applying inversions of size exactly $p$, provided they are sufficiently large. For bounded-size inversions, the feasibility problem is easy, so we focus on minimising the number of inversions. We prove that for all integers $p\geq 3$ and $k \geq 1$ and any $\epsilon>0$, there exists a polynomial-time $(4k-2+\epsilon)$-approximation algorithm for computing the minimum number of inversions of size at most $p$ that make a given digraph $k$-arc-strong. This is in stark contrast to other results on inversion optimization problems. On the other hand, we show that for any $p\geq 3$ and $k \geq 1$ the problem is NP-hard, and, moreover, APX-hard. As a result on parameterized complexity, we show that for any $k \geq 2$, it is $W[1]$-hard with respect to $p$ to decide whether a given digraph can be made $k$-arc-strong by applying a single inversion of size at most $p$. We also prove that for a given multidigraph, it is $W[1]$-hard with respect to $\ell$ to decide whether it can be made 2-arc-strong by applying $\ell$ inversions of size 2.
Read the full abstract
Optimization and Control
Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
We investigate the Stochastic Krasnoselskii-Mann iterations for expected nonexpansive fixed-point problems in a real separable Hilbert space. We establish convergence guarantees under significantly weaker assumptions on the variance than those typically used in the literature. In particular, instead of a uniform bound on the variance of the stochastic oracle, we only assume finite variance at a single fixed point. Under this assumption, we prove almost sure weak convergence of the iterates, derive convergence rates for the expected residual and the last-iterate residual, and obtain almost sure convergence rates for the running minimum residual. Notably, we recover the best-known stochastic oracle complexity without imposing uniformly bounded variance. We illustrate the applicability of our results to Stochastic Gradient Descent, where we recover known guarantees, to Stochastic Three-Operator Splitting and Stochastic Backward-Forward Splitting, for which we obtain the first results that avoid uniform variance bounds, and to a novel Stochastic Lifted Three-Operator Splitting.
Read the full abstract
Category Theory
Weak action representability of $2$-nilpotent groups
In this article, we investigate the representability of actions of the category $\mathsf{Nil}_2(\mathsf{Grp})$ of $2$-nilpotent groups. We first provide an algebraic characterisation of derived actions in $\mathsf{Nil}_2(\mathsf{Grp})$ in terms of the group $\operatorname{Aut}_c(X)$ of central automorphisms of an object $X$. We also characterise the morphisms $B \to \operatorname{Aut}_c(X)$ that define an action of $B$ on $X$ in $\mathsf{Nil}_2(\mathsf{Grp})$. We then show that $\mathsf{Nil}_2(\mathsf{Grp})$ is not action representable, and that the existence of a weak representation is related to the amalgamation property. We prove that the category $\mathsf{Nil}_2(\mathsf{Grp})$ is weakly action representable, by exhibiting a strong amalgam of a suitable family of abelian subgroups of $\operatorname{Aut}_c(X)$: an explicit weak representing object of $X$ is the abelian group $\operatorname{Hom}(X/[X,X],\operatorname{Z}(X))$. Finally, we show that $\mathsf{Nil}_2(\mathsf{Grp})$ is not locally algebraically cartesian closed.
Read the full abstract
Functional Analysis
Acyclic Monotone Operators Are Not Closed Under Addition
Borwein and Wiersma [SIAM J. Optim. 18(3) (2007), 946-960] asked if the set of acyclic monotone operators is closed under addition. We answer this question in the negative.
Mathematical Physics · Cross-listed from quant-ph
On truncations of hierarchical equations of motion for finite-dimensional systems
We study truncations of hierarchical equations of motion (HEOM) for finite-dimensional open quantum systems. We prove that for finite-dimensional approximations constructed with a Schur-complement type of terminator, the spectrum converges to that of the full HEOM as the truncation depth increases. We also prove that this approximation is free of spectral pollution: sufficiently deep truncations do not produce spurious unstable modes, provided the exact HEOM is stable. We illustrate the results for the spin-boson model.
Read the full abstract
Probability
Sign-balance of random Laplace eigenfunctions
Motivated by the problem of the small-scale sign distribution of Laplace eigenfunctions, we introduce a strong notion of sign-balance for (eigen)functions, and prove that random eigenfunctions are sign-balanced above a precisely determined scale with almost full probability. The scale is proven to be optimal up to a logarithmic power of the energy. Our results include the important case of random spherical harmonics, as well as more general band-limited random waves on smooth Riemannian manifolds. Extending the notion of balance to arbitrary levels, we determine the precise optimum scale above which random eigenfunctions are volume-balanced with respect to non-zero levels. Beyond their intrinsic interest, our results serve as a model for a natural conjecture on the optimal scale at which deterministic Laplace eigenfunctions are sign-balanced.
Read the full abstract
Numerical Analysis
On a Hybrid Mixed Domain Decomposition Method
We present a domain decomposition formulation based on hybridization which is inspired by hybridized discontinuous Galerkin (HDG) methods, that enhance mixed domain decomposition methods by incorporating stabilization terms. Unlike discontinuous Galerkin methods, our analysis of the proposed finite element method is based on a corresponding consistent variational formulation and a perturbed Galerkin method. In the variational formulation the divergence appears not only within subdomains, but also as an $L^2$-surface quantity on the interfaces. Furthermore, the traces of the finite element functions on the interfaces are replaced by $L^2$-distributions. The well-posedness of the perturbed Galerkin method is shown for an appropriate choice of subspaces, in a manner similar to that of the variational formulation. For the finite element method we use Raviart-Thomas elements for the dual variable and piecewise polynomials for the primal and hybrid variables, respectively. We perform an analysis of the discretization error which is explicit in the stabilization parameter $\tau$. Numerical experiments for piecewise smooth solutions using finite element spaces of order~$q$ on curved quadrilateral meshes confirm the predicted convergence rate of $q+1$ for small values of $\tau$. In the error analysis we observe the discretization error to be uniformly bounded in $\tau$. Even for large $\tau$ values the observed convergence rates for the primal and for the hybrid variables are $q+1$. For the dual variable the convergence rate depends on the stabilization parameter and the mesh-width, with an asymptotic rate of $q+\tfrac12$.
Read the full abstract
Differential Geometry
Timelike Ricci curvature lower bounds via optimal transport for Orlicz-type Lorentzian costs
We study the optimal transport problem on globally hyperbolic spacetimes associated with Orlicz-type Lorentzian cost functions of the form $u \circ \ell$, where $u$ is a suitable monotonically increasing and concave function, and $\ell$ is the time separation. Our work encompasses and generalises the case $u(x) = u_p(x) = p^{-1}x^p$ for $p \in (0,1)$, as well as the more recent $p < 0$, which have been the only examples considered so far in the literature. A fundamental notion for our purposes is the property of $u$-separation for a pair of measures, which generalises McCann's $p$-separation and for which we are able to obtain strong duality to the full Orlicz-type optimization problem. In our main results, we characterise timelike Ricci curvature lower bounds via the convexity of the relative entropy along geodesics arising from the Orlicz-type optimal transport with cost $u \circ \ell$, which is a far-reaching generalisation of McCann's seminal work in the case $u = u_p$, $p \in (0,1)$.
Read the full abstract
Information Theory
Gamma-Distributed Geometric Constellation for ISAC: Design and Analysis
A novel Gamma-distributed geometric constellation design framework for integrated sensing and communication (ISAC) is proposed in this paper. In this framework, constellation points are modeled as samples drawn from a parameterized two-dimensional distribution, with a Gamma distribution for the amplitude and a uniform distribution for the phase. End-task performance metrics, namely, the probability of detection for sensing and mutual information for communication, are used as objective functions of the optimization problem, and the problem is solved via particle swarm optimization. We further derive analytical performance bounds for the proposed design, including the union bound on the symbol error rate for communication and the Cramer–Rao bound for sensing parameter estimation. The proposed method is compared with constellations obtained via end-to-end neural network design, demonstrating competitive performance while requiring significantly fewer parameters and no training data. Moreover, the proposed geometric constellation is more compatible with conventional system architectures than probabilistic or neural network-based designs.
Read the full abstract
Probability
Malliavin calculus for signatures with applications to finance
Malliavin calculus is a powerful and general framework for the analysis of square-integrable random variables, but it often suffers from a lack of tractability and explicit representations. To address this limitation, we focus on a subclass of random variables given by finite linear combinations of time-extended Brownian motion signatures. The class remains rich due to the universal approximation properties of signatures. Leveraging the algebraic structure of signatures, we first derive explicit formulas for the Malliavin derivative of signatures of continuous Itô processes. As a consequence, we obtain closed-form expressions for the Clark–Ocone representation, the Ornstein–Uhlenbeck semigroup and its generator, as well as the integration-by-parts formula within the class of Brownian signature variables. These results provide purely algebraic formulations of the classical operators of Malliavin calculus. As an application, we compute Greeks for general path-dependent options under signature volatility models, and numerically compare different choices of Malliavin weights.
Read the full abstract
Information Theory
Grouped Pattern and Multi-Periodogram Algorithm for Range Estimation in ISAC Systems
This paper proposes a grouped pattern (GP) for sensing signals and a corresponding multi-periodogram algorithm for range estimation in integrated sensing and communications (ISAC) systems. GP partitions subcarriers into groups with an identical intra-group configuration replicated across groups, producing range profiles with periodic peaks and a structured multi-peak signature that improves low-SNR target detection. By identifying targets via cross-pattern peak validation, the proposed approach reduces missed detections and false alarms while requiring fewer dedicated sensing resources. Extensive simulations demonstrate a 16.5% extended detection range and a 61% reduced false alarm rate compared to conventional methods.
Read the full abstract
History and Overview of Mathematics · Cross-listed from cs.LO
Ablation and the Meno: Tools for Empirical Metamathematics
We present the results from Meno, a simple autoformalizer that proves theorems in Lean by systematically exploring the space of both formal and informal proofs, and tactic ablation, a new method for exploring mathematical creativity under constraint. We show these tools in action on simple theorems found in Terrence Tao's Analysis I, selectively ablating solution paths associated with non-constructive proofs, and analyze the properties of the resulting population using Goedel Prover embeddings. Among other things, our analysis of this novel population reveals that they lie on low (one or two) dimensional submanifolds of the much higher-dimensional representation space, and far away from their corresponding human constructions.
Read the full abstract
Numerical Analysis
A New Adaptive Deep Learning based Reduced Order Model for Hybrid-Type Parabolic PDEs: Rigorous Error Analysis and Applications
This contribution proposes novel data-driven surrogate modeling approaches for parameterized parabolic PDEs, where the parameter dependence can be split into two parts with different decay behavior of the Kolmogorov $N$-width. Such problems naturally arise in many industrial flow processes with dominant advection or traveling fronts in the solution trajectories. To tackle this challenge, we extend the Deep Orthogonal Decomposition (DOD) method, recently introduced for related stationary problems, to the time-dependent setting. We introduce and rigorously analyze two DOD based approaches: Our approach is based on two novel adaptive deep learning-based surrogate models: The DOD-DL-ROM method which is a Reduced Order Model (ROM) that leverages the adaptive nature of DOD, and the DOD+DFNN method, which combines DOD with a generic Deep Feed-Forward Neural Network (DFNN). On the theory side, we generalize data-driven POD-based ROM arguments to the DOD setting, establishing a quantitative link between online performance and the regularity of an associated optimal map. Furthermore, we identify specific problem size and error tolerance requirements for DOD-based ROMs to outperform POD-based ROMs in hybrid-type problem classes, which is crucial for efficient computation. The significance of this work lies in its potential to accelerate the solution of complex PDEs, enabling faster design and optimization of industrial processes. The proposed approaches are demonstrated on a catalyst filter benchmark problem, showcasing their effectiveness and comparing favorably to traditional POD-based methods.
Read the full abstract
Probability
Asymptotics of Multi-Scale McKean–Vlasov Diffusions with Super-Linear Kernels: a Lifted Semigroup Approach
In this work, we establish the small-noise asymptotic behaviour (namely, the functional law of large numbers and the large deviation principle) for multi-scale McKean–Vlasov diffusions with super-linear kernels. In this setting, the interaction depends on the laws of both the slow component and the fast oscillating process. Consequently, the frozen (parameterized) system exhibits McKean–Vlasov dynamics, forming a nonlinear Markov process and thereby rendering the analysis more complex compared to existing works. We develop a lifted semigroup argument and employ a generalized Khasminskii time discretization scheme to derive the small-noise limit of the slow variable, providing explicit convergence rates. Furthermore, we introduce the notion of a lifted viable pair and utilize a generalized functional occupation measure approach to establish the Laplace principle, which is equivalent to the large deviation principle. The main results of this work find broad applications in multi-scale models arising in fields such as machine learning and optimization theory. In particular, our results can be employed to analyze the dynamics of multi-scale consensus-based methods for multilevel optimization, where the coefficients typically satisfy local Lipschitz continuity on the interaction kernels.
Read the full abstract
Numerical Analysis
Numerical homogenization for indefinite time-harmonic Maxwell equations
We propose a novel numerical homogenization method based on the edge multiscale approach for solving indefinite time-harmonic Maxwell equations in heterogeneous media with large wavenumber. Numerical methods for these equations in homogeneous media with high wavenumber are particularly challenging due to the so-called pollution effect: the mesh size must be significantly smaller than the reciprocal of the wavenumber to achieve a desired accuracy. This challenge is amplified in heterogeneous media, which frequently occur in practical applications such as metamaterial simulations, since resolving the heterogeneity is necessary for obtaining reliable solutions. Our approach overcomes this difficulty by avoiding explicit resolution of the heterogeneity, while employing a mesh size that depends almost linearly on the reciprocal of the wavenumber. The approximation properties and stability of the method rely critically on the development and rigorous analysis of a novel, nonstandard variational formulation, which constitutes the main innovation of this work. Extensive numerical experiments are provided to validate our theoretical findings.
Read the full abstract
Combinatorics
Cyclically $5$-edge-connected snarks with resistance $2$ and flow resistance $n$
Snarks are $2$-connected cubic graphs that do not admit a proper $3$-edge-coloring. For a cubic graph $G$, its resistance $r(G)$ is the minimum number of edges whose removal results in a $3$-edge-colorable graph, while its flow resistance $r_f(G)$ is the minimum number of edges whose removal results in a graph admitting a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}_2$-flow. In this paper, we provide an affirmative answer to a question recently posed by Allie, Máčajová, and Škoviera by constructing a family of cyclically $5$-edge-connected snarks for which the ratio $r_f(G)/r(G)$ is arbitrarily large.
Read the full abstract
Numerical Analysis · Cross-listed from cs.HC
Catheter Monitoring in Intelligent Endovascular Navigation Systems: Interactive Simulations and Mixed Reality for Enhanced Navigational Awareness
Purpose: Developing and testing a framework that integrates real-time catheter shape reconstruction, interactive simulations, and mixed reality visualization to enable accurate monitoring of catheter-vessel interactions during endovascular navigation. Methods: A finite element model (FEM) of the venous pathway from the right femoral vein to the inferior vena cava was generated from computed tomography data and implemented into an interactive simulation. Catheter motion was imposed as boundary condition, and catheter-vessel contact was modeled with a Lagrange multiplier formulation to compute vessel deformation. The framework was tested in-vitro using a sensorized catheter with Fiber Bragg Grating and electromagnetic sensors as it was advanced through a silicone replica of the vascular anatomy. Real-time sensor read-outs fed the simulation, and the updated catheter and vessel geometries were streamed to Hololens 2. The performance and accuracy of FEM-computed vessel wall displacement were validated against experimental ground-truth obtained via stereo frames triangulation. Results: The simulated time exceeded the real temporal extent by 12% during initial navigation and by 45% when the catheter reached the most tortuous portion. Hololens 2 rendering remained stable at 35-40 frames per second. The median relative displacement error between FEM-computed and ground-truth vessel wall displacements remained below 1 mm and 2.33 mm for these two phases, respectively. Conclusion: The study demonstrates the feasibility of integrating interactive biomechanical simulation with real-time sensor data to enable continuous monitoring of catheter-vessel interactions, with mixed reality visualization serving as a user interface to support operator decision-making.
Read the full abstract
Optimization and Control
On the equivalence of semidefinite programming and zero-sum semidefinite games
By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's original result was incomplete, in the sense that the reduction of a linear program to a zero-sum game did not work for all possible linear programs. We show that, under a natural constraint qualification requiring either the existence of strongly optimal primal-dual solutions or of a strictly unbounded direction, computing the solution of a semidefinite program is equivalent to finding optimal strategies in an associated zero-sum semidefinite game. Our work builds upon Ickstadt, Theobald, and Tsigaridas (2024), where, similar to Dantzig's work, the proposed reduction cannot handle a certain subclass of semidefinite programs. Our main proof ingredients for the equivalence result include: (i) a semidefinite generalization of von Stengel's (2023) extension of Dantzig's construction; (ii) techniques for handling more general duality phenomena in the semidefinite setting; and (iii) an explicit bound for the (coordinates) of the solutions of a semidefinite program. As a by-product, the game value provides a certificate: it is zero if and only if strongly optimal solutions exist, and otherwise optimal strategies yield an infeasibility certificate for the primal or dual program.
Read the full abstract
Functional Analysis
Remarks on infimum and maximal lower bounds of a set of bounded self-adjoint operators
The notions of infimum and maximal lower bounds of a set $\mathfrak M$ of bounded self-adjoint operators were mainly studied for a set $\mathfrak M$ of two elements. The present paper deals with more general sets $\mathfrak M$, where it is required that $\mathfrak M$ is nonempty and bounded from below. Kadison's theorem on the existence of the infimum of a two-element set is proved for a countable and weak-operator compact set $\mathfrak M$. Stott's recent results on the structure of the set of maximal lower bounds of a finite set of Hermitian matrices are discussed and partially generalized. We are also concerned with the greatest lower bound and maximal lower bounds under certain restrictions. It is shown that the set of all lower bounds of $\mathfrak M$ commuting with all elements of $\mathfrak M$ possesses the greatest element if $\mathfrak M$ is a set of pairwise commuting operators. The theorem of Moreland and Gudder on the existence of the greatest positive lower bound of a set of two positive matrices is extended to an arbitrary finite set of positive matrices.
Read the full abstract
Optimization and Control
Non static exponential turnpike property for optimal control problems with symmetries and boundary conditions
Optimal control problems with symmetries often admit a non stationary turnpike property called trim turnpike, which characterizes the convergence of optimal solutions to certain symmetry induced trajectories called trim primitives. In this paper we establish an exponential trim turnpike property for a class of optimal control problems with structural properties related to Abelian Lie group symmetries. The key ingredient of our approach is the introduction of an appropriate reduced optimal control problem. We show that extremals of the original problem can be characterized through a reduced Hamiltonian boundary value problem that coincides with the optimality system of the reduced problem. Under a hyperbolicity assumption on the equilibrium of the corresponding reduced Hamiltonian system we prove that optimal trajectories remain exponentially close, up to boundary layers near the endpoints, to a trim primitive defined by the static reduced problem. The theoretical results are illustrated on three representative examples: linear and nonlinear problems with quadratic cost and the Kepler orbital transfer problem.
Read the full abstract
Statistics Theory
Laplace Transform driven Stein-type Goodness-of-fit Tests for Pareto Distribution
The Pareto distribution plays a crucial role in various disciplines, necessitating robust goodness-of-fit tests for its validation. This article introduces a novel tests based on Stein's characterization and the Laplace transform, offering a fresh perspective on model assessment. We establish the asymptotic properties of the proposed test and evaluate its empirical performance against existing methods in terms of size and power. Our findings demonstrate that the new test often outperforms or performs comparably to established tests. In addition, real data applications illustrate its practical utility.