SEARCH · Engineering Papers

Results for “constrained optimization”

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.

SourceResearch connectionFrom yearThrough year

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

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

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 OSTI2022

A review of non-cognitive applications for neuromorphic computing

Abstract Though neuromorphic computers have typically targeted applications in machine learning and neuroscience (‘cognitive’ applications), they have many computational characteristics that are attractive for a wide variety of computational problems. In this work, we review the current state-of-the-art for non-cognitive applications on neuromorphic computers, including simple computational kernels for composition, graph algorithms, constrained optimization, and signal processing. We discuss the advantages of using neuromorphic computers for these different applications, as well as the challenges that still remain. The ultimate goal of this work is to bring awareness to this class of problems for neuromorphic systems to the broader community, particularly to encourage further work in this area and to make sure that these applications are considered in the design of future neuromorphic systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗

DOE OSTI2024

Metric Learning to Accelerate Convergence of Operator Splitting Methods

Recent developments in machine learning have led to promising advances in accelerating the solution of constrained optimization problems. Increasing demand for real-time decision-making capabilities in applications such as artificial intelligence and optimal control has led to a variety of proposed strategies for learning to produce fast solutions to optimization problems. For example, recent works have shown that it is possible to accelerate the convergence of optimization algorithms by learning to select their parameters, such as gradient descent stepsizes. This work proposes a new approach, in which the underlying metric spaces of proximal operator splitting algorithms are learned to maximize convergence rate. While prior works in optimization theory have derived optimal metrics in simple cases, no such result exists for many practical problem forms including general Quadratic Programming (QP). This paper shows how differentiable optimization can enable the end-to-end learning of proximal metrics, enhancing the convergence of proximal algorithms for QP problems beyond what is possible based on known theory. Additionally, the results illustrate a strong connection between the learned proximal metrics and active constraints at the optima, leading to an interpretation in which the predicted proximal metrics can be viewed as a form of active set prediction.

King, Ethan [BATTELLE (PACIFIC NW LAB)]↗

DOE OSTI2020

A partial-volume correction for quantitative spectral x-ray radiography

The technique of spectral radiography has been shown to accurately discriminate a materials elemental composition by using known x-ray physics. This is achieved with a state-of-the-art pixelated spectrometer and a high-fidelity physical model. Similar to other radiographs, the system suffers from partial volume attenuation where the sample projection onto a pixel is only a fraction of the pixel area, leaving the rest unattenuated. This study updates the physical model to account for fractional area which presents new challenges to the existing algorithm. We present how this update is made and explore approaches to stabilize the algorithm through parameter scaling, constrained optimization, and hyperparameter selection.

Gillis, Wesley C.↗

DOE OSTI2021

Guaranteeing a Physically Realizable Battery Dispatch Without Charge-Discharge Complementarity Constraints

The non-convex complementarity constraints present a fundamental computational challenge in energy constrained optimization problems. In this work, we present a new, linear, and robust battery optimization formulation that sidesteps the need for battery complementarity constraints and integers and prove analytically that the formulation guarantees that all energy constraints are satisfied which ensures that the optimized battery dispatch is physically realizable. In addition, we bound the worst-case model mismatch and discuss conservativeness. In conclusion, simulation results further illustrate the effectiveness of this approach.

25 ENERGY STORAGE↗

DOE OSTI2020

A Generalized Stress Inversion Approach With Application to Residual Stress Estimation

In this work develop a generalized stress inversion technique (or the generalized inversion method) capable of recovering stresses in linear elastic bodies subjected to arbitrary cuts. Specifically, given a set of displacement measurements found experimentally from digital image correlation (DIC), we formulate a stress estimation inverse problem as a partial differential equation-constrained optimization problem. We use gradient-based optimization methods, and we accordingly derive the necessary gradient and Hessian information in a matrix-free form to allow for parallel, large-scale operations. By using a combination of finite elements, DIC, and a matrix-free optimization framework, the generalized inversion method can be used on any arbitrary geometry, provided that the DIC camera can view a sufficient part of the surface. We present numerical simulations and experiments, and we demonstrate that the generalized inversion method can be applied to estimate residual stress.

42 ENGINEERING↗

DOE OSTI2024

Inverse design of a pyrochlore lattice of DNA origami through model-driven experiments

Sophisticated statistical mechanics approaches and human intuition have demonstrated the possibility of self-assembling complex lattices or finite-size constructs. However, attempts so far have mostly only been successful in silico and often fail in experiment because of unpredicted traps associated with kinetic slowing down (gelation, glass transition) and competing ordered structures. Theoretical predictions also face the difficulty of encoding the desired interparticle interaction potential with the experimentally available nano- and micrometer-sized particles. To overcome these issues, we combine SAT assembly (a patchy-particle interaction design algorithm based on constrained optimization) with coarse-grained simulations of DNA nanotechnology to experimentally realize trap-free self-assembly pathways. In this paper, we use this approach to assemble a pyrochlore three-dimensional lattice, coveted for its promise in the construction of optical metamaterials, and characterize it with small-angle x-ray scattering and scanning electron microscopy visualization.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

DOE OSTI2021

On a nonlocal Cahn–Hilliard model permitting sharp interfaces

A nonlocal Cahn–Hilliard model with a non-smooth potential of double-well obstacle type that promotes sharp interfaces in the solution is presented. To capture long-range interactions between particles, a nonlocal Ginzburg–Landau energy functional is defined which recovers the classical (local) model as the extent of nonlocal interactions vanish. In contrast to the local Cahn–Hilliard problem that always leads to diffuse interfaces, the proposed nonlocal model can lead to a strict separation into pure phases of the substance. In this work, the lack of smoothness of the potential is essential to guarantee the aforementioned sharp-interface property. Mathematically, this introduces additional inequality constraints that, in a weak formulation, lead to a coupled system of variational inequalities which at each time instance can be restated as a constrained optimization problem. We prove the well-posedness and regularity of the semi-discrete and continuous in time weak solutions, and derive the conditions under which pure phases are admitted. Moreover, we develop discretizations of the problem based on finite element methods and implicit–explicit time-stepping methods that can be realized efficiently. Finally, we illustrate our theoretical findings through several numerical experiments in one and two spatial dimensions that highlight the differences in features of local and nonlocal solutions and also the sharp interface properties of the nonlocal model.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

The Critical Role Of Conversion Cost And Comparative Advantage In Modeling Agricultural Land Use Change

The difference in land use modeling approaches is an important uncertain factor in evaluating future climate scenarios in global economic models. We compare five widely used land use modeling approaches: constrained optimization, constant elasticity of transformation (CET), the additive form of constant elasticity of transformation (ACET), logit, and Ricardian. We demonstrate that the approaches differ not only by the extent of parameter uses but also by the definition of conversion cost and the consideration of comparative advantage implied by land heterogeneity. We develop a generalized hybrid approach that incorporates ACET/logit and Ricardian to account for both conversion cost and comparative advantage. We use this hybrid approach to estimate future climate impacts on agriculture. We find a welfare loss of about 0.38–0.46% of the global GDP. We demonstrate that ignoring land heterogeneity or land conversion costs underestimates climate impacts on agricultural production and welfare.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

ML-PSA

The computer code uses a parallel simulated annealing framework with embedded machine learning components to solve multi-constrained optimization problems. The software automatically balances the execution of low and high fidelity physics models within the optimization procedure. The low fidelity model is used to rapidly explore the design space while the high fidelity physics model is executed sparingly to account for complex design constraints that are not resolved by the quickly executing low fidelity model.

Gurecky, William↗

DOE OSTI2021

pnnl/neuromancer

Dynamics-based deep learning methods to modernize current scientific computing methods. Neuromancer is currently capable of solving inverse problems for a system of ordinary differential equations. The functionality includes system identification and constrained optimal control of unknown or partially known ODEs.

Skomski, Elliott↗

DOE OSTI2023

Solving multiphysics-based inverse problems with learned surrogates and constraints

Abstract Solving multiphysics-based inverse problems for geological carbon storage monitoring can be challenging when multimodal time-lapse data are expensive to collect and costly to simulate numerically. We overcome these challenges by combining computationally cheap learned surrogates with learned constraints. Not only does this combination lead to vastly improved inversions for the important fluid-flow property, permeability, it also provides a natural platform for inverting multimodal data including well measurements and active-source time-lapse seismic data. By adding a learned constraint, we arrive at a computationally feasible inversion approach that remains accurate. This is accomplished by including a trained deep neural network, known as a normalizing flow, which forces the model iterates to remain in-distribution, thereby safeguarding the accuracy of trained Fourier neural operators that act as surrogates for the computationally expensive multiphase flow simulations involving partial differential equation solves. By means of carefully selected experiments, centered around the problem of geological carbon storage, we demonstrate the efficacy of the proposed constrained optimization method on two different data modalities, namely time-lapse well and time-lapse seismic data. While permeability inversions from both these two modalities have their pluses and minuses, their joint inversion benefits from either, yielding valuable superior permeability inversions and CO 2 plume predictions near, and far away, from the monitoring wells.

Yin, Ziyi (ORCID:0000000250248771)↗

DOE OSTI2022

Ig-VAE: Generative modeling of protein structure by direct 3D coordinate generation

While deep learning models have seen increasing applications in protein science, few have been implemented for protein backbone generation—an important task in structure-based problems such as active site and interface design. We present a new approach to building class-specific backbones, using a variational auto-encoder to directly generate the 3D coordinates of immunoglobulins. Our model is torsion- and distance-aware, learns a high-resolution embedding of the dataset, and generates novel, high-quality structures compatible with existing design tools. We show that the Ig-VAE can be used with Rosetta to create a computational model of a SARS-CoV2-RBD binder via latent space sampling. We further demonstrate that the model’s generative prior is a powerful tool for guiding computational protein design, motivating a new paradigm under which backbone design is solved as constrained optimization problem in the latent space of a generative model.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

Wave Prediction using X-Band Radar (Final Summary Report)

Model Predictive Control (MPC) is the best controls framework available to wave energy today. It allows for the maximization of energy yield from a WEC system while respecting various constraints and losses in the system. This type of constrained optimization is a critical capability for the techno-economic optimization of WEC devices and is difficult to do effectively with causal controls frameworks. MPC requires a future prediction of wave excitation forces, requiring wave prediction on a future time horizon of up to 30 seconds. The future horizon required is highly dependent on the WEC and PTO type available. To our knowledge no-one has been able to implement MPC on a WEC device at sea, due to the fact that phase-resolved wave-prediction is not a capability that has been sufficiently developed to date. The key objectives of this project are focused on developing “industry-ready” wave prediction technology building blocks that can be applied to a wide range of different wave energy conversion topologies. Our collaborative work with device developers has demonstrated that the level of improvement attainable for any particular device is heavily dependent on the device and PTO topology chosen. The range of annual average power capture improvements is on the order of 10% to over 100%. However, the important aspect is that we can get within about 10% of theoretical upper limits even when considering errors in the wave prediction and more importantly, we can optimize performance while respecting various constraints such as motion amplitude or peak structural loads. The combination of improved performance while limiting structural loads has a net effect of reducing the levelized cost of energy from these emerging technologies and allows us to design control laws that meet an economic optimum. Efforts under a previous project on controls has focused on developing a set of wave-prediction algorithms that work by leveraging a network of wave sensing measurement buoys that are equipped with real-time telemetry. The present work is focusing primarily on using X-band radar to measure the wave-field around the WEC to predict the future excitation forces on the structure and combining the measurements of these different sources to create improvements in the wave-prediction accuracy.

16 TIDAL AND WAVE POWER↗

DOE OSTI2023

Domain Aware Deep-learning Algorithms Integrated with Scientific-computing Technologies (DADAIST)

This technical report summarized the contribution of the DADAIST project funded by the Data Model Convergence Initiative via the Laboratory Directed Research and Development (LDRD) investments at Pacific Northwest National Laboratory (PNNL). Specifically, we report the development of the NeuroMANCER (Neural Modules with Adaptive Nonlinear Constraints and Efficient Regularizations), a new open-source Scientific Machine Learning library for formulating and solving parametric constrained optimization problems, physics-informed system identification, and parametric optimal control problems. NeuroMANCER is using differentiable programming to combine modern data-driven models and optimization modeling language into a coherent algorithmic and software framework. NeuroMANCER is a Pytorch-based framework and adopts much of its philosophy focused on research and development, rapid prototyping, and streamlined deployment. Strong emphasis is given to extensibility, interoperability with the PyTorch ecosystem, and quick adaptability to custom domain problems. Neuromancer repository contains a comprehensive library of differentiable modules, including custom activation functions, matrix factorizations, deep learning architectures, neural differential equations, differential equation solvers, implicit layers such as iterative solvers, high-level API for symbolic expressions, API for modeling and control of dynamical systems, and extensive set of tutorial code examples in the form of python scripts and jupyter notebooks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Quantum Local Search with the Quantum Alternating Operator Ansatz

We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to solve large problem instances on quantum devices with few qubits. This hybrid algorithm iteratively finds independent sets over carefully constructed neighborhoods and combines these solutions to obtain a global solution. We study the performance of this algorithm on 3-regular, Community, and Erdős-Rényi graphs with up to 100 nodes.

Tomesh, Teague↗