Search NASA⌕ Search

SEARCH · Search NASA

Results for “Line search”

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 OSTI2025

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Surrogate Hessian accelerated structural optimization for stochastic electronic structure theories

In this work, we present an efficient energy-based method for structural optimization with stochastic electronic structure theories, such as diffusion quantum Monte Carlo (DMC). This method is based on robust line-search energy minimization in reduced parameter space, exploiting approximate but accurate Hessian information from a surrogate theory, such as density functional theory. The surrogate theory is also used to characterize the potential energy surface, allowing for simple but reliable ways to maximize statistical efficiency while retaining controllable accuracy. We demonstrate the method by finding the minimum DMC energy structures of the selected flake-like aromatic molecules, such as benzene, coronene, and ovalene, represented by 2, 6, and 19 structural parameters, respectively. In each case, the energy minimum is found within two parallel line-search iterations. The method is near-optimal for a line-search technique and suitable for a broad range of applications. It is easily generalized to any electronic structure method where forces and stresses are still under active development and implementation, such as diffusion Monte Carlo, auxiliary-field Monte Carlo, and stochastic configuration interaction, as well as deterministic approaches such as the random-phase approximation. Accurate and efficient means of geometry optimization could shed light on a broad class of materials and molecules, showing high sensitivity of induced properties to structural variables.

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

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗
DOE OSTI2023

Neglecting Model Parametric Uncertainty Can Drastically Underestimate Flood Risks

Abstract Floods drive dynamic and deeply uncertain risks for people and infrastructures. Uncertainty characterization is a crucial step in improving the predictive understanding of multi‐sector dynamics and the design of risk‐management strategies. Current approaches to estimate flood hazards often sample only a relatively small subset of the known unknowns, for example, the uncertainties surrounding the model parameters. This approach neglects the impacts of key uncertainties on hazards and system dynamics. Here we mainstream a recently developed method for Bayesian inference to calibrate a computationally expensive distributed hydrologic model. We compare three different calibration approaches: (a) stepwise line search, (b) precalibration or screening, and (c) the Fast Model Calibrations (FaMoS) approach. FaMoS deploys a particle‐based approach that takes advantage of the massive parallelization afforded by modern high‐performance computing systems. We quantify how neglecting parametric uncertainty and data discrepancy can drastically underestimate extreme flood events and risks. Precalibration improves prediction skill score over a stepwise line search. The Bayesian calibration improves the uncertainty characterization of model parameters and flood risk projections.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗
DOE OSTI2020

Geometry-independent microstructure optimization for electron beam powder bed fusion additive manufacturing

The ability to manipulate the formation of microstructure is one of the potential advantages of additive manufacturing. Yet, the additive manufacturing process is riddled with complex interactions between processing parameters, geometry, and spot melting sequence which makes the task of controlling microstructure challenging. This paper proposes a method to solve the microstructure texture optimization problem by leveraging established optimization techniques and increasingly fast and accurate analytical heat transfer models. Respectively, we apply two different optimization algorithms, genetic algorithm and concurrent greedy line search, in order to induce arbitrarily shaped microstructure regions and we use a heat transfer model to evaluate the fitness of solutions in an iterative approach that is far more efficient than pure trial and error. The objective of the optimization algorithm is to control local thermal conditions – hence microstructure formation – during the melting process by manipulating the order and the dwell time of all the points of the infill pattern sequence. We then analyze the optimized sequence to determine important path characteristics that affect the microstructure formation. Through examples, we show that relative order and frequency, as measured by weighted average and variance of spot order, are important factors that influence the final characteristics.

36 MATERIALS SCIENCE↗
DOE OSTI2022

An indirect approach to optimize the reaction rates of thermal NO formation for diesel engines

With stringent emission regulations, it has become more important for modern diesel engine manufacturers to accurately predict engine-out nitrogen oxide (NO x ) emissions across a wide range of operating conditions. Thermal NO is the major source of engine-out NO x in modern diesel engines. For thermal NO formation, several earlier studies have recommended the forward and reverse reaction rate coefficients of the rate-limiting reaction (O + N 2 ⇌ NO + N). However, due to deficiencies in sub-models and inadequacies of reduced chemical mechanisms to represent diesel combustion, these recommended values more often than not need to be adjusted in reduced order combustion models to accurately predict engine-out NO x . Hence, in this work a systematic and computationally efficient approach has been proposed to streamline the process of determining the optimum reaction rate coefficients. Here, to develop the optimization approach, four different production diesel engines with different operating conditions in terms of speed, load, and exhaust-gas recirculation have been considered. Numerical simulations have been performed using a detailed zero-dimensional velocity-composition-frequency transported probability density function (0D-VCF-tPDF) model that uses hundreds of notional particles to capture in-cylinder stratification. Four different combinations of hydrocarbon and NO x chemical mechanisms were used to represent chemistry. It was found that for the rate-limiting reaction, the pre-exponent factors (A f1 , A r1 ) and activation energies (E A,f1 , E A,r1 ) of the forward and reverse reaction rates follow a linear band in A f1 - E A,f1 and A r1 - E A,r1 space where predicted engine-out NO x match the measured values closely. By encompassing such bands from different engines and considering constraints on activation energies, a reduced search domain of pre-exponent factors and activation energies was constructed that is expected to be applicable to any diesel engine. Eventually, computationally efficient three-line and one-line search approaches were proposed to determine the optimum values of the pre-exponent factors and activation energies that led to a minimum error between measured and predicted engine-out NO x . Finally, these three-line and one-line NO x optimization approaches were applied to a fifth production diesel engine for which the 0D-VCF-tPDF model showed a very good predictive performance in terms of predicting peak pressure, 50% burn rate, and engine-out NO x when compared to measured and 3D-CFD values.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

CLASS: Coronal Line Activity Spectroscopic Survey

We conduct the first systematic survey of a comprehensive set of the twenty optical coronal lines in the spectra of nearly 1 million galaxies observed by the Sloan Digital Sky Survey (SDSS) Data Release 8 catalog. This includes often overlooked high ionization potential lines such as [Ar x] λ5533, [S XII ] λ7609, [Fe XI ] λ7892, and [Fe XIV ] λ5303. We find that, given the limited sensitivity of SDSS, strong coronal line emission is extremely rare, with only ~0.03% of the sample showing at least one coronal line, significantly lower than the fraction of galaxies showing optical narrow line ratios (~17%) or mid-infrared colors (~2%) indicative of nuclear activity. The coronal line luminosities exhibit a large dynamic range, with values ranging from ~10 34 to 10 42 erg s –1 . We find that a vast majority (~80%) of coronal line emitters in dwarf galaxies (M $\star$ < 9.6 × 10 9 M ⊙ ) do not display optical narrow line ratios indicative of nuclear activity, in contrast to higher mass galaxies (~17%). Moreover, we find that the highest ionization potential lines are preferentially found in lower mass galaxies. These findings are consistent with the theory that lower mass black holes found in lower mass galaxies produce a hotter accretion disk, which in turn enhances the higher ionization coronal line spectrum. Future coronal line searches with 30 m class telescopes or JWST may provide a pathway into uncovering the intermediate mass black hole population.

79 ASTRONOMY AND ASTROPHYSICS↗
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

Compact representations of structured BFGS matrices

For general large-scale optimization problems compact representations exist in which recursive quasi-Newton update formulas are represented as compact matrix factorizations. For problems in which the objective function contains additional structure, recent structured quasi-Newton methods exploit available second-derivative information and approximate unavailable second derivatives. Here, this article develops the compact representations of two structured Broyden-Fletcher-Goldfarb-Shanno update formulas. The compact representations enable efficient limited memory and initialization strategies. Two limited memory line search algorithms are described for which extensive numerical results demonstrate the efficacy of the algorithms, including comparisons to IPOPT on large machine learning problems, and to L-BFGS on a real world large scale ptychographic imaging application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Force-Free Identification of Minimum-Energy Pathways and Transition States for Stochastic Electronic Structure Theories

Here, the accurate mapping of potential energy surfaces (PESs) is crucial to our understanding of the numerous physical and chemical processes mediated by atomic rearrangements, such as conformational changes and chemical reactions, and the thermodynamic and kinetic feasibility of these processes. Stochastic electronic structure theories, e.g., Quantum Monte Carlo (QMC) methods, enable highly accurate total energy calculations that in principle can be used to construct the PES. However, their stochastic nature poses a challenge to the computation and use of forces and Hessians, which are typically required in algorithms for minimum-energy pathway (MEP) and transition state (TS) identification, such as the nudged elastic band (NEB) algorithm and its climbing image formulation. Here, we present strategies that utilize the surrogate Hessian line-search method, previously developed for QMC structural optimization, to efficiently identify MEP and TS structures without requiring force calculations at the level of the stochastic electronic structure theory. By modifying the surrogate Hessian algorithm to operate in path-orthogonal subspaces and at saddle points, we show that it is possible to identify MEPs and TSs by using a force-free QMC approach. We demonstrate these strategies via two examples, the inversion of the ammonia (NH 3 ) molecule and the nucleophilic substitution (S N 2) reaction F – + CH 3 F → FCH 3 + F – . We validate our results using Density Functional Theory (DFT)- and Coupled Cluster (CCSD, CCSD(T))-based NEB calculations. We then introduce a hybrid DFT-QMC approach to compute thermodynamic and kinetic quantities, free energy differences, rate constants, and equilibrium constants that incorporates stochastically optimized structures and their energies, and show that this scheme improves upon DFT accuracy. Our methods generalize straightforwardly to other systems and other high-accuracy theories that similarly face challenges computing energy gradients, paving the way for highly accurate PES mapping, transition state determination, and thermodynamic and kinetic calculations at significantly reduced computational expense.

Iyer, Gopal R.↗
DOE OSTI2023

A Quantum Monte Carlo Study of the Structural, Energetic, and Magnetic Properties of Two-Dimensional H and T Phase VSe 2

Previous works have controversially claimed near-room-temperature ferromagnetism in two-dimensional (2D) VSe 2 , with conflicting results throughout the literature. These discrepancies in magnetic properties between both phases (T and H) of 2D VSe 2 are most likely due to the structural parameters being coupled to the magnetic properties. Specifically, both phases have a close lattice match and similar total energies, which makes it difficult to determine which phase is being observed experimentally. Here, in this study, we used a combination of density functional theory, highly accurate diffusion Monte Carlo (DMC), and a surrogate Hessian line-search optimization technique to resolve the previously reported discrepancy in structural parameters and relative phase stability. With DMC accuracy, we determined the free-standing geometry of both phases and constructed a phase diagram. Our findings demonstrate the successes of the DMC method coupled with the surrogate Hessian structural optimization technique when applied to a 2D magnetic system.

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

O Corona, where art thou? eROSITA’s view of UV-optical-IR variability-selected massive black holes in low-mass galaxies

Finding massive black holes (MBHs,M BH ≈ 10 4 –10 7 M ⊙ ) in the nuclei of low-mass galaxies $\left( {{M_*}\mathop {\mathop < \limits_ }\limits_ {{10}^{10}}{M_ \odot }} \right)$ is crucial to constrain seeding and growth of black holes over cosmic time, but it is particularly challenging due to their low accretion luminosities. Variability selection via long-term photometric ultraviolet, optical, or infrared (UVOIR) light curves has proved effective and identifies lower-Eddington ratios compared to broad and narrow optical spectral lines searches. In the inefficient accretion regime, X-ray and radio searches are effective, but they have been limited to small samples. Therefore, differences between selection techniques have remained uncertain. Here, we present the first large systematic investigation of the X-ray properties of a sample of known MBH candidates in dwarf galaxies. We extracted X-ray photometry and spectra of a sample of ~200 UVOIR variability-selected MBHs and significantly detected 17 of them in the deepest available SRG/eROSITA image, of which four are newly discovered X-ray sources and two are new secure MBHs. This implies that tens to hundreds of LSST MBHs will have SRG/eROSITA counterparts, depending on the seeding model adopted. Surprisingly, the stacked X-ray images of the many non-detected MBHs are incompatible with standard disk-corona relations, typical of active galactic nuclei, inferred from both the optical and radio fluxes. They are instead compatible with the X-ray emission predicted for normal galaxies. After careful consideration of potential biases, we identified that this X-ray weakness needs a physical origin. A possibility is that a canonical X-ray corona might be lacking in the majority of this population of UVOIR-variability selected low-mass galaxies or that unusual accretion modes and spectral energy distributions are in place for MBHs in dwarf galaxies. This result reveals the potential for severe biases in occupation fractions derived from data from only one waveband combined with SEDs and scaling relations of more massive black holes and galaxies.

Astronomy & Astrophysics↗
DOE OSTI2022

A combined first principles study of the structural, magnetic, and phonon properties of monolayer CrI3

The first magnetic 2D material discovered, monolayer (ML) CrI3, is particularly fascinating due to its ground state ferromagnetism. However, because ML materials are difficult to probe experimentally, much remains unresolved about ML CrI3’s structural, electronic, and magnetic properties. Here, we leverage Density Functional Theory (DFT) and high-accuracy Diffusion Monte Carlo (DMC) simulations to predict lattice parameters, magnetic moments, and spin–phonon and spin–lattice coupling of ML CrI3. We exploit a recently developed surrogate Hessian DMC line search technique to determine CrI3’s ML geometry with DMC accuracy, yielding lattice parameters in good agreement with recently published STM measurements—an accomplishment given the ~10% variability in previous DFT-derived estimates depending upon the functional. Strikingly, we find that previous DFT predictions of ML CrI3’s magnetic spin moments are correct on average across a unit cell but miss critical local spatial fluctuations in the spin density revealed by more accurate DMC. DMC predicts that magnetic moments in ML CrI3 are 3.62 μB per chromium and -0.145 μB per iodine, both larger than previous DFT predictions. The large disparate moments together with the large spin–orbit coupling of CrI3’s I-p orbital suggest a ligand superexchange-dominated magnetic anisotropy in ML CrI3, corroborating recent observations of magnons in its 2D limit. We also find that ML CrI3 exhibits a substantial spin–phonon coupling of ~3.32 cm-1. Our work, thus, establishes many of ML CrI3’s key properties, while also continuing to demonstrate the pivotal role that DMC can assume in the study of magnetic and other 2D materials.

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

Efficient optimization method for finding minimum energy paths of magnetic transitions

Here, efficient algorithms for the calculation of minimum energy paths of magnetic transitions are implemented within the geodesic nudged elastic band (GNEB) approach. While an objective function is not available for GNEB and a traditional line search can, therefore, not be performed, the use of limited memory Broyden–Fletcher–Goldfarb–Shanno (LBFGS) and conjugate gradient algorithms in conjunction with orthogonal spin optimization (OSO) approach is shown to greatly outperform the previously used velocity projection and dissipative Landau–Lifschitz dynamics optimization methods. The implementation makes use of energy weighted springs for the distribution of the discretization points along the path and this is found to improve performance significantly. The various methods are applied to several test problems using a Heisenberg-type Hamiltonian, extended in some cases to include Dzyaloshinskii–Moriya and exchange interactions beyond nearest neighbours. Minimum energy paths are found for magnetization reversals in a nano-island, collapse of skyrmions in two-dimensional layers and annihilation of a chiral bobber near the surface of a three-dimensional magnet. The LBFGS-OSO method is found to outperform the dynamics based approaches by up to a factor of 8 in some cases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗