Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 883 records · Page 49

Development and clinical evaluation of an ionization chamber array with 3.5 mm pixel pitch for quality assurance in advanced radiotherapy techniques

Purpose: To characterize a new air vented ionization chamber technology, suitable to build detector arrays with small pixel pitch and independence of sensitivity on dose per pulse. Methods: The prototype under test is a linear array of air vented ionization chambers, consisting of 80 pixels with 3.5 mm pixel pitch distance and a sensitive volume of about 4 mm{sup 3}. The detector has been characterized with {sup 60}Co radiation and MV x rays from different linear accelerators (with flattened and unflattened beam qualities). Sensitivity dependence on dose per pulse has been evaluated under MV x rays by changing both the source to detector distance and the beam quality. Bias voltage has been varied in order to evaluate the charge collection efficiency in the most critical conditions. Relative dose profiles have been measured for both flattened and unflattened distributions with different field sizes. The reference detectors were a commercial array of ionization chambers and an amorphous silicon flat panel in direct conversion configuration. Profiles of dose distribution have been measured also with intensity modulated radiation therapy (IMRT), stereotactic radiosurgery (SRS), and volumetric modulated arc therapy (VMAT) patient plans. Comparison has been done with a commercial diode array and with Gafchromic EBT3 films. Results: Repeatability and stability under continuous gamma irradiation are within 0.3%, in spite of low active volume and sensitivity (∼200 pC/Gy). Deviation from linearity is in the range [0.3%, −0.9%] for a dose of at least 20 cGy, while a worsening of linearity is observed below 10 cGy. Charge collection efficiency with 2.67 mGy/pulse is higher than 99%, leading to a ±0.9% sensitivity change in the range 0.09–2.67 mGy/pulse (covering all flattened and unflattened beam qualities). Tissue to phantom ratios show an agreement within 0.6% with the reference detector up to 34 cm depth. For field sizes in the range 2 × 2 to 15 × 15 cm{sup 2}, the output factors are in agreement with a thimble chamber within 2%, while with 25 × 25 cm{sup 2} field size, an underestimation of 4.0% was found. Agreement of field and penumbra width measurements with the flat panel is of the order of 1 mm down to 1 × 1 cm{sup 2} field size. Flatness and symmetry values measured with the 1D array and the reference detectors are comparable, and differences are always smaller than 1%. Angular dependence of the detector, when compared to measurements taken with a cylindrical chamber in the same phantom, is as large as 16%. This includes inhomogeneity and asymmetry of the design, which during plan verification are accounted for by the treatment planning system (TPS). The detector is capable to reproduce the dose distributions of IMRT and VMAT plans with a maximum deviation from TPS of 3.0% in the target region. In the case of VMAT and SRS plans, an average (maximum) deviation of the order of 1% (4%) from films has been measured. Conclusions: The investigated technology appears to be useful both for Linac QA and patient plan verification, especially in treatments with steep dose gradients and nonuniform dose rates such as VMAT and SRS. Major limitations of the present prototype are the linearity at low dose, which can be solved by optimizing the readout electronics, and the underestimation of output factors with large field sizes. The latter problem is presently not completely understood and will require further investigations.

60 APPLIED LIFE SCIENCES↗

Optimal Design of Food Packaging Considering Waste Management Technologies to Achieve Circular Economy

Plastic packaging plays a fundamental role in the food industry, avoiding food waste and facilitating food access. The increasing plastic production and the lack of appropriate plastic waste management technologies represent a threat to the environmental and human welfare. Therefore, there is an urgent need to identify sustainable packaging solutions. Circular economy (CE) promotes reducing waste and increasing recycling practices to achieve sustainability. In this work, we propose a CE framework based on multi-objective optimization, considering both economic and environmental impacts, to identify optimal packaging designs and waste management technologies. Using mixed-integer linear programming (MILP), techno-economic analysis (TEA), and life cycle assessment (LCA), this work aims to build the first steps in packaging design, informing about the best packaging alternatives and the optimal technology or technologies to process packaging waste. For the economic analysis, we consider the minimum increase in price (MIP) when adding recycling to the cost of each packaging solution, while for the environmental analysis, the greenhouse gas emissions impact was considered. A case study on ground coffee packaging is used to illustrate the proposed framework. The results demonstrate that the multilayer bag option is the most convenient when considering both the chosen economic and environmental impacts.

Life Cycle Analysis↗

Studies of Front-End Electronics for High-Precision Timing Measurements with LGADs [Poster]

In Time-of-Arrival (ToA) measurements, simulations can be used to optimize precision detection and implementation methods of front-end electronics. The simulation tested in this project takes the response of a filter (in the s-domain) from a noisy input current signal from the detector, an LGAD (Low-Gain Avalanche Diode), and uses a threshold to determine the ToA value for the signal. Measuring the ToA values for a large sample of events and comparing them to a reference statistically produces the timing precision of the simulation. Here, the sub-algorithm to model LGAD events with piecewise linear (PWL) approximations (for more efficient Laplace transforms) was optimized. Using the Fourier Discrete Cosine Transform, 25 points could be selected to describe the primary behavior of the signal. Results showed that timing precision is on par with previous methods. We also found that the new algorithm is faster and equally consistent in producing accurate PWL approximations. Testi ng with larger samples is required to fully verify the new algorithm.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Path optimization by a variational reaction coordinate method. I. Development of formalism and algorithms

The development of algorithms to optimize reaction pathways between reactants and products is an active area of study. Existing algorithms typically describe the path as a discrete series of images (chain of states) which are moved downhill toward the path, using various reparameterization schemes, constraints, or fictitious forces to maintain a uniform description of the reaction path. The Variational Reaction Coordinate (VRC) method is a novel approach that finds the reaction path by minimizing the variational reaction energy (VRE) of Quapp and Bofill. The VRE is the line integral of the gradient norm along a path between reactants and products and minimization of VRE has been shown to yield the steepest descent reaction path. In the VRC method, we represent the reaction path by a linear expansion in a set of continuous basis functions and find the optimized path by minimizing the VRE with respect to the linear expansion coefficients. Improved convergence is obtained by applying constraints to the spacing of the basis functions and coupling the minimization of the VRE to the minimization of one or more points along the path that correspond to intermediates and transition states. The VRC method is demonstrated by optimizing the reaction path for the Müller-Brown surface and by finding a reaction path passing through 5 transition states and 4 intermediates for a 10 atom Lennard-Jones cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Calibrating transition-metal energy levels and oxygen bands in first-principles calculations: Accurate prediction of redox potentials and charge transfer in lithium transition-metal oxides

Transition-metal (TM) oxides play an increasingly important role in technology today, including applications such as catalysis, solar energy harvesting, and energy storage. In many of these applications, the details of their electronic structure near the Fermi level are critically important for their properties. We propose a first-principles–based computational methodology for the accurate prediction of oxygen charge transfer in TM oxides and lithium TM (Li-TM) oxides. To obtain accurate electronic structures, the Heyd-Scuseria-Ernzerhof (HSE06) hybrid functional is adopted, and the amount of exact Hartree-Fock exchange (mixing parameter) is adjusted to reproduce reference band gaps. We show that the HSE06 functional with optimal mixing parameter yields not only improved electronic densities of states, but also better energetics (Li-intercalation voltages) for LiCoO 2 and LiNiO 2 as compared to the generalized gradient approximation (GGA), Hubbard U corrected GGA (GGA + U), and standard HSE06. We find that the optimal mixing parameters for TM oxides are system specific and correlate with the covalency (ionicity) of the TM species. The strong covalent (ionic) nature of TM-O bonding leads to lower (higher) optimal mixing parameters. We find that optimized HSE06 functionals predict stronger hybridization of the Co 3d and O 2p orbitals as compared to GGA, resulting in a greater contribution from oxygen states to charge compensation upon delithiation in LiCoO 2 . We also find that the band gaps of Li-TM oxides increase linearly with the mixing parameter, enabling the straightforward determination of optimal mixing parameters based on GGA (α = 0.0) and HSE06 (α = 0.25) calculations. Our results also show that G 0 W 0 @ GGA + U band gaps of TM oxides ( M O , M = Mn , Co , Ni ) and LiCoO 2 agree well with experimental references, suggesting that G 0 W 0 calculations can be used as a reference for the calibration of the mixing parameter in cases when no experimental band gap has been reported.

36 MATERIALS SCIENCE↗

Reducing the Time to Tune Parallel Dense Linear Algebra Routines with Partial Execution and Performance Modeling

We present a modeling framework to accurately predict time to run dense linear algebra calculation. We report the framework’s accuracy in a number of varied computational environments such as shared memory multicore systems, clusters, and large supercomputing installations with tens of thousands of cores. We also test the accuracy for various algorithms, each of which having a different scaling properties and tolerance to low-bandwidth/high-latency interconnects. The predictive accuracy is very good and on the order of measurement accuracy which makes the method suitable for both dedicated and non-dedicated environments. We also present a practical application of our model to reduce the time required to tune and optimize large parallel runs whose time is dominated by linear algebra computations. We show practical examples of how to apply the methodology to avoid common pitfalls and reduce the influence of measurement errors and the inherent performance variability.

Linear systems↗

Notes from the Unit Commitment Linear Programming Project

The Unit Commitment Problem (UCP) is a computational bottleneck in electrical grid optimization. The problem bears a close resemblance to a similar problem in High Performance Computing: the Dynamic Volt age/Frequency Scheduling (DVFS) problem. In my earlier work I successfully tranformed the DVFS into a closely related problem amenable to a linear programming solution and was thus able to schedule problem instances several orders of magnitude larger than any that had been at tempted before. This technical report details my unsuccessful efforts to derive a similar transformation for the UCP. The problem proved impossible not because generators were either on or off, but because the state of an earlier timeslice constrains the states of latter timeslices in ways that cannot be sufficiently well approximated for useful solutions.

97 MATHEMATICS AND COMPUTING↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

Learning Provably Stable Local Volt/Var Controllers for Efficient Network Operation

Here this paper develops a data-driven framework to synthesize local Volt/Var control strategies for distributed energy resources (DERs) in power distribution grids (DGs). Aiming to improve DG operational efficiency, as quantified by a generic optimal reactive power flow (ORPF) problem, we propose a two-stage approach. The first stage involves learning the manifold of optimal operating points determined by an ORPF instance. To synthesize local Volt/Var controllers, the learning task is partitioned into learning local surrogates (one per DER) of the optimal manifold with voltage input and reactive power output. Since these surrogates characterize efficient DG operating points, in the second stage, we develop local control schemes that steer the DG to these operating points. We identify the conditions on the surrogates and control parameters to ensure that the locally acting controllers collectively converge, in a global asymptotic sense, to a DG operating point agreeing with the local surrogates. We use neural networks to model the surrogates and enforce the identified conditions in the training phase. AC power flow simulations on the IEEE 37-bus network empirically bolster the theoretical stability guarantees obtained under linearized power flow assumptions. The tests further highlight the optimality improvement compared to prevalent benchmark methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automated control and optimization of laser-driven ion acceleration

The interaction of relativistically intense lasers with opaque targets represents a highly non-linear, multi-dimensional parameter space. This limits the utility of sequential 1D scanning of experimental parameters for the optimization of secondary radiation, although to-date this has been the accepted methodology due to low data acquisition rates. High repetition-rate (HRR) lasers augmented by machine learning present a valuable opportunity for efficient source optimization. Here, an automated, HRR-compatible system produced high-fidelity parameter scans, revealing the influence of laser intensity on target pre-heating and proton generation. A closed-loop Bayesian optimization of maximum proton energy, through control of the laser wavefront and target position, produced proton beams with equivalent maximum energy to manually optimized laser pulses but using only 60% of the laser energy. This demonstration of automated optimization of laser-driven proton beams is a crucial step towards deeper physical insight and the construction of future radiation sources.

47 OTHER INSTRUMENTATION↗

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗

Variational design principles for nonequilibrium colloidal assembly

Using large deviation theory and principles of stochastic optimal control, we show that rare molecular dynamics trajectories conditioned on assembling a specific target structure encode a set of interactions and external forces that lead to enhanced stability of that structure. Such a relationship can be formulated into a variational principle, for which we have developed an associated optimization algorithm and have used it to determine optimal forces for targeted self-assembly within nonequilibrium steady-states. We illustrate this perspective on inverse design in a model of colloidal cluster assembly within linear shear flow. We find that colloidal clusters can be assembled with high yield using specific short-range interactions of tunable complexity. Shear decreases the yields of rigid clusters, while small values of shear increase the yields of nonrigid clusters. The enhancement or suppression of the yield due to shear is rationalized with a generalized linear response theory. Furthermore, by studying 21 unique clusters made of six, seven, or eight particles, we uncover basic design principles for targeted assembly out of equilibrium.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PDE-constrained Optimization under Uncertainty

Uncertainty is pervasive in all science and engineering applications. Incorporating uncertainty in physical models is therefore both natural and vital. In doing so, we often arrive at parametric systems of partial differential equations (PDEs). When passing from simulation to optimization, we obtain (typically nonconvex) infinite-dimensional optimization problems that, upon discretization, result in extremely large-scale nonlinear programs. For example, consider a linear elliptic PDE on a two- dimensional domain with a single random coeffcient. If we sampled the random input with 10,000 realizations of the coeffcient, the resulting optimization problem would have 10,000 PDE constraints. Furthermore, discretizing each PDE with piecewise linear finite elements on a 100X100 uni- form quadrilateral mesh results in 100,000,000 degrees of freedom. As a result, the critical components for ensuring mesh-independent performance of numerical optimization methods in the deterministic setting, for example, solution regularity and generalized differentiability, are even more critical in the stochastic setting.

42 ENGINEERING↗

A MILP-Based Distribution Optimal Power Flow Model for Microgrid Operation

This paper proposes a distribution optimal power flow (D-OPF) model for the operation of microgrids. The proposed model minimizes not only the operating cost, including fuel cost, purchasing cost and demand charge, but also several performance indices, including voltage deviation, network power loss and power factor. It co-optimizes the real and reactive power form distributed generators (DGs) and batteries considering their capacity and power factor limits. The D-OPF is formulated as a mixed-integer linear programming (MILP). Numerical simulation results show the effectiveness of the proposed model.

distributed generators↗

Overhead longwave infrared hyperspectral material identification using radiometric models

Material detection algorithms used in hyperspectral data processing are computationally efficient but can produce relatively high numbers of false positives. Material identification performed as a secondary processing step on detected pixels can help mitigate false positives. A material identification processing chain for longwave infrared hyperspectral data of solid materials collected from airborne platforms is presented. The algorithms utilize unwhitened radiance data and Nelder–Meade numerical optimization to estimate the temperature, humidity, and ozone levels of the atmospheric profile. Pixel unmixing is done using constrained linear regression and Bayesian information criteria for model selection. The resulting identification product includes an optimal atmospheric profile and a full radiance material model that includes material temperature, abundance values, and several fit statistics. A logistic regression method utilizing the model parameters to improve identification is also presented. Furthermore, several examples are provided using modeled data at several noise levels.

58 GEOSCIENCES↗

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

59 BASIC BIOLOGICAL SCIENCES↗

Towards Reconstruction of Complex Flow Fields Using Unit Flows

Many complex turbulent flows in nature and engineering can be qualitatively regarded as being constituted of multiple simpler unit flows. The objective of this work is to characterize the coherent structures in such complex flows as a combination of constituent unitary flow structures for the purpose of reduced-order representation. While turbulence is clearly a non-linear phenomenon, we aim to establish the degree to which the optimally weighted superposition of unitary flow structures can represent the complex flow structures. The rationale for investigating such superposition stems from the fact that the large-scale coherent structures are generated by underlying flow instabilities that may be reasonably described using linear analysis. Clearly, the degree of validity of superposition will depend on the flow under consideration. In this work, we take the first step toward establishing a procedure for investigating superposition. Experimental data of single and triple tandem jets in crossflow are used to demonstrate the procedure. A composite triple tandem jet flow field is generated from optimal superposition of single jet data and compared against ‘true’ triple jet data. Direct comparisons between the true and composite fields are made for spatial, temporal, and kinetic energy content. The large-scale features (obtained from proper orthogonal decomposition or POD) of true and composite tandem jet wakes exhibit nearly 70% agreement in terms of modal eigenvector correlation. Corresponding eigenvalues reveal that the kinetic energy of the flow is also emulated with only a slight overprediction. Temporal frequency features are also examined in an effort to completely characterize POD modes. The proposed method serves as a foundation for more rigorous and robust dimensional reduction in complex flows based on unit flow modes.

Kristo, Paul J.↗