Socratis Petrides
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Socratis Petrides has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Brendan Keith
Division of Applied Mathematics, Brown University, Providence, RI 02912 USA
3 shared publications - Leszek Demkowicz
University of Texas at Austin, Austin, TX, USA
3 shared publications Boyan Lazarov
2 shared publications- Jacob Badger
Oden Institute The University of Texas at Austin USA
2 shared publications Leszek F. Demkowicz
2 shared publications- Stefan Henneking
Oden Institute, The University of Texas at Austin, Austin, TX 78712 USA
2 shared publications
Latest Publications
- 8 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (2) , A828-A852
Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization
Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizin...
- 8 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (2) , A828-A852
Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization
Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizin...
- Open Access
- 24 June 2024
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 429
Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization
- 24 June 2024
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 429
Open AccessFinite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization
- Open Access
- 4 March 2024
- Published by The Open Journal in Journal of Open Source Software
- Vol. 9 (95) , 5946
hp\mathrm{3D}: A Scalable MPI/OpenMP hp-Adaptive Finite Element Software Library for Complex Multiphysics Applications
The ℎ𝑝3D finite element (FE) library is a tool for computational modeling of engineering applications. The library provides a framework for discretization of three-dimensional 1 multiphysics problems described by systems of partial differential equations. ℎ𝑝3D can be compiled in real or complex mode to accommodate the need for real-or complex-valued physics variables, respectively. The library is written entirely in Fortran; user applications interfacing with the library are also written in Fortran. The ℎ𝑝3D software can be installed and runs efficiently on various CPU-based compute architectures, from laptops and single workstations to state-of-the-art supercomputers.
- 4 March 2024
- Published by The Open Journal in Journal of Open Source Software
- Vol. 9 (95) , 5946
Open Accesshp\mathrm{3D}: A Scalable MPI/OpenMP hp-Adaptive Finite Element Software Library for Complex Multiphysics Applications
The ℎ𝑝3D finite element (FE) library is a tool for computational modeling of engineering applications. The library provides a framework for discretization of three-dimensional 1 multiphysics problems described by systems of partial differential equations. ℎ𝑝3D can be compiled in real or complex mode to accommodate the need for real-or complex-valued physics variables, respectively. The library is written entirely in Fortran; user applications interfacing with the library are also written in Fortran. The ℎ𝑝3D software can be installed and runs efficiently on various CPU-based compute architectures, from laptops and single workstations to state-of-the-art supercomputers.
- Open Access
An Adaptive Sampling Augmented Lagrangian Method for Stochastic Optimization with Deterministic Constraints
The primary goal of this paper is to provide an efficient solution algorithm based on the augmented Lagrangian framework for optimization problems with a stochastic objective function and deterministic constraints. Our main contribution is combining the augmented Lagrangian framework with adaptive sampling, resulting in an efficient optimization methodology validated with practical examples. To achieve the presented efficiency, we consider inexact solutions for the augmented Lagrangian subproblems, and through an adaptive sampling mechanism, we control the variance in the gradient estimates. Furthermore, we analyze the theoretical performance of the proposed scheme by showing equivalence to a gradient descent algorithm on a Moreau envelope function, and we prove sublinear convergence for convex objectives and linear convergence for strongly convex objectives with affine equality constraints. The worst-case sample complexity of the resulting algorithm, for an arbitrary choice of penalty parameter in the augmented Lagrangian function, is $O(ε^{-3-δ})$, where $ε> 0$ is the expected error of the solution and $δ> 0$ is a user-defined parameter. If the penalty parameter is chosen to be $O(ε^{-1})$, we demonstrate that the result can be improved to $O(ε^{-2})$, which is competitive with the other methods employed in the literature. Moreover, if the objective function is strongly convex with affine equality constraints, we obtain $O(ε^{-1}\log(1/ε))$ complexity. Finally, we empirically verify the performance of our adaptive sampling augmented Lagrangian framework in machine learning optimization and engineering design problems, including topology optimization of a heat sink with environmental uncertainty.Open AccessAn Adaptive Sampling Augmented Lagrangian Method for Stochastic Optimization with Deterministic Constraints
The primary goal of this paper is to provide an efficient solution algorithm based on the augmented Lagrangian framework for optimization problems with a stochastic objective function and deterministic constraints. Our main contribution is combining the augmented Lagrangian framework with adaptive sampling, resulting in an efficient optimization methodology validated with practical examples. To achieve the presented efficiency, we consider inexact solutions for the augmented Lagrangian subproblems, and through an adaptive sampling mechanism, we control the variance in the gradient estimates. Furthermore, we analyze the theoretical performance of the proposed scheme by showing equivalence to a gradient descent algorithm on a Moreau envelope function, and we prove sublinear convergence for convex objectives and linear convergence for strongly convex objectives with affine equality constraints. The worst-case sample complexity of the resulting algorithm, for an arbitrary choice of penalty parameter in the augmented Lagrangian function, is $O(ε^{-3-δ})$, where $ε> 0$ is the expected error of the solution and $δ> 0$ is a user-defined parameter. If the penalty parameter is chosen to be $O(ε^{-1})$, we demonstrate that the result can be improved to $O(ε^{-2})$, which is competitive with the other methods employed in the literature. Moreover, if the objective function is strongly convex with affine equality constraints, we obtain $O(ε^{-1}\log(1/ε))$ complexity. Finally, we empirically verify the performance of our adaptive sampling augmented Lagrangian framework in machine learning optimization and engineering design problems, including topology optimization of a heat sink with environmental uncertainty. - Open Access
Learning robust marking policies for adaptive mesh refinement
In this work, we revisit the marking decisions made in the standard adaptive finite element method (AFEM). Experience shows that a na\"{i}ve marking policy leads to inefficient use of computational resources for adaptive mesh refinement (AMR). Consequently, using AFEM in practice often involves ad-hoc or time-consuming offline parameter tuning to set appropriate parameters for the marking subroutine. To address these practical concerns, we recast AMR as a Markov decision process in which refinement parameters can be selected on-the-fly at run time, without the need for pre-tuning by expert users. In this new paradigm, the refinement parameters are also chosen adaptively via a marking policy that can be optimized using methods from reinforcement learning. We use the Poisson equation to demonstrate our techniques on $h$- and $hp$-refinement benchmark problems, and our experiments suggest that superior marking policies remain undiscovered for many classical AFEM applications. Furthermore, an unexpected observation from this work is that marking policies trained on one family of PDEs are sometimes robust enough to perform well on problems far outside the training family. For illustration, we show that a simple $hp$-refinement policy trained on 2D domains with only a single re-entrant corner can be deployed on far more complicated 2D domains, and even 3D domains, without significant performance loss. For reproduction and broader adoption, we accompany this work with an open-source implementation of our methods.
Open AccessLearning robust marking policies for adaptive mesh refinement
In this work, we revisit the marking decisions made in the standard adaptive finite element method (AFEM). Experience shows that a na\"{i}ve marking policy leads to inefficient use of computational resources for adaptive mesh refinement (AMR). Consequently, using AFEM in practice often involves ad-hoc or time-consuming offline parameter tuning to set appropriate parameters for the marking subroutine. To address these practical concerns, we recast AMR as a Markov decision process in which refinement parameters can be selected on-the-fly at run time, without the need for pre-tuning by expert users. In this new paradigm, the refinement parameters are also chosen adaptively via a marking policy that can be optimized using methods from reinforcement learning. We use the Poisson equation to demonstrate our techniques on $h$- and $hp$-refinement benchmark problems, and our experiments suggest that superior marking policies remain undiscovered for many classical AFEM applications. Furthermore, an unexpected observation from this work is that marking policies trained on one family of PDEs are sometimes robust enough to perform well on problems far outside the training family. For illustration, we show that a simple $hp$-refinement policy trained on 2D domains with only a single re-entrant corner can be deployed on far more complicated 2D domains, and even 3D domains, without significant performance loss. For reproduction and broader adoption, we accompany this work with an open-source implementation of our methods.
- 2 October 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 149, 239-258
An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints
- 2 October 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 149, 239-258
An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints
- 21 August 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 148, 81-92
Scalable DPG multigrid solver for Helmholtz problems: A study on convergence
- 21 August 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 148, 81-92
Scalable DPG multigrid solver for Helmholtz problems: A study on convergence
- Open Access
Multi-Agent Reinforcement Learning for Adaptive Mesh Refinement
Adaptive mesh refinement (AMR) is necessary for efficient finite element simulations of complex physical phenomenon, as it allocates limited computational budget based on the need for higher or lower resolution, which varies over space and time. We present a novel formulation of AMR as a fully-cooperative Markov game, in which each element is an independent agent who makes refinement and de-refinement choices based on local information. We design a novel deep multi-agent reinforcement learning (MARL) algorithm called Value Decomposition Graph Network (VDGN), which solves the two core challenges that AMR poses for MARL: posthumous credit assignment due to agent creation and deletion, and unstructured observations due to the diversity of mesh geometries. For the first time, we show that MARL enables anticipatory refinement of regions that will encounter complex features at future times, thereby unlocking entirely new regions of the error-cost objective landscape that are inaccessible by traditional methods based on local error estimators. Comprehensive experiments show that VDGN policies significantly outperform error threshold-based policies in global error and cost metrics. We show that learned policies generalize to test problems with physical features, mesh geometries, and longer simulation times that were not seen in training. We also extend VDGN with multi-objective optimization capabilities to find the Pareto front of the tradeoff between cost and error.
Open AccessMulti-Agent Reinforcement Learning for Adaptive Mesh Refinement
Adaptive mesh refinement (AMR) is necessary for efficient finite element simulations of complex physical phenomenon, as it allocates limited computational budget based on the need for higher or lower resolution, which varies over space and time. We present a novel formulation of AMR as a fully-cooperative Markov game, in which each element is an independent agent who makes refinement and de-refinement choices based on local information. We design a novel deep multi-agent reinforcement learning (MARL) algorithm called Value Decomposition Graph Network (VDGN), which solves the two core challenges that AMR poses for MARL: posthumous credit assignment due to agent creation and deletion, and unstructured observations due to the diversity of mesh geometries. For the first time, we show that MARL enables anticipatory refinement of regions that will encounter complex features at future times, thereby unlocking entirely new regions of the error-cost objective landscape that are inaccessible by traditional methods based on local error estimators. Comprehensive experiments show that VDGN policies significantly outperform error threshold-based policies in global error and cost metrics. We show that learned policies generalize to test problems with physical features, mesh geometries, and longer simulation times that were not seen in training. We also extend VDGN with multi-objective optimization capabilities to find the Pareto front of the tradeoff between cost and error.
- Open Access
An adaptive multigrid solver for DPG methods with applications in linear acoustics and electromagnetics
We propose an adaptive multigrid preconditioning technology for solving linear systems arising from Discontinuous Petrov-Galerkin (DPG) discretizations. Unlike standard multigrid techniques, this preconditioner involves only trace spaces defined on the mesh skeleton, and it is suitable for adaptive hp-meshes. The key point of the construction is the integration of the iterative solver with a fully automatic and reliable mesh refinement process provided by the DPG technology. The efficacy of the solution technique is showcased with numerous examples of linear acoustics and electromagnetic simulations, including simulations in the high-frequency regime, problems which otherwise would be intractable. Finally, we analyze the one-level preconditioner (smoother) for uniform meshes and we demonstrate that theoretical estimates of the condition number of the preconditioned linear system can be derived based on well established theory for self-adjoint positive definite operators.
Open AccessAn adaptive multigrid solver for DPG methods with applications in linear acoustics and electromagnetics
We propose an adaptive multigrid preconditioning technology for solving linear systems arising from Discontinuous Petrov-Galerkin (DPG) discretizations. Unlike standard multigrid techniques, this preconditioner involves only trace spaces defined on the mesh skeleton, and it is suitable for adaptive hp-meshes. The key point of the construction is the integration of the iterative solver with a fully automatic and reliable mesh refinement process provided by the DPG technology. The efficacy of the solution technique is showcased with numerous examples of linear acoustics and electromagnetic simulations, including simulations in the high-frequency regime, problems which otherwise would be intractable. Finally, we analyze the one-level preconditioner (smoother) for uniform meshes and we demonstrate that theoretical estimates of the condition number of the preconditioned linear system can be derived based on well established theory for self-adjoint positive definite operators.
- 1 October 2017
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 74 (8) , 1999-2017
An adaptive DPG method for high frequency time-harmonic wave propagation problems
- 1 October 2017
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 74 (8) , 1999-2017
An adaptive DPG method for high frequency time-harmonic wave propagation problems