Searcharxiv⌕ Search

arXiv subjects

Dante Kalise

Publications and source records attributed to Dante Kalise.

At least 19 recordsLinked to original sources

Residual-Driven Basis and Data Selection for Polynomial Approximation of High-Dimensional Hamilton-Jacobi-Bellman Equations

We develop greedy strategies for selecting global polynomial basis functions and training data in the sparse approximation of high-dimensional partial differential equations, with emphasis on Hamilton-Jacobi-Bellman (HJB) equations arising in nonlinear optimal control. Inspired by the goal-oriented dual-weighted residual framework, we derive a closed-form, mesh-free indicator that predicts, to first order, the reduction of the PDE residual obtained by adding a single candidate basis function, without solving an adjoint problem. In the data-driven regime, we jointly select basis functions and gradient-augmented training samples by maximizing the predicted decrease of a supervised loss. Numerical experiments on benchmark PDEs and nonlinear optimal control problems in up to 35 dimensions show accuracy comparable to non-adaptive approaches with substantially fewer basis functions and training samples.

math.NA↗

Consensus-Based Optimization of Path-Integral Free Energy for Model Predictive Control

We propose CBO-MPPI, a sampling-based predictive controller that applies consensus-based optimization (CBO) to the free energy underlying model predictive path integral control (MPPI). Under hard constraints, this objective rewards sampling neighborhoods containing feasible, low-cost trajectories under perturbation. Standard MPPI performs a local stochastic search by updating one nominal control sequence from Gaussian perturbations around it. In CBO-MPPI, we estimate the free energy at multiple nominal centers from local rollouts. These estimates define a shared consensus that guides drift and diffusion, and the final selected center supplies an MPPI weighted-mean output. For the associated mean-field model, we establish well-posedness and, under additional assumptions, convergence toward a free-energy minimizer. In simulations of obstacle navigation, pendulum swing-up, and planar-arm manipulation under equal rollout budgets, at high temperatures, CBO-MPPI attains lower free energy than MPPI and multi-start MPPI and maintains greater obstacle clearance than CBO-MPC.

math.OC↗

Mesh-Free Weak-Form Regression for Learning Interaction Kernels from Particle Trajectories

We propose mesh-free weak-form regression for learning interaction kernels from noisy particle trajectories. Our method uses smooth test functions to avoid differentiating noisy data and empirical particle averages to avoid density reconstruction and spatial grids. We then fit sparse combinations of candidate functions, evaluating interaction terms on sampled particle pairs to avoid all-pair quadratic cost. By transferring identifiability from the mean-field limit, we prove high-probability coefficient error bounds that separate finite-particle, time-discretization, observation-noise, and pair-sampling errors, without grid-resolution or density-estimation terms. We evaluate one-dimensional (1D) Newtonian-repulsion, 2D predator-prey, and 10D distance-localized experiments. The numerical results show trends consistent with the theoretical coefficient-error bounds. Comparisons of weak and forward-difference formulations with LASSO, Ridge, and OLS show that weak LASSO gives the smallest coefficient and drift errors in the three nominal experiments.

stat.ML↗

Averaged-Cost Control with Shared Feedback under Model Uncertainty

This paper studies the shared-feedback design problem for finite-horizon averaged-cost control under model uncertainty represented by a joint law over the model parameter and initial state. One feedback map is shared across all realizations and uses only time and the current state as online inputs. We develop two methods: the nonlinear adjoint method combines forward closed-loop solves, backward adjoints, and joint-law policy gradients, while the linear moment method gives exact cost and gradient formulas for a homogeneous linear-quadratic design model by propagating conditional second moments. Numerical studies compare averaged and nominal designs for time-dependent neural feedback and static linear feedback in nonlinear Van der Pol and Stuart-Landau systems; the static gains are designed from oscillator linearizations and evaluated on the original nonlinear systems. Averaged design has lower cost in most comparisons.

math.OC↗

A polynomial approximation scheme for nonlinear model reduction by moment matching

We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed to find an approximate solution to the invariance equation using a Newton iteration on the coefficients of a monomial basis expansion of the solution. These solutions to the invariance equations can then be used to construct reduced-order models. We assess the ability of the method to solve the invariance PDE system as well as to achieve moment matching and recover the steady-state behaviour of nonlinear systems with state dimension of order 1000 driven by linear and nonlinear signal generators.

math.OC↗

Control Strategies for Multi-Species Wasserstein Gradient Flows

We stabilize stationary states of coupled multi-species McKean--Vlasov equations by feedback control, extending a spectral approach based on the Wasserstein Hessian and a Riccati equation from a single density to a product of Wasserstein spaces. We give necessary and sufficient conditions for local exponential stabilization at a prescribed rate when only one species is actuated, together with the minimum number of control inputs required. For two species, the condition reduces to a rank condition on the Fourier coefficients of the cross-interaction kernel over the eigenspaces of the unactuated species' linearized dynamics. A two-community noisy Kuramoto model and a cell-sorting model illustrate the results.

math.OC↗

Feedback Control and Local Convexification of Wasserstein Gradient Flows

Building on the feedback stabilization framework that we developed for McKean-Vlasov PDEs, we treat a class of entropy-regularized free energies $F = E + σ\mathrm{Ent}$ on the flat torus, with $E$ possibly nonconvex and nonlocal, and show that the resulting controlled system admits a gradient flow formulation in Wasserstein space. Specifically, we realize the Wasserstein Hessian at a target stationary measure $\barμ$ as a self-adjoint operator with compact resolvent and show that its negative is unitarily equivalent to the generator of the linearized dynamics. The resulting feedback stabilization can then be interpreted as a local convexification of the free energy landscape: for any prescribed threshold $δ> 0$, the control, obtained from an algebraic Riccati equation for the linearized problem, induces a finite-rank perturbation of the Wasserstein Hessian that lifts its spectrum above $δ$, yielding local displacement convexity on a Hölder neighborhood of $\barμ$ in regimes where the uncontrolled energy is nonconvex or slowly contracting. Under a local well-posedness assumption, $\barμ$ is moreover a locally exponentially stable equilibrium of the closed-loop dynamics, with rate at least $δ$. The framework covers McKean-Vlasov models and extends to moment-constrained Fokker-Planck dynamics and Fokker-Planck equations on closed Riemannian manifolds.

math.OC↗

An Inexact Tensor-Train Primal-Dual Interior-Point Method for Semidefinite Programs

In this work, we introduce an interior-point method that employs tensor decompositions to efficiently represent and manipulate the variables and constraints of semidefinite programs, targeting problems where the solutions may not be low-rank but admit low-tensor-train rank approximations. Our method leverages a primal-dual infeasible interior-point framework with global and local convergence estimates. In experiments on Maximum Cut, Maximum Stable Set, and Correlation Clustering, the tensor-train interior-point method handles problems up to size $2^{12}$ with certified primal-dual accuracy, reported gaps of approximate order $10^{-4}$, and remains the only primal-dual SDP solver reported at the largest dimensions across all three benchmarks. Moreover, numerical evidence indicates that tensor-train ranks of the iterates typically remain structured and moderate along the interior-point trajectory, with instance-dependent growth for harder high-rank cases, supporting the scalability of the approach. Tensor-train interior-point methods offer a promising avenue for problems that lack traditional sparsity or low-rank structure, exploiting tensor-train structures instead.

math.OC↗

Nonlocal Mean Field Schrödinger Bridge with Learned Interactions

The Schrödinger Bridge Problem connects an initial distribution to a terminal one along a minimum-energy stochastic process. Its mean-field extension, the Mean-Field Schrödinger Bridge, governs interacting populations whose dynamics and costs depend on the collective distribution. When these interactions are nonlocal, their direct evaluation scales quadratically with the population size, making large ensembles intractable within FBSDE-based solvers. We replace these terms with neural surrogates in state and time, trained on empirical interaction values along sampled trajectories and embedded in a four-stage alternating scheme that updates the forward and backward potentials and the surrogates in turn, while preserving forward--backward consistency and the prescribed endpoint marginals. We derive Grönwall-type stability bounds quantifying how surrogate errors propagate to the generated trajectories under a small-gain condition. On crowd-navigation and high-dimensional opinion-dynamics benchmarks, the surrogates reproduce the trajectories obtained with exact evaluation at reduced training cost. The advantage is most significant when the interaction is a nonlinear functional of the measure, such as the normalized bounded-confidence drift, for which random-batch subsampling is biased and unstable whereas the learned surrogate remains accurate.

math.OC↗

Hessian-augmented Supervised Learning for Hamilton-Jacobi-Bellman PDEs

A data-driven method is developed for approximating value functions in deterministic optimal control problems with nonlinear control-affine dynamics. The Pontryagin Maximum Principle optimality system is solved from multiple initial conditions to generate training data consisting of values, gradients, and Hessians of the value function, where Hessian information is obtained from a matrix Riccati equation along optimal trajectories. These quantities augment a weighted least-squares regression over sparse polynomial bases on hyperbolic cross index sets, with gradients and Hessians contributing additional linear equations per sample and substantially reducing sample complexity compared to value-only regression. Feedback laws are recovered analytically from the learned value function. In high dimensions, a partial Hessian strategy controls the cost of data generation. The approach is validated on problems of increasing state dimension, where second-order data augmentation is shown to improve approximation accuracy and closed-loop performance, with up to an order-of-magnitude reduction in the number of training samples required relative to lower-order methods.

math.OC↗

A total variation flow scheme for ergodic mean field games

Motivated by recent developments in mean field games in ecology, in this paper we introduce a connection between the best response dynamics in evolutionary game theory, the minimization of the highest income of a game, and minimizing movement schemes. The aim of this work is to develop a variational approach to compute solutions of first order ergodic mean field games that may not possess a priori a variational structure. The study is complemented by a discussion and successful implementation of numerical algorithms, and comparisons between them in a variety of cases.

math.OC↗

Time-optimal neural feedback control of nilpotent systems as a binary classification problem

A computational method for the synthesis of time-optimal feedback control laws for linear nilpotent systems is proposed. The method is based on the use of the bang-bang theorem, which leads to a characterization of the time-optimal trajectory as a parameter-dependent polynomial system for the control switching sequence. A deflated Newton's method is then applied to exhaust all the real roots of the polynomial system. The root-finding procedure is informed by the Hermite quadratic form, which provides a sharp estimate on the number of real roots to be found. In the second part of the paper, the polynomial systems are sampled and solved to generate a synthetic dataset for the construction of a time-optimal deep neural network -- interpreted as a binary classifier -- via supervised learning. Numerical tests in integrators of increasing dimension assess the accuracy, robustness, and real-time-control capabilities of the approximate control law.

math.OC↗

A PDE-constrained Optimization Approach to Optimal Trajectory Planning under Uncertainty via Reflected Schrödinger Bridges

A computational PDE-constrained optimization approach is proposed for optimal trajectory planning under uncertainty by means of an associated Schroedinger Bridge Problem (SBP). The proposed SBP formulation is interpreted as the mean-field limit associated with the energy-optimal evolution of a particle governed by a stochastic differential equation (SDE) with nonlinear drift and reflecting boundary conditions, constrained to prescribed initial and terminal densities. The resulting mean-field system consists of a nonlinear Fokker-Planck equation coupled with a Hamilton-Jacobi-Bellman equation, subject to two-point boundary conditions in time and Neumann boundary conditions in space. Through the Hopf-Cole transformation, this nonlinear system is recast as a pair of forward-backward advection-diffusion equations, which are amenable to efficient numerical solution via a standard finite element discretization. The weak formulation naturally enforces reflecting boundary conditions without requiring explicit particle-boundary collision detection, thus circumventing the computational difficulties inherent to particle-based methods in complex geometries. Numerical experiments on challenging 3D maze configurations demonstrate fast convergence, mass conservation, and validate the optimal controls computed through reflected SDE simulations.

math.OC↗

Linearization-Based Feedback Stabilization of McKean-Vlasov PDEs

We develop a feedback control framework for stabilizing the McKean-Vlasov PDE on the torus. Our goal is to steer the dynamics toward a prescribed stationary distribution or accelerate convergence to it using a time-dependent control potential. We reformulate the controlled PDE in a weighted, zero-mean space and apply the ground-state transform to obtain a Schrodinger-type operator. The resulting operator framework enables spectral analysis, verification of the infinite-dimensional Hautus test, and construction of a Riccati-based feedback law derived from the linearized dynamics, yielding local exponential stabilization with a chosen convergence rate. We rigorously prove local exponential stabilization via maximal regularity arguments and nonlinear estimates. Numerical experiments on well-studied models in one and two dimensions (the noisy Kuramoto model for synchronization, the O(2) spin model in a magnetic field, and the von Mises attractive interaction potential) showcase the effectiveness of our control strategy, demonstrating convergence acceleration and stabilization of unstable equilibria.

math.OC↗

A Proximal Primal-Dual Approach to Generalized JKO Schemes for Doubly Nonlinear Parabolic Equations

Variational methods based on optimization strategies are proposed to numerically solve a large family of nonlinear partial differential equations. They are all particular instances of gradient flows with general costs, including the $p$-Laplace equation and flux-limited equations such as the relativistic heat equation. This is achieved by computing explicit formulas for proximal operators with general costs amenable to efficient numerical approximation. We showcase our numerical approach via validation of the results by recovering the qualitative behavior of particular known cases of this large family of steepest descent evolutions.

math.NA↗

Non-Convex Global Optimization as an Optimal Stabilization Problem: Convergence Rates

We develop a rigorous framework for global non-convex optimization by reformulating the minimization problem as a discounted infinite-horizon optimal control problem. For non-convex, continuous, and possibly non-smooth objective functions with multiple global minimizers, where classical gradient-based methods lack global convergence guarantees, we establish explicit exponential convergence rates with computable constants. Our analysis proves (i) variational convergence of the value function of the optimal control problem, (ii) convergence in the objective function for the original problem, as well as (iii) pathwise convergence of optimal trajectories to the minimizer set under minimal structural assumptions that require neither convexity, differentiability, nor Łojasiewicz-type conditions on the objective. These quantitative results significantly strengthen the asymptotic theory developed in our previous work (arXiv:2511.10815). Numerical experiments demonstrate the practical effectiveness of the approach on challenging non-convex problems.

math.OC↗

Parallel-in-Time Preconditioning for Time-Dependent Variational Mean Field Games

We study the numerical approximation of a time-dependent variational mean field game system with local couplings and either periodic or Neumann boundary conditions. Following a variational approach, we employ a finite difference discretization and solve the resulting finite-dimensional optimization problem using the Chambolle--Pock primal--dual algorithm. As this involves computing proximal operators and solving ill-conditioned linear systems at each iteration, we embed within our solver a general class of parallel-in-time preconditioners based on suitably-chosen diagonalization techniques, applied using discrete Fourier transforms. These enable efficient, scalable iterative solvers for each linear system, with robustness across a wide range of viscosities. We further develop fast solvers for the resulting ill-conditioned systems arising at each time step, using exact recursive schemes for structured grids while allowing for other geometries. Numerical experiments confirm the improved performance and parallel scalability of our approach.

math.NA↗

Sparse stabilization of mean-field agent dynamics through a three-operator splitting method

We study the sparse stabilization of nonlinear multi-agent systems within a mean-field optimal control framework. The goal is to drive large populations of interacting agents toward consensus with minimal control effort. In the mean-field limit, the dynamics are described by a Vlasov-type kinetic equation, and sparsity is enforced through an l1-l2 penalization in the cost functional. The resulting nonsmooth optimization problem is solved via a three-operator splitting (TOS) method that separately handles smooth, nonsmooth, and constraint components through gradient, shrinkage, and projection steps. A particle-based Monte Carlo discretization with random batch interactions enables scalable computation while preserving the mean-field structure. Numerical experiments on the Cucker-Smale model demonstrate effective consensus formation with sparse, localized control actions, confirming the efficiency and robustness of the proposed approach.

math.OC↗