Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 1,207 records · Page 67

blastforge

BlastForge is a python module meant to aid reinforcement learning research for geometry optimization research projects. The code is built to use PyTorch as a backend and will contain several model architectures and reinforcement learning training loops as well as helper python functions to evaluate a model’s performance during and after training. BlastForge is meant to be a small, focused python project to study moderate-complexity geometry optimization problems

Hickmann, Kyle [Los Alamos National Laboratory]↗

Homotopy Solver

This software implements parallel versions of an interior-point solver, based on the publicly available ipopt solver. Here we have full control over the linear solver and our algorithm is fully parallel thus enabling scalability to large-scale optimization problems. This package also has a parallel implementation of a homotopy solver developed under the scalable methods for contact LDRD project 23-ERD-017. This solver is an mfem-based implementation of algorithm described in ``A filter trust-region Newton continuation method for nonlinear complementarity problems''. Cosmin G. Petra, Nai-Yuan Chiang, Jingyi Wang, Tucker Hartland, and Michael Puso (submitted), LLNL-JRNL-869761.

Hartland, Tucker [Lawrence Livermore National Labo↗

BLING

The Bounded Linearized Iteration for Natural Gas (BLING) algorithm solves an optimization problem for gas pipeline flow scheduling that maximizes economic surplus and minimizes the energy used for gas compression subject to pressure, flow, and engineering constraints.

Zlotnik, Anatoly↗

Adaptive Computing (AC) (Open Source) [SWR-24-106]

The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly, adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.

Griffin, Kevin [National Laboratory of the Rockies↗

VQE method: a short survey and recent developments

Abstract The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues of a Hamiltonian. VQE has been proposed as an alternative to fully quantum algorithms such as quantum phase estimation (QPE) because fully quantum algorithms require quantum hardware that will not be accessible in the near future. VQE has been successfully applied to solve the electronic Schrödinger equation for a variety of small molecules. However, the scalability of this method is limited by two factors: the complexity of the quantum circuits and the complexity of the classical optimization problem. Both of these factors are affected by the choice of the variational ansatz used to represent the trial wave function. Hence, the construction of an efficient ansatz is an active area of research. Put another way, modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatzes for problems that map onto more than several qubits. In this review, we present recent developments in the field of designing efficient ansatzes that fall into two categories—chemistry–inspired and hardware–efficient—that produce quantum circuits that are easier to run on modern hardware. We discuss the shortfalls of ansatzes originally formulated for VQE simulations, how they are addressed in more sophisticated methods, and the potential ways for further improvements.

Fedorov, Dmitry A. (ORCID:0000000316598580)↗

Topology optimization of 3D photonic crystals with complete bandgaps

The design of photonic crystals with complete bandgaps has recently received considerable research focus for numerous reasons. This work leverages well-known nonlinear programming techniques to alleviate the non-smoothness caused by degenerate eigenvalues such that topology optimization problems can be solved with the open-source IPOPT software. A fully-vectorial plane wave expansion technique is used with an iterative eigensolver to efficiently predict dispersion properties of candidate structures. Nonlinear programming is employed to solve the inverse problem of designing three-dimensional periodic structures that exhibit complete two-dimensional (2D) and three-dimensional (3D) photonic bandgaps. Mesh refinement is performed to alleviate the large computational burden of designing and analyzing photonic crystals, and a periodic density filter is implemented to impose a minimum feature size for manufacturability considerations.

97 MATHEMATICS AND COMPUTING↗

Relation Inference among Sensor Time Series in Smart Buildings with Metric Learning

Smart Building Technologies hold promise for better livability for residents and lower energy footprints. Yet, the rollout of these technologies, from demand response controls to fault detection and diagnosis, significantly lags behind and is impeded by the current practice of manual identification of sensing point relationships, e.g., how equipment is connected or which sensors are co-located in the same space. This manual process is still error-prone, albeit costly and laborious.We study relation inference among sensor time series. Our key insight is that, as equipment is connected or sensors co-locate in the same physical environment, they are affected by the same real-world events, e.g., a fan turning on or a person entering the room, thus exhibiting correlated changes in their time series data. To this end, we develop a deep metric learning solution that first converts the primitive sensor time series to the frequency domain, and then optimizes a representation of sensors that encodes their relations. Built upon the learned representation, our solution pinpoints the relationships among sensors via solving a combinatorial optimization problem. Extensive experiments on real-world buildings demonstrate the effectiveness of our solution.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

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↗

Modern modulation schemes: a linear programming based tone injection algorithm for PAPR reduction of OFDM and linearly precoded systems

This work investigates the improvement of power amplifier efficiency through the reduction of peak-to-average power ratio (PAPR) of linearly precoded QAM data signals. In particular, we fo cus on the special cases of linear precoded modulation including the practical OFDM, OFDMA, and SC-FDMA signals that have been widely adopted in W-LAN and W-MAN. We apply the method of tone injection optimization for PAPR reduction. To reduce numerical complexity, we propose a linear programming algorithm which closely approximates the original tone injection optimization problem. Our comprehensive numerical results demonstrate substantial PAPR reduc tion and superior BER performance using several practical examples.

Jacklin, Neil↗

Numerical Optimization Algorithms and Software for Systems Biology

The basic aims of this work are: to develop reliable algorithms for solving optimization problems involving large stoichiometric matrices; to investigate cyclic dependency between metabolic and macromolecular biosynthetic networks; and to quantify the significance of thermodynamic constraints on prokaryotic metabolism.

59 BASIC BIOLOGICAL SCIENCES↗

Elastic-Waveform Inversion with Compressive Sensing for Sparse Seismic Data

Accurate velocity models of compressional- and shear-waves are essential for geothermal reservoir characterization and microseismic imaging. Elastic-waveform inversion of multi-component seismic data can provide high-resolution inversion results of subsurface geophysical properties. However, the method requires seismic data acquired using dense source and receiver arrays. In practice, seismic sources and/or geophones are often sparsely distributed on the surface and/or in a borehole, such as 3D vertical seismic profiling (VSP) surveys. We develop a novel elastic-waveform inversion method with compressive sensing for inversion of sparse seismic data. We employ an alternating-minimization algorithm to solve the optimization problem of our new waveform inversion method. We validate our new method using synthetic VSP data for a geophysical model built using geologic features found at the Raft River enhanced-geothermal-system (EGS) field. We apply our method to synthetic VSP data with a sparse source array and compare the results with those obtained with a dense source array. Our numerical results demonstrate that the velocity models produced with our new method using a sparse source array are almost as accurate as those obtained using a dense source array.

58 GEOSCIENCES↗

Embedded Sensors and Controls to Improve Component Performance and Reliability - System Dynamics Modeling and Control System Design

This report documents the current status of the modeling, control design, and embedded control research for the magnetic bearing canned rotor pump being used as a demonstration platform for deeply integrating instrumentation and controls (I&C) into nuclear power plant components. This pump is a highly inter-connected thermo/electro/mechanical system that requires an active control system to operate. Magnetic bearings are inherently unstable system and without active, moment by moment control, the rotor would contact fixed surfaces in the pump causing physical damage. This report details the modeling of the pump rotordynamics, fluid forces, electromagnetic properties of the protective cans, active magnetic bearings, power electronics, and interactions between different dynamical models. The system stability of the unforced and controlled rotor are investigated analytically. Additionally, controllers are designed using proportional derivative (PD) control, proportional integral derivative (PID) control, voltage control, and linear quadratic regulator (LQR) control. Finally, a design optimization problem that joins the electrical, mechanical, magnetic, and control system design into one problem to balance the opposing needs of various design criteria using the embedded system approach is presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE Energy Frontiers Research Center for Heterogeneous Functional Materials; the “HeteroFoaM Center”

Synopsis of five year accomplishments: Devices that convert and store energy are generally made from heterogeneous constituent materials that act and interact to selectively conduct, transport, and separate mass, heat, and charge. Controlling these actions and interactions enables the technical breakthroughs that have made fuel cells, batteries, and solid state membranes, for example, essential parts of our society. In the biological sense, these materials are ‘vascular’ rather than primitive ‘cellular’ materials, in which the arrangements and configurations of the constituents (including their void phases) play essential and definitive roles in their functional capabilities. In 2009 a group of investigators, with lifetime investments of effort in the understanding of heterogeneous materials, recognized that the design of such material systems is not an optimization problem as such. Local interactions of the constituents create “emergent” properties and responses that are not part of the formal set of constituent characteristics, in much the same sense that society and culture is created by the group interactions of the people involved. The design of emergent properties is an open question in all formal science, but for energy materials the lack of this foundation science relegates development tasks to Edisonian trial and error, with anecdotal success and frequent costly failures. That group defined, for the first time, multi-scale heterogeneous functional materials with functional disordered and void phase regions as “HeteroFoaM,” and formed the first multidisciplinary research team to define and codify the foundation science of that material class. The primary goal of the HeteroFoaM Center was, and is, to create and establish the multi-scale fundamental knowledge and related methodology required for the rational and systematic multiphysics design of heterogeneous functional materials and their interfaces and surfaces for applications in energy transformation and storage. The scope of the HeteroFoaM center was focused on the discovery and development of the control science of key phenomena across multiple length scales that create functionality in heterogeneous materials and their structured interfaces, boundaries, and surfaces for applications in energy technologies. The HeteroFoaM Center defined a critical path and established an essential foundation for progress in the field of heterogeneous functional materials. Perhaps the single most important element of progress was the establishment of the capability to design, characterize, and model heterogeneous functional materials at the conformal level, i.e., for a limited set of material systems, the HeteroFoaM team defined how to control the order / disorder at the atomic level, the surfaces, and the interfaces for selected constituent morphologies, and to use multiphysical models to explain the remarkable property variations resulting from that control science for several heterogeneous material systems. For those cases we defined “meso-structures” (at various scales) where the interactive physics of constituent phases acted to create emergent properties, e.g., strongly emergent mixed conductor behavior and ionic transport. The general approach used by this EFRC is shown in Fig. 1. The HeteroFoaM Center created the genre of Heterogeneous Functional Materials with functional surfaces and interfaces (including void phases) called HeteroFoaM as a science platform to enable rational analysis and design of functional material systems by focusing on the meso-interactions that drive emergent response. The team firmly established this approach with over 180 archival publications (see “Publications” section), 7 patent applications, and over 100 invited lectures in 15 countries on this topic, enabled by building a remarkably effective and uniquely coherent research team. Indeed, our team was our principal strength; this problem eluded solution earlier because such a team was not available.

36 MATERIALS SCIENCE↗

Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis

We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of technological maturity. We critically evaluate and offer our own contributions to current quantum benchmarking efforts, in particular those involving adiabatic quantum computation and the Adiabatic Quantum Optimizers produced by D-Wave Systems, Inc. We find that the performance of D-Wave's Adiabatic Quantum Optimizers scales roughly on par with classical approaches for some hard combinatorial optimization problems; however, architectural limitations of D-Wave devices present a significant hurdle in evaluating real-world applications. In addition to identifying and isolating such limitations, we develop algorithmic tools for circumventing these limitations on future D-Wave devices, assuming they continue to grow and mature at an exponential rate for the next several years.

97 MATHEMATICS AND COMPUTING↗

Toolpath generation from fiber orientation distribution

We define toolpaths as contours of a level-set function and fit these contours with a given fiber orientation distribution. To define the orientation error, we use the difference between the tangent vectors of these contours and the given fiber orientations. Our fit consist in an optimization problem where we minimize the orientation error subject to manufacturing constraints. Two examples are provided.

42 ENGINEERING↗

Deep Conservation: A latent dynamics model for exact satisfaction of physical conservation laws [Report]

This work proposes an approach for latent dynamics learning that exactly enforces physical conservation laws. The method comprises two steps. First, we compute a low-dimensional embedding of the high-dimensional dynamical-system state using deep convolutional autoencoders. This defines a low-dimensional nonlinear manifold on which the state is subsequently enforced to evolve. Second, we define a latent dynamics model that associates with a constrained optimization problem. Specifically, the objective function is defined as the sum of squares of conservation-law violations over control volumes in a finite-volume discretization of the problem; nonlinear equality constraints explicitly enforce conservation over prescribed subdomains of the problem. The resulting dynamics model—which can be considered as a projection-based reduced-order model—ensures that the time-evolution of the latent state exactly satisfies conservation laws over the prescribed subdomains. In contrast to existing methods for latent dynamics learning, this is the only method that both employs a nonlinear embedding and computes dynamics for the latent state that guarantee the satisfaction of prescribed physical properties. Numerical experiments on a benchmark advection problem illustrate the method's ability to significantly reduce the dimensionality while enforcing physical conservation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Future Grid State Modeling for Transactive Systems

The simulation design and evaluation of a transactive energy system is contingent on the setting in which it would exist, which could vary significantly with the many drivers that impact the potential future states of the power system. This report summarizes the development of the Transactive Future Grid State (TFGS) model, which is a lightweight capacity expansion model that will support transactive energy research by allowing users to explore alternative future states. The TFGS model determines the long-term generation capacity needs of a given power system that satisfy specified constraints and support a least cost hourly dispatch. This is accomplished by solving a single optimization problem that simultaneously finds the generation fleet with capacity sufficient to meet peak load and the flexibility to meet hourly operational dispatch, all at lowest cost. The TFGS model was applied to a larger ongoing study taking place that will be simulating how distribution system operators (DSOs) could use a transactive energy system to manage distributed energy resources. The larger study, commonly referred to as the DSO+T study, involves two parallel analyses; one that represents the system today and one that represents a future system with a high degree of renewable energy penetration. The TFGS model provided the generation mix of the high renewable base case. As the TFGS model was being used to provide inputs to the DSO+T study, two issues became apparent. First, additional functionality would have been useful, and second, a larger-than-anticipated amount of user inputs and data were required to successfully use the TFGS model. These discoveries have lead to the recommendation of specific functionality that can be added in future development of the tool.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗