Andrey A. Popov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andrey A. Popov has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Renato Zanetti
The University of Texas at Austin
4 shared publications - Adrian Sandu
Computational Science Laboratory, Department of Computer Science, Virginia Tech, Blacksburg, USA
2 shared publications - Amit N. Subrahmanya
Argonne National Laboratory, Lemont, Illinois, USA
1 shared publication - Arash Sarshar
Department of Computer Engineering and Computer Science, California State University, Long Beach, USA
1 shared publication - Enrico M. Zucchelli
Dept of Aerospace Engineering & Engineering Mechanics, The University of Texas at Austin, Austin, USA
1 shared publication - Felipe Giraldo-Grueso
Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, Austin, USA
1 shared publication
Latest Publications
- 3 September 2025
- Published by Springer Nature in The Journal of the Astronautical Sciences
- Vol. 72 (5) , 1-32
Optimal Sampling for Point Mass Filtering with Applications to Cislunar Orbit Determination
- 3 September 2025
- Published by Springer Nature in The Journal of the Astronautical Sciences
- Vol. 72 (5) , 1-32
Optimal Sampling for Point Mass Filtering with Applications to Cislunar Orbit Determination
- 19 August 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (5) , 1-22
Preserving nonlinear constraints in variational flow filtering data assimilation
- 19 August 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (5) , 1-22
Preserving nonlinear constraints in variational flow filtering data assimilation
- Top Cited PapersOpen Access
- 18 August 2025
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 8 (4) , 1283-1306
Physics-Informed Neural Networks for PDE-Constrained Optimization and Control
The goal of optimal control is to determine a sequence of inputs for maximizing or minimizing a given performance criterion subject to the dynamics and constraints of the system under observation. This work introduces Control Physics-Informed Neural Networks (PINNs), which simultaneously learn both the system states and the optimal control signal in a single-stage framework that leverages the system’s underlying physical laws. While prior approaches often follow a two-stage process-modeling, the system first and then devising its control—the presented novel framework embeds the necessary optimality conditions directly into the network architecture and loss function. We demonstrate the effectiveness of the novel methodology by solving various open-loop optimal control problems governed by analytical, one-dimensional, and two-dimensional partial differential equations (PDEs).
- 18 August 2025
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 8 (4) , 1283-1306
Top Cited PapersOpen AccessPhysics-Informed Neural Networks for PDE-Constrained Optimization and Control
The goal of optimal control is to determine a sequence of inputs for maximizing or minimizing a given performance criterion subject to the dynamics and constraints of the system under observation. This work introduces Control Physics-Informed Neural Networks (PINNs), which simultaneously learn both the system states and the optimal control signal in a single-stage framework that leverages the system’s underlying physical laws. While prior approaches often follow a two-stage process-modeling, the system first and then devising its control—the presented novel framework embeds the necessary optimality conditions directly into the network architecture and loss function. We demonstrate the effectiveness of the novel methodology by solving various open-loop optimal control problems governed by analytical, one-dimensional, and two-dimensional partial differential equations (PDEs).
- Open Access
A geometric ensemble method for Bayesian inference
Conventional approximations to Bayesian inference rely on either approximations by statistics such as mean and covariance or by point particles. Recent advances such as the ensemble Gaussian mixture filter have generalized these notions to sums of parameterized distributions. This work presents a new methodology for approximating Bayesian inference by sums of uniform distributions on convex polytopes. The methodology presented herein is developed from the simplest convex polytope filter that takes advantage of uniform prior and measurement uncertainty, to an operationally viable ensemble filter with Kalmanized approximations to updating convex polytopes. Numerical results on the Ikeda map show the viability of this methodology in the low-dimensional setting, and numerical results on the Lorenz '96 equations similarly show viability in the high-dimensional setting.
Open AccessA geometric ensemble method for Bayesian inference
Conventional approximations to Bayesian inference rely on either approximations by statistics such as mean and covariance or by point particles. Recent advances such as the ensemble Gaussian mixture filter have generalized these notions to sums of parameterized distributions. This work presents a new methodology for approximating Bayesian inference by sums of uniform distributions on convex polytopes. The methodology presented herein is developed from the simplest convex polytope filter that takes advantage of uniform prior and measurement uncertainty, to an operationally viable ensemble filter with Kalmanized approximations to updating convex polytopes. Numerical results on the Ikeda map show the viability of this methodology in the low-dimensional setting, and numerical results on the Lorenz '96 equations similarly show viability in the high-dimensional setting.
- 8 April 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-19
Multiple data assimilation as an approximate maximum a posteriori estimator
- 8 April 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-19
Multiple data assimilation as an approximate maximum a posteriori estimator
- 29 March 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-23
Ensemble-regularized Kernel density estimation with applications to the ensemble Gaussian mixture filter
- 29 March 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-23
Ensemble-regularized Kernel density estimation with applications to the ensemble Gaussian mixture filter
- Open Access
The Ensemble Epanechnikov Mixture Filter
In the high-dimensional setting, Gaussian mixture kernel density estimates become increasingly suboptimal. In this work we aim to show that it is practical to instead use the optimal multivariate Epanechnikov kernel. We make use of this optimal Epanechnikov mixture kernel density estimate for the sequential filtering scenario through what we term the ensemble Epanechnikov mixture filter (EnEMF). We provide a practical implementation of the EnEMF that is as cost efficient as the comparable ensemble Gaussian mixture filter. We show on a static example that the EnEMF is robust to growth in dimension, and also that the EnEMF has a significant reduction in error per particle on the 40-variable Lorenz '96 system.
Open AccessThe Ensemble Epanechnikov Mixture Filter
In the high-dimensional setting, Gaussian mixture kernel density estimates become increasingly suboptimal. In this work we aim to show that it is practical to instead use the optimal multivariate Epanechnikov kernel. We make use of this optimal Epanechnikov mixture kernel density estimate for the sequential filtering scenario through what we term the ensemble Epanechnikov mixture filter (EnEMF). We provide a practical implementation of the EnEMF that is as cost efficient as the comparable ensemble Gaussian mixture filter. We show on a static example that the EnEMF is robust to growth in dimension, and also that the EnEMF has a significant reduction in error per particle on the 40-variable Lorenz '96 system.