Search NASA⌕ Search

SEARCH · Search NASA

Results for “penalty parameter”

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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗
DOE OSTI2025

A provably stable numerical method for the anisotropic diffusion equation in confined magnetic fields

We present a novel numerical method for solving the anisotropic diffusion equation in magnetic fields confined to a periodic box which is accurate and provably stable. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing both boundary conditions and parallel diffusion operator obtained by field line tracing. We prove that the fully-discrete approximation is unconditionally stable. Discrete energy estimates are shown to match the continuous energy estimate given the correct choice of penalty parameters. A nonlinear penalty parameter is shown to provide an effective method for tuning the parallel diffusion penalty and significantly minimises rounding errors. Several numerical experiments, using manufactured solutions, the “NIMROD benchmark” problem and a single island problem, are presented to verify numerical accuracy, convergence, and asymptotic preserving properties of the method. Finally, we present a magnetic field with chaotic regions and islands and show the contours of the anisotropic diffusion equation reproduce key features in the field.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

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, here 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 $\mathscr{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 $\mathscr{O}$(ϵ -1 ), we demonstrate that the result can be improved to $\mathscr{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 $\mathscr{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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian↗
DOE OSTI2024

Enhancing the cooling performance of thermocouples: a power-constrained topology optimization procedure

Abstract Heat pumping through thermoelectric devices has many advantages over traditional cooling. However, their current efficiency is a limiting factor in their implementation. In this paper, we approach the non-convex topology optimization of thermoelectrical elements for cooling applications through the method of moving asymptotes (MMA) to improve their cooling capabilities per watt usage. The optimization problem is defined for a given power budget, aiming for the minimum temperature with a known heat pumping need. The introduction of power as a constraint justifies the introduction of the voltage gradient across the thermocouple as a design variable to maintain the thermoelectrical device in its optimum power-to-heat extraction ratio. To better understand the convergence of this non-convex problem, we present a two-variable analytical thermoelectric optimization model. This example provides information on how to select the penalty parameters used to scale the three material coefficients involved in the problem to obtain lower objective values and better convergence using MMA. The analytical model shows the non-convexity of the problem and provides the recommendation to use penalization coefficients of the form $$p_k=p_{\sigma }>p_{\alpha }=1$$ p k = p σ > p α = 1 for the thermal conductivity, electrical conductivity, and Seebeck coefficients. We tested these penalization coefficients through optimizations of a model based on the 1MC10-031 commercial thermoelectric-cooler (TEC) using the finite element method (FEM). These penalization coefficients provided local minima without the need for volume constraints. With this procedure, we found designs that provided temperatures close to 10 degrees lower using 60% less semiconductor material volume compared to the initial design.

Gutiérrez, G. Reales↗
DOE OSTI2024

Stress-hybrid virtual element method on six-noded triangular meshes for compressible and nearly-incompressible linear elasticity

In this paper, we present a first-order Stress-Hybrid Virtual Element Method (SH-VEM) on six-noded triangular meshes for linear plane elasticity. Here, we adopt the Hellinger–Reissner variational principle to construct a weak equilibrium condition and a stress based projection operator. In each element, the stress projection operator is expressed in terms of the nodal displacements, which leads to a displacement based formulation. This stress-hybrid approach assumes a globally continuous displacement field while the stress field is discontinuous across each element. The stress field is initially represented by divergence-free tensor polynomials based on Airy stress functions, but we also present a formulation that uses a penalty term to enforce the element equilibrium conditions, referred to as the Penalty Stress-Hybrid Virtual Element Method (PSH-VEM). Numerical results are presented for PSH-VEM and SH-VEM, and we compare their convergence to the composite triangle FEM and B-bar VEM on benchmark problems in linear elasticity. The SH-VEM converges optimally in the L 2 norm of the displacement, energy seminorm, and the L 2 norm of hydrostatic stress. Furthermore, the results reveal that PSH-VEM converges in most cases at a faster rate than the expected optimal rate, but it requires the selection of a suitably chosen penalty parameter.

42 ENGINEERING↗
DOE OSTI2024

Optimal Management of Grid-Interactive Efficient Buildings via Safe Reinforcement Learning

Reinforcement learning (RL)-based methods have achieved significant success in managing grid-interactive efficient buildings (GEBs). However, RL does not carry intrinsic guarantees of constraint satisfaction, which may lead to severe safety consequences. Besides, in GEB control applications, most existing safe RL approaches rely only on the regularisation parameters in neural networks or penalty of rewards, which often encounter challenges with parameter tuning and lead to catastrophic constraint violations. To provide enforced safety guarantees in controlling GEBs, this paper designs a physics-inspired safe RL method whose decision-making is enhanced through safe interaction with the environment. Different energy resources in GEBs are optimally managed to minimize energy costs and maximize customer comfort. The proposed approach can achieve strict constraint guarantees based on prior knowledge of a set of developed hard steady-state rules. Simulations on the optimal management of GEBs, including heating, ventilation, and air conditioning (HVAC), solar photovoltaics, and energy storage systems, demonstrate the effectiveness of the proposed approach.

Huo, Xiang↗
DOE OSTI2024

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗
DOE OSTI2026

Application of Fuel Depletion Chain Simplification to Experiment Analysis in the Advanced Test Reactor

An irradiation experiment analysis can be informed by high-fidelity reactor engineering depletion results, but this comes at a computational cost. Applying depletion chain simplification to the advanced test reactor driver fuel before performing experiment depletions permits their programmatic parameters to be calculated faster, with a small penalty to accuracy. Here, this work contrasts the results of two irradiation experiments with different neutronic characteristics. Overall, the simplified nuclide library produced using a simple one-group microscopic cross-section library for a pressurized water reactor in the depletion chain simplification process performed comparably in terms of accuracy and runtime to the simplified nuclide library produced using a three-group microscopic cross-section library generated specifically for the advanced test reactor experiments being modeled. This is attributed to the additional nuclides and transmutation pathways preserved in the one-group cross-section library, which has data for 297 nuclides, compared to the three-group cross-section library, which has data for 217 nuclides. This indicates that a cross-section library with more nuclides is better than a cross-section library with fewer nuclides for the depletion chain simplification process, even if the cross-section library with fewer nuclides better represents the flux spectrum of the system being considered.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

M&C 2025: Application of Fuel Depletion Chain Simplification to Experiment Analysis in the Advanced Test Reactor

Irradiation experiment analysis can be informed by high-fidelity reactor engineering depletion results, but it comes at a computational cost. Applying depletion chain simplification to the Advanced Test Reactor driver fuel before performing experiment depletions permits their programmatic parameters to be calculated faster, with a small penalty to accuracy. This work contrasts the results of two irradiation experiments with different neutronic characteristics and provides general recommendations.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2026

Estimation of Fission Product Transport Parameters for Cesium in the AGR-3/4 TRISO Fuel Experiment

A one-dimensional (1D) finite-element model of fission product transport in the AGR-3/4 experiment has been developed using the Multiphysics Object Oriented Simulation Environment (MOOSE) framework and implemented in the fuel performance code, BISON. The model resolves capsule-specific geometries, materials, and temperature histories and simulates radial migration of fission products from the fuel compact through the inner ring, outer ring, and into the sink ring. Model parameters governing diffusion and sorption were estimated for key fission products – cesium (Cs), and europium (Eu) – by simultaneously fitting modeled isotopic concentration profiles and total ring inventories to a post-irradiation experimental measurement. These data include gamma scanning, liquid scintillation for Sr-90, radial deconsolidation leach-burn-leach analysis, tomographic reconstructions, and destructive physical sampling. A mortar-based interfacial sorption framework was implemented to enforce physically consistent mass transfer and flux conservation across gas gaps. Two classes of parameter sets were derived: a least-squares best-fit, and a safety-oriented conservative-fit, what applies strong penalties for underprediction of sink inventories. Across all twelve capsules, the model successfully reproduces the dominant radial transport trends for Cs, Sr, with decreasing concentrations from the compact outward through successive rings. Cs behavior is captured most consistently, while strontium predictions reveal systematic trade-offs between compact accuracy and conservative sink-ring bounding. The results demonstrate that sink ring weighted calibration provides conservative, safety relevant bounds on low temperature fission product transport, but at the cost of underpredicting compact inventories for Sr isotopes. These discrepancies highlight the need for additional physics, including fast-slow diffusion model, incorporating trapping mechanism in the transport behavior. Overall, this work establishes a robust, capsule-specific modeling framework for AGR-3/4 fission product transport and provides a defensible basis for parameter selection in source-term and fuel performance analyses for high temperature gas-cooled reactors.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Isoconversional Kinetic Analysis of Oxygen Desorption for Sr 0.75 Ca 0.25 FeO 3-δ Perovskite in Dry and Steam-Based Environments

The desorption kinetics of Sr 0.75 Ca 0.25 FeO 3-δ perovskite material are examined in both dry and steam-based environments using redox gaseous products of a laboratory-scale fixed bed. First, desorption kinetics associated with the dry environment are proposed based on Friedman’s isoconversional method. It is found from the reconstructed reaction model that the desorption kinetics of this perovskite are controlled by a three-step mechanism, where hypothetically, the phase-boundary reaction rapidly prevails first, followed by diffusion and/or nucleation, and finally, unimolecular decay or random nucleation-controlled reaction. Subsequent analyses of the Arrhenius parameters indicated that both the early and later desorption stages, respectively, controlled by the phase boundary and unimolecular/random nucleation reactions, are associated with low energetic demand. In contrast, a high energetic penalty is required for the diffusion/nucleation reaction. Further, a satisfactory a priori verification of the proposed kinetics suggested that the three-step reaction mechanism reasonably describes the desorption of this perovskite in a dry environment. With the presence of steam in the desorption environment, oxygen production is substantially inhibited, but the hypothetical three-step mechanism is still found to control the desorption. Meanwhile, the primary effects of the steam on these mechanisms include the widening of the conversion extent associated with the diffusion/nucleation reaction, along with a higher energetic demand compared to the dry environment.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Plasma performance and operational space with an RMP-ELM suppressed edge

Abstract The operational space and global performance of plasmas with edge-localized modes (ELMs) suppressed by resonant magnetic perturbations (RMPs) are surveyed by comparing AUG, DIII-D, EAST, and KSTAR stationary operating points. RMP-ELM suppression is achieved over a range of plasma currents, toroidal fields, and RMP toroidal mode numbers. Consistent operational windows in edge safety factor are found across devices, while windows in plasma shaping parameters are distinct. Accessed pedestal parameters reveal a quantitatively similar pedestal-top density limit for RMP-ELM suppression in all devices of just over 3 × 10 19 m −3 . This is surprising given the wide variance of many engineering parameters and edge collisionalities, and poses a challenge to extrapolation of the regime. Wide ranges in input power, confinement time, and stored energy are observed, with the achieved triple product found to scale like the product of current, field, and radius. Observed energy confinement scaling with engineering parameters for RMP-ELM suppressed plasmas are presented and compared with expectations from established H and L-mode scalings, including treatment of uncertainty analysis. Different scaling exponents for individual engineering parameters are found as compared to the established scalings. However, extrapolation to next-step tokamaks ITER and SPARC find overall consistency within uncertainties with the established scalings, finding no obvious performance penalty when extrapolating from the assembled multi-device RMP-ELM suppressed database. Overall this work identifies common physics for RMP-ELM suppression and highlights the need to pursue this no-ELM regime at higher magnetic field and different plasma physical size.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Optimization of foreground moment deprojection for semi-blind CMB polarization reconstruction

Abstract Upcoming Cosmic Microwave Background (CMB) experiments, aimed at measuring primordial CMB polarization B-modes, require exquisite control of instrumental systematics and Galactic foreground contamination. Blind minimum-variance techniques, like the Needlet Internal Linear Combination (NILC), have proven effective in reconstructing the CMB polarization signal and mitigating foregrounds and systematics across diverse sky models without suffering from foreground mismodelling errors. Still, residual foreground contamination from NILC may bias the recovered CMB polarization at large angular scales when confronted with the most complex foreground scenarios.By adding constraints to NILC to deproject statistical moments of the Galactic emission, the Constrained Moment ILC (cMILC) method has been demonstrated to further enhance foreground subtraction, albeit with an associated increase in overall noise variance. Faced with this trade-off between foreground bias reduction and overall variance minimization, there is still no recipe on which moments to deproject and which are better suited for blind variance minimization. To address this, we introduce the optimized cMILC (ocMILC) pipeline, which performs full automated optimization of the required number and set of foreground moments to deproject, pivot parameter values, and deprojection coefficients across the sky and angular scales, depending on the actual sky complexity, available frequency coverage, and experiment sensitivity. The optimal number of moments for deprojection, before paying significant noise penalty, is determined through a data diagnosis inspired by the Generalized NILC (GNILC) method.Validated on B-mode simulations of thePICOspace mission concept with four challenging foreground models, ocMILC exhibits lower Galactic foreground contamination compared to NILC and cMILC at all angular scales, with limited noise penalty. This multi-layer optimization enables the ocMILC pipeline to achieve unbiased posteriors of the tensor-to-scalar ratio, regardless of foreground complexity.

Astronomy & Astrophysics↗
DOE OSTI2025

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

An adjoint-based optimization method for jointly inverting heterogeneous material properties and fault slip from earthquake surface deformation data

SUMMARY Analysis of tectonic and earthquake-cycle associated deformation of the crust can provide valuable insights into the underlying deformation processes including fault slip. How those processes are expressed at the surface depends on the lateral and depth variations of rock properties. The effect of such variations is often tested by forward models based on a priori geological or geophysical information. Here, we first develop a novel technique based on an open-source finite-element computational framework to invert geodetic constraints directly for heterogeneous media properties. We focus on the elastic, coseismic problem and seek to constrain variations in shear modulus and Poisson’s ratio, proxies for the effects of lithology and/or temperature and porous flow, respectively. The corresponding nonlinear inversion is implemented using adjoint-based optimization that efficiently reduces the cost function that includes the misfit between the calculated and observed displacements and a penalty term. We then extend our theoretical and numerical framework to simultaneously infer both heterogeneous Earth’s structure and fault slip from surface deformation. Based on a range of 2-D synthetic cases, we find that both model parameters can be satisfactorily estimated for the megathrust setting-inspired test problems considered. Within limits, this is the case even in the presence of noise and if the fault geometry is not perfectly known. Our method lays the foundation for a future reassessment of the information contained in increasingly data-rich settings, for example, geodetic GNSS constraints for large earthquakes such as the 2011 Tohoku-oki M9 event, or distributed deformation along plate boundaries as constrained from InSAR.

Geochemistry & Geophysics↗
DOE OSTI2026

HARMONY: Large-Scale Architecture Search for Efficient Hybrid Language Models

As large language models scale to trillions of parameters, their computational and memory requirements present critical challenges for efficient training and deployment. While Mixture of Experts (MoE) architectures enable efficient scaling through sparse parameter activation, and state-space models like Mamba offer linear-time complexity, principled methods for combining these paradigms remain undeveloped. We introduce HARMONY (Hybrid Architecture Research for Mamba, Optimized with Neural efficiencY), a multi-objective evolutionary neural architecture search framework for discovering efficient hybrid language models that integrate Transformer attention mechanisms, Mixture-of-Experts routing, and Mamba state-space components. Through large-scale distributed search using 16,384 MI250X GPUs on the Frontier supercomputer, HARMONY explores a comprehensive design space encompassing six attention variants (MHA, MQA, GQA, MLA, SWA, and Mamba-2), variable MoE configurations with both routed and shared experts, and extensive Mamba hyperparameters. Our framework discovers heterogeneous architectures that balance training performance with computational efficiency through multi-objective optimization incorporating latency penalties and fitness-based selection. Analysis of discovered architectures reveals that optimal hybrid designs favor heterogeneous component mixing rather than homogeneous patterns, with Mamba-2 and Multi-Head Latent Attention (MLA) emerging as preferred mechanisms. Discovered architectures demonstrate superior training efficiency: our best configuration achieves a final perplexity of 1.0874 with 2.38B parameters while processing 4,320 tokens/second, outperforming significantly larger manually designed models. Full-scale evaluation shows HARMONY's top architectures achieve better loss trajectories than equivalently-sized models using state-of-the-art configurations including Mixtral, Jamba, and Samba. Additionally, we demonstrate 91% weak scaling efficiency when training discovered 36B-parameter models across 1,024 GPUs. HARMONY is released as an open framework with comprehensive tools for building and training hybrid models using expert-data-pipeline parallelism, democratizing access to automated architecture design for next-generation language models.

Herron, Emily [ORNL] (ORCID:0000000273008172)↗