Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear 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.

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

At least 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Block-diagonalization as a tool for the robust diabatization of high-dimensional potential energy surfaces

Robust diabatization techniques are key for the development of high-dimensional coupled potential energy surfaces (PESs) to be used in multi-state quantum dynamics simulations. In the present study we demonstrate that, besides the actual diabatization technique, common problems with the underlying electronic structure calculations can be the reason why a diabatization fails. After giving a short review of the theoretical background of diabatization, we propose a method based on the block-diagonalization to analyse the electronic structure data. This analysis tool can be used in three different ways: First, it allows to detect issues with the ab initio reference data and is used to optimize the setup of the electronic structure calculations. Second, the data from the block-diagonalization are utilized for the development of optimal parametrized diabatic model matrices by identifying the most significant couplings. Third, the block-diagonalization data are used to fit the parameters of the diabatic model, which yields an optimal initial guess for the non-linear fitting required by standard or more advanced energy based diabatization methods. The new approach is demonstrated by the diabatization of 9 electronic states of the propargyl radical, yielding fully coupled full-dimensional (12D) PESs in closed form.

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

New Effective Multithreaded Matching Algorithms

Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.

matching, parallel algorithms↗
DOE OSTI2016

Output Feedback Stabilization for a Class of Multi-Variable Bilinear Stochastic Systems with Stochastic Coupling Attenuation

In this paper, stochastic coupling attenuation is investigated for a class of multi-variable bilinear stochastic systems and a novel output feedback m-block backstepping controller with linear estimator is designed, where gradient descent optimization is used to tune the design parameters of the controller. It has been shown that the trajectories of the closed-loop stochastic systems are bounded in probability sense and the stochastic coupling of the system outputs can be effectively attenuated by the proposed control algorithm. Moreover, the stability of the stochastic systems is analyzed and the effectiveness of the proposed method has been demonstrated using a simulated example.

47 OTHER INSTRUMENTATION↗
DOE OSTI2015

A Probabilistic Risk Mitigation Model for Cyber-Attacks to PMU Networks

The power grid is becoming more dependent on information and communication technologies. Complex networks of advanced sensors such as phasor measurement units (PMUs) are used to collect real time data to improve the observability of the power system. Recent studies have shown that the power grid has significant cyber vulnerabilities which could increase when PMUs are used extensively. Therefore, recognizing and responding to vulnerabilities are critical to the security of the power grid. This paper proposes a risk mitigation model for optimal response to cyber-attacks to PMU networks. We model the optimal response action as a mixed integer linear programming (MILP) problem to prevent propagation of the cyber-attacks and maintain the observability of the power system.

Cyber-attack↗
DOE OSTI2022

An improved representation of the relationship between photosynthesis and stomatal conductance leads to more stable estimation of conductance parameters and improves the goodness-of-fit across diverse data sets

Stomata play a central role in surface-atmosphere exchange by controlling the flux of water and CO 2 between the leaf and the atmosphere. Representation of stomatal conductance (g sw ) is therefore an essential component of models that seek to simulate water and CO 2 exchange in plants and ecosystems. For given environmental conditions at the leaf surface (CO 2 concentration and vapor pressure deficit or relative humidity), models typically assume a linear relationship between g sw and photosynthetic CO 2 assimilation (A). However, measurement of leaf-level g sw response curves to changes in A are rare, particularly in the tropics, resulting in only limited data to evaluate this key assumption. Here, we measured the response of g sw and A to irradiance in six tropical species at different leaf phenological stages. We showed that the relationship between g sw and A was not linear, challenging the key assumption upon which optimality theory is based-that the marginal cost of water gain is constant. Our data showed that increasing A resulted in a small increase in g sw at low irradiance, but a much larger increase at high irradiance. We reformulated the popular Unified Stomatal Optimization (USO) model to account for this phenomenon and to enable consistent estimation of the key conductance parameters g 0 and g 1 . Our modification of the USO model improved the goodness-of-fit and reduced bias, enabling robust estimation of conductance parameters at any irradiance. In addition, our modification revealed previously undetectable relationships between the stomatal slope parameter g 1 and other leaf traits. We also observed nonlinear behavior between A and g sw in independent datasets that included data collected from attached and detached leaves, and from plants grown at elevated CO 2 concentration. We propose that this empirical modification of the USO model can improve the measurement of g sw parameters and the estimation of plant and ecosystem-scale water and CO 2 fluxes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Topology Optimization for Nonlinear Transient Applications Using a Minimally Invasive Approach (LDRD Final Report)

The purpose of this project was to devise, implement, and demonstrate a method that can use Sandia's existing analysis codes (e.g., Sierra, Alegra, the CTH hydro code) with minimal modification to generate objective function gradients for optimization-based design in transient, non-linear, coupled-physics applications. The approach uses a Moving Least Squares representation of the geometry to substantially reduce the number of geometric degrees of freedom. A Multiple-Program Multiple-Data computing model is then used to compute objective gradients via finite differencing. Details of the formulation and implementation are provided, and example applications are presented that show effectiveness and scalability of the approach.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

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↗
DOE OSTI2025

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multi-scale, Multi-disciplinary, and Multi-agent Explainable AI with Koopman-Undergirded Learning, Prediction, and Analysis (M3EA KULPA) (Project Closeout Report)

The goal of this project was to develop and use domain-aware machine learning formulations, based on the Koopman Operator (KO), for modelling multi-scale, multi-disciplinary (e.g., multi-physics), and/or multi-agent systems. The project developed these formulations for the following cases: • Systems with dynamics at two separate time scales, • Systems with a bi-level hierarchical control structure, • Systems with bi-level hierarchical control and dynamics at two separate time scales (the lower level controls operating at the faster time scale), and • Systems with n separate but interacting agents/disciplines (with/without control, respectively); the controls for each agent could include bi-level hierarchical control and dynamics at two separate time scales as described above. The project then defined a set of dynamical systems consisting of different nonlinear oscillators that could be used to test these different formulations and then subsequently learned the KO models for those systems. With the KO models, we were able to do the following: • Quantify system stability, including both long-term and transient behavior, • Quantify the effects of feedbacks between the different time scales and agents/disciplines in terms of those feedbacks’ effects on system stability, • Replace a standard Proportional-Integral (PI) control in the hierarchical control structure with a KO-based Linear-Quadratic Regular (LQR), a form of optimal control, • Calculate optimal supervisory control policies a) with and without time scale separated dynamics at the lower level control levels and b) with both PI and KO-based LQR lower level control policies, and • Calculate dynamic Nash equilibria for multi-agent systems where each agent makes its own control decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A new passivity-based nonlinear causal control technique for wave energy converters with finite stroke

A new technique is proposed for the design of nonlinear causal feedback controllers for wave energy converters, which explicitly protect against stroke saturation. Here, the technique is an improvement of a technique originally proposed. The primary challenge associated with the problem is the design of nonlinear controllers for which global closed-loop stability can be assured with probability 1 for stationary stochastic response, without also unduly sacrificing power generation performance. The proposed technique consists of three steps: 1) designing a linear feedback controller using multi-objective optimization techniques; 2) augmenting this design with an extra input channel that adheres to a closed-loop passivity condition; and 3) designing an outer, nonlinear passive feedback loop that controls this augmented input in such a way as to ensure stroke limits are maintained. The primary contribution of this paper is a fundamental improvement to the second of these steps, for which the previous technique was not guaranteed to return a valid solution. The proposed technique, by contrast, is shown to always produce a nonlinear controller with the desired properties, under very general modeling assumptions. The technique is illustrated on a simple heaving-buoy wave energy converter example.

16 TIDAL AND WAVE POWER↗
DOE OSTI2024

Third-integer Resonant Extraction Regulation System for Mu2e

A third-integer resonant slow extraction system is being developed for Fermilab's Delivery Ring to deliver protons to the upcoming Mu2e experiment. The timescale of the extraction (or spill) duration is 43 milliseconds, which is extremely short and unprecedented. Additionally, the experiment's strict and challenging requirements on the quality of the spill at this time scale has led to the development of a new Spill Regulation System (SRS) design. The SRS primarily consists of three components - slow regulation, fast regulation, and harmonic content suppressor. Contributions to the first two components of the SRS, i.e., Slow Regulation and Fast Regulation subsystems, will be presented in which new adaptive learning algorithm schemes for the slow regulation of the spill -- validated using particle tracking simulations -- shall be described. In addition to these novel methods for the enhancement of the spill regulation system, results of employing Machine Learning in enhancing the performance of the resonant extraction are also presented. At the forefront of applying ML techniques to solve non-linear accelerator control problems, this work includes optimizing the PID gains as well as the replacement of the traditional PID controller using Recurrent Neural Networks and Gated Recurrent Unit (GRU) ML models to achieve efficiencies greater than a PID controller. Cutting-edge on-going Reinforcement Learning efforts, including an actor-critic family of learning algorithms, to regulate the spill rate will be reviewed, as well as present analytical calculations pertaining the transit time of particles in a third-integer resonant extraction. Detailed numerical investigations and validations of such calculations, the model of which could be exported and reliably used in future analytical modeling of any resonant extraction, are discussed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2015

SU-E-J-126: An Online Replanning Method for FFF Beams Without Couch Shift

Purpose: In a situation that couch shift for patient positioning is not preferred or prohibited (e.g., MR-Linac), segment aperture morphing (SAM) can address target dislocation and deformation. For IMRT/VMAT with flattening filter free (FFF) beams, however, SAM method would lead to an adverse translational dose effect due to the beam unflattening. Here we propose a new 2-step process to address both the translational effect of FFF beams and the target deformation. Methods: The replanning method consists of an offline and an online steps. The offline step is to create a series of pre-shifted plans (PSP) obtained by a so called “warm start” optimization (starting optimization from the original plan, rather from scratch) at a series of isocenter shifts with fixed distance (e.g. 2 cm, at x,y,z = 2,0,0 ; 2,2,0 ; 0,2,0; …;− 2,0,0). The PSPs all have the same number of segments with very similar shapes, since the warm-start optimization only adjusts the MLC positions instead of regenerating them. In the online step, a new plan is obtained by linearly interpolating the MLC positions and the monitor units of the closest PSPs for the shift determined from the image of the day. This two-step process is completely automated, and instantaneously fast (no optimization or dose calculation needed). The previously-developed SAM algorithm is then applied for daily deformation. We tested the method on sample prostate and pancreas cases. Results: The two-step interpolation method can account for the adverse dose effects from FFF beams, while SAM corrects for the target deformation. The whole process takes the same time as the previously reported SAM process (5–10 min). Conclusion: The new two-step method plus SAM can address both the translation effects of FFF beams and target deformation, and can be executed in full automation requiring no additional time from the SAM process. This research was supported by Elekta inc. (Crawley, UK)

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Projective Integral Updates for High-Dimensional Variational Inference

Variational inference is an approximation framework for Bayesian inference that seeks to improve quantified uncertainty in predictions by optimizing a simplified distribution over parameters to stand in for the full posterior. Capturing model variations that remain consistent with training data enables more robust predictions by reducing parameter sensitivity. This work introduces a fixed-point optimization for variational inference that is applicable when every feasible log density can be expressed as a linear combination of functions from a given basis. In such cases, the optimizer becomes a fixed-point of projective integral updates. When the basis spans univariate quadratics in each parameter, the feasible distributions are Gaussian mean-fields and the projective integral updates yield quasi-Newton variational Bayes (QNVB). Other bases and updates are also possible. Since these updates require high-dimensional integration, this work begins by proposing an efficient quasirandom sequence of quadratures for mean-field distributions. Each iterate of the sequence contains two evaluation points that combine to correctly integrate all univariate quadratic functions and, if the mean-field factors are symmetric, all univariate cubics. More importantly, averaging results over short subsequences achieves periodic exactness on a much larger space of multivariate polynomials of quadratic total degree. The corresponding variational updates require four loss evaluations with standard (not second-order) backpropagation to eliminate error terms from over half of all multivariate quadratic basis functions. Furthermore, this integration technique is motivated by first proposing stochastic blocked mean-field quadratures, which may be useful in other contexts. A PyTorch implementation of QNVB allows for better control over model uncertainty during training than competing methods. Experiments demonstrate superior generalizability for multiple learning problems and architectures.

Gaussian mean-field↗
DOE OSTI2022

DISCOVR strain pipeline screening – Part II: Winter and summer season areal productivities and biomass compositional shifts in climate-simulation photobioreactor cultures

Assessing the seasonal biomass productivity and compositional shift dynamics under simulated outdoor culture conditions of the top 22 algae strains selected during Tier I flask screening is an important step in the further prioritization of strains with regard to outdoor pond cultivation. These top 22 strains were subjected to Tier II testing in the PNNL Laboratory Environmental Algae Pond Simulator (LEAPS) photobioreactors, simulating light and temperature conditions of 20 cm deep outdoor ponds during the Arizona winter and summer season. All strains were grown in two consecutive nutrient-replete batch culture experiments at their particular optimal medium salinity to quantify their respective seasonal linear-phase areal biomass productivities. To determine biomass compositional shifts in response to nutrient-depletion, the LEAPS cultures were allowed to enter a 9-day nutrient depletion phase at the end of the second batch run. The following strains were evaluated in winter-season climate-simulated cultures and are listed in the order from highest (7.9 g m -2 day -1 ) to lowest (2.3 g m -2 day -1 ) areal N-replete biomass productivity: Monoraphidium minutum 26B-AM, Tetraselmis striata LANL1001, Chlorella vulgaris LRB AZ-1201, Micractinium reisseri NREL14-F2, Monoraphidium sp. MONOR1, Chlorella vulgaris NREL4-C12, Scenedesmus obliquus UTEX393, Scenedesmus acutus LRB-AP-0401, Nannochloropsis oceanica CCAP849/10, and Stichococcus minutus CCALA727. The following strains were evaluated in summer-season climate-simulated cultures and are listed in the order from highest (31.8 g m -2 day -1 ) to lowest (14.2 g m -2 day -1 ) areal N-replete biomass productivity: Picochlorum renovo NREL39-A8, Scenedesmus obliquus UTEX393, Porphyridium cruentum CCMP675, Picochlorum celeri TG2-WT-CSM/EMRE, Chlorella sorokiniana DOE1116, Stichococcus minor CCMP819, Picochlorum oklahomensis CCMP2329, Chlorella sorokiniana DOE1412 (UTEXB3016), Scenedesmus rubescens NREL46B-D3, Picochlorum soloecismus DOE101, Tetraselmis striata LANL1001, Scenedesmus obliquus DOE 0152.z, and Agmenellum quadruplicatum UTEX2268. All LEAPS cultures experienced a significant reduction in areal biomass productivity in response to nutrient-depletion, from 7-16% in the winter season simulation and up to 1-60% in the summer season simulation. Finally, for 10 of the strains tested, the carbohydrate content more than doubled upon nutrient depletion, and for 9 strains, the lipid content increased by over 50% of the initial content.

09 BIOMASS FUELS↗
DOE OSTI2019

Multidimensional sum-up rounding for integer programming in optimal experimental design

Here we present a numerical method for approximating the solution of convex integer programs stemming from optimal experimental design. The statistical setup consists of a Bayesian framework for linear inverse problems for which the direct relationship is described by a discretized integral equation. Specifically, we aim to find the optimal sensor placement from a set of candidate locations where data are collected with measurement error. The convex objective function is a measure of the uncertainty, described here by the trace or log-determinant of the posterior covariance matrix, for the discretized linear inverse problem solution. The resulting convex integer program is relaxed, producing a lower bound. An upper bound is obtained by extending the sum-up rounding approach to multiple dimensions. For this extension, we analyze its accuracy as a function of the discretization mesh size for a rectangular domain. We show asymptotic optimality of the integer solution defining the upper bound for different experimental design criteria (A- and D-optimal), by proving the convergence to zero of the gap between the upper and lower bounds as the mesh size goes to zero. The technique is illustrated on a two-dimensional gravity surveying problem for both A-optimal and D-optimal sensor placement where our designs yield better results compared with a thresholding rounding approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Switching Device-Cognizant Sequential Distribution System Restoration

This paper presents an optimization framework for sequential reconfiguration using an assortment of switching devices and repair process in distribution system restoration. Compared to existing studies, this paper considers types, capabilities and operational limits of different switching devices, making it applicable in practice. We develop a novel multi-phase method to find the optimal sequential operation of various switching devices and repair faulted areas. We consider circuit breakers, reclosers, sectionalizers, load breaker switches, and fuses. The switching operation problem is decomposed into two mixed-integer linear programming (MILP) subproblems. The first subproblem determines the optimal network topology and estimates the number of steps to reach that topology, while the second subproblem generates a sequence of switching operations to coordinate the switches. For repairing the faults, we design an MILP model that dispatches repair crews to clear faults and replace melted fuses. After clearing a fault, we update the topology of the network by generating a new sequence of switching operations, and the process continues until all faults are cleared. To improve the computational efficiency, a network reduction algorithm is developed to group line sections, such that only switchable sections are present in the reduced network. The proposed method is validated on the IEEE 123-bus and 8500-bus systems.

distribution system↗
DOE OSTI2024

Grid-Aware Charging and Operational Optimization for Mixed-Fleet Public Transit

The rapid growth of urban populations and the increasing need for sustainable transportation solutions have prompted a shift towards electric buses in public transit systems. However, the effective management of mixed fleets consisting of both electric and diesel buses poses significant operational challenges. One major challenge is coping with dynamic electricity pricing, where charging costs vary throughout the day. Transit agencies must optimize charging assignments in response to such dynamism while accounting for secondary considerations such as seating constraints. This paper presents a comprehensive mixed-integer linear programming (MILP) model to address these challenges by jointly optimizing charging schedules and trip assignments for mixed (electric and diesel bus) fleets while considering factors such as dynamic electricity pricing, vehicle capacity, and route constraints. We address the potential computational intractability of the MILP formulation, which can arise even with relatively small fleets, by employing a hierarchical approach tailored to the fleet composition. By using real-world data from the city of Chattanooga, Tennessee, USA, we show that our approach can result in significant savings in the operating costs of the mixed transit fleets.

Sen, Rishav↗
DOE OSTI2015

SU-E-T-96: An Analysis of VMAT SBRT Lung Treatment Plans

Purpose: To present an analysis of 218 lung sbrt treatment plans delivered using Varian Eclipse RapidArc software and delivered with Varian linear accelerators. Methods: A retrospective analysis of treatment plans generated using the Varian Eclipse PRO RapidArc VMAT optimization and AAA photon beam calculation algorithms was done for 218 plans delivered using Varian Trilogy and TrueBeam linear accelerators. Some of the patients were enrolled in the RTOG 0813 and RTOG 0915 lung protocols. All of the patients’ plans were optimized using the guidelines outlined by these protocols. The plans presented were normalized so that 95% of the PTV volume received 100% of the prescribed dose. Results: The dose co formality constraints from the RTOG protocols and the number of plans within those constraints were:Tumor dose between 60% of maximum dose and 90% of maximum: 218/218 = 100%.Volume of 105% tumor dose outside put less than 15% of the PTV volume: 218/218 = 100%.Maximum dose 2 cm away from PTV within protocol table guidelines: No minor deviation: 188/218 = 86.2%. No major deviation: 216/218 = 99.1%.Ratio of 50% dose volume to PTV volume less than R50 in protocol table: No minor deviation 148/218 = 67.9%. No major deviation: 213/218 = 97.7%.Percent of lung receiving 20 Gy less than 10% (no minor violation): 218/218 = 100%.99% of PTV receiving at least 90% of the tumor dose: 214/218 = 98.2%. Conclusion: Varian RapidArc VMAT can successfully deliver lung SBRT treatments as outlined in the RTOG 0813 and 0915 protocols. The largest deviations were seen in the R50 constraints for the larger PTV volumes.

60 APPLIED LIFE SCIENCES↗