Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Augmented Lagrangian method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

32 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Hourglass control in staggered-grid hydrodynamics using virtual element stabilization techniques

Numerical simulations using the staggered-grid hydrodynamics (SGH) discretization suffer from hourglass instabilities. In this work, we develop a stabilization method to suppress the hourglass instabilities using techniques from the virtual element method (VEM). The stiffness matrix of the VEM consists of two terms: the consistency matrix which is rank deficient and the stability matrix. Here, we first show that in two dimensions and on general polygons, the stiffness matrix of the SGH is identical to the consistency matrix of the linear VEM for both the diffusion equation and the linear elasticity equation. These analyses explain the origin of the hourglass instabilities of the SGH discretization method, and establish a theoretical foundation for our proposed stabilization method by augmenting the stiffness matrix of the SGH discretization using the VEM stability matrix. Then, we present numerical examples using Lagrangian SGH simulations. The numerical experiments demonstrate that the proposed VEM stabilization method is effective at eliminating hourglass modes in the SGH discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Joint ptycho-tomography with deep generative priors

Abstract Joint ptycho-tomography is a powerful computational imaging framework to recover the refractive properties of a 3D object while relaxing the requirements for probe overlap that is common in conventional phase retrieval. We use an augmented Lagrangian scheme for formulating the constrained optimization problem and employ an alternating direction method of multipliers (ADMM) for the joint solution. ADMM allows the problem to be split into smaller and computationally more efficient subproblems: ptychographic phase retrieval, tomographic reconstruction, and regularization of the solution. We extend our ADMM framework with plug-and-play (PnP) denoisers by replacing the regularization subproblem with a general denoising operator based on machine learning. While the PnP framework enables integrating such learned priors as denoising operators, tuning of the denoiser prior remains challenging. To overcome this challenge, we propose a denoiser parameter to control the effect of the denoiser and to accelerate the solution. In our simulations, we demonstrate that our proposed framework with parameter tuning and learned priors generates high-quality reconstructions under limited and noisy measurement data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗
DOE OSTI2024

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗
DOE OSTI2020

Development of an Encoding Method on an Co-simulation Platform for Mitigating the Impact of Unreliable Communication

This report presents a hardware-in-the-loop (HIL) based modeling approach for simulating impacts of unreliable communication on the performance of centralized volt-var control and for developing an encoding method to mitigate the impacts. First, an asynchronous real-time HIL simulation platform is introduced to enable multi-rate co-simulation of a distribution system with many inverter-based distributed energy resources (DERs). The distribution system is modeled by milliseconds phasor-based models and the DERs are modeled by micro-seconds power electronic models. Communication connections between a centralized volt-var controller (modeled externally to the HIL testbed) and smart inverters are built by implementing Modbus links and the Long Term Evolution network. On this co-simulation platform, an enhanced, augmented Lagrangian multiplier based encoded data recovery (EALM-EDR) algorithm for mitigating the impact of unreliable communication is developed and validated. Simulation results demonstrate the efficacy of using the HIL-based co-simulation platform as a power grid digital twin for developing algorithms that coordinate a large number of heterogeneous control systems through wired and wireless communication links.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Enhanced relaxed physical factorization preconditioner for coupled poromechanics

The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics. For its application, however, it is necessary to invert blocks with the algebraic form C^ = (C + βFF T ), where C is a symmetric positive definite matrix, FF T a rank-deficient term, and β a real non-negative coefficient. The inversion of C^, performed in an inexact way, can become unstable for large values of β, as it usually occurs at some stages of a full poromechanical simulation. In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C^. This strategy can prove useful in other problems as well where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity. First, we introduce an iterative scheme obtained by a natural splitting of matrix C^. Second, we develop a technique based on the use of a proper projection operator annihilating the near-kernel modes of C^. Both approaches give rise to a novel class of preconditioners denoted as Enhanced RPF (ERPF). Furthermore, effectiveness and robustness of the proposed algorithms are demonstrated in both theoretical benchmarks and real-world large-size applications, outperforming the native RPF preconditioner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Small arms suppression project (LLNL final report)

US Special Operations Command (USSOCOM) was seeking a technological leap in small firearms weapon suppressor technology, because anticipated enemy capabilities are requiring the operators to have smaller detection cross sections to ensure the safe execution of missions. Suppressors have been developed almost exclusively through trial-and-error methods since the time of the original design by Hiram Maxim over one hundred years ago. Consequently USSOCOM deemed it prudent to perform a physicsbased study of weapon suppression to understand performance limits and possibly identify breakthrough technologies. Lawrence Livermore National Laboratory’s (LLNL’s) high performance production level computational tool called ALE3D (Arbitrary Lagrangian-Eulerian 3D and 2D) has unique physics models and numerical algorithms for modeling suppressor dynamics. The flexible and extendable code framework supports fully integrated hydrodynamics, heat transfer, solid and fluid dynamics, and chemistry that can be applied to simulating propellant-driven motion of a bullet down a gun barrel, the transfer of heat from the burning propellant to the barrel and suppressor, the chemistry of muzzle flash, and the shock/acoustic/optical signatures in the near-field. LLNL’s originally anticipated role was to augment ALE3D for this task, by developing the software and analysis methodologies specific to the simulation of blast and muzzle flash phenomena. It was believed that insights provided by our ALE3D simulations in tandem with a coordinated experimental component by our other team members from Oak Ridge National Laboratory (ORNL) and the U. S. Army Armament, Research, Development and Engineering Center (ARDEC), would have excellent prospects of yielding useful suppressor design improvements that could be transitioned to industry and utilized by US Special Operations Command. The three year effort has come to fruition with the development of revolutionary suppressor designs that far outperform any previous or current design by anyone outside this multi-lab team.

42 ENGINEERING↗
DOE OSTI2026

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗
DOE OSTI2025

Multi-material ALE remap with interface sharpening using high-order matrix-free finite element methods

The arbitrary Lagrangian-Eulerian (ALE) technique involves remapping field quantities from a Lagrangian mesh to an optimized mesh in a conservative, accurate and bounds-preserving manner. For methods based on arbitrary order finite elements, as described in a reference, material volume fractions are advected in pseudo-time using flux-corrected transport (FCT) without any form of interface reconstruction. In practice, this can lead to excessive propagation of small volume fractions throughout the domain. In addition, this method requires assembly of a global advection matrix to compute the bounds-preserving low-order FCT solution. In this work, we introduce a new approach for ALE remap using a high-order matrix-free technique which incorporates a flux modification to sharpen material interfaces in a conservative manner. Our approach begins with computing a bounds-preserving low-order solution to the ALE remap equations at the element level. We then compute a sharp interface solution (not guaranteed to be bounds-preserving) which comes from solving an augmented version of the ALE remap equations with a conservative flux modification which acts to sharpen material volume fractions based on their gradients and transport directions. Using the sharp interface solution, we make global corrections to the bounds-preserving solution while maintaining preservation of bounds. By blending with the sharpened solution at the global level we are able to globally conserve mass without hindering the remap pseudo-time step. This new interface-aware ALE remap method is based entirely on partial assembly techniques where globally assembled matrix operators are no longer needed, resulting in a globally matrix-free FCT method for multi-material, multi-field ALE remap with high performance on GPU architectures. We present results of our new remap method on 1D, 2D and 3D benchmarks and describe the algorithmic tailoring for GPU architectures that was developed.

Vargas, Arturo [Lawrence Livermore National Labora↗
DOE OSTI2026

High-Performance Semiempirical Excited-State Molecular Dynamics Powered by Graphics Processing Units

Here, this Letter introduces excited-state molecular dynamics in PYSEQM, a GPU-accelerated semiempirical quantum chemistry engine implemented in PyTorch. The new module enables Born–Oppenheimer molecular dynamics (BOMD) using configuration-interaction singles and random phase approximation for excited states, allowing long trajectories and large statistical ensembles to be simulated efficiently on a single GPU. We also implement an extended Lagrangian excited-state BOMD (XL-ESMD) scheme that propagates auxiliary electronic variables, enabling relaxed ground and excited-state convergence thresholds without compromising energy conservation. The excited-state BOMD implementation scales smoothly from small chromophores to a nearly 900-atom dendrimer (taking 6.5 s per MD step). PYSEQM also supports batched execution, allowing many geometries or trajectories to be evaluated in a single GPU launch, substantially increasing throughput and making ensemble-based protocols routine. As a demonstration, we compute absorption, emission, and infrared spectra from trajectories propagated on the ground and first excited states. The XL-ESMD scheme yields identical spectra at significantly lower computational cost, establishing the role of extended Lagrangian based dynamics for efficient excited-state BOMD simulations. Beyond raw performance, PYSEQM’s PyTorch foundation provides automatic differentiation for forces, efficient GPU batching, and seamless interfacing with machine learning models. These capabilities position PYSEQM as a practical platform for machine learning-augmented excited-state dynamics and lay the foundation for future data-driven nonadiabatic excited-state dynamics modeling of ultrafast spectroscopic probes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗