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 199 records · Page 11

Optimal mode transformations for linear-optical cluster-state generation

In this paper, we analyze the generation of linear-optical cluster states (LOCSs) via sequential addition of one and two qubits. Existing approaches employ the stochastic linear-optical two-qubit controlled-Z (CZ) gate with success rate of 1/9 per operation. The question of optimality of the CZ gate with respect to LOCS generation has remained open. We report that there are alternative schemes to the CZ gate that are exponentially more efficient and show that sequential LOCS growth is indeed globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. Finally, we show that the maximal success rate of postselected entangling n photonic qubits or m Bell pairs into a cluster is (1/2) n-1 and (1/4) m-1 , respectively, with no ancilla photons, and we give an explicit optical description of the optimal mode transformations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Start-up Optimization Considering Integrated Power Electronic Systems

The startup of systems composed of power electronic systems is becoming more complex. As the systems grow, standard pre-configuration sequencing methods will struggle. This work proposes a linear programming optimization method to couple power electronic systems in a series of startup commands. This formulation is demonstrated in a real-time implementation on hardware.

Starke, Michael↗

An adjoint method for neoclassical stellarator optimization

Stellarators remain an enticing route to steady-state fusion power. However, to achieve the required confinement, the magnetic geometry must be highly optimized. This optimization requires navigating high-dimensional spaces, often necessitating the use of gradient-based methods. The gradient of the neoclassical fluxes is expensive to compute with classical methods, requiring $O(N)$ flux computations, where $N$ is the number of parameters. To reduce the cost of the gradient computation, we present an adjoint method for computing the derivatives of moments of the neoclassical distribution function for stellarator optimization. The linear adjoint method allows derivatives of quantities which depend on solutions of a linear system, such as moments of the distribution function, to be computed with respect to many parameters from the solution of only two linear systems. This reduces the cost of computing the gradient to the point that the finite-collisionality neoclassical fluxes can be used within an optimization loop. With the neoclassical adjoint method, we compute solutions of the drift kinetic equation and an adjoint drift kinetic equation to obtain derivatives of neoclassical quantities with respect to geometric parameters. When the number of parameters in the derivative is large ( $O(10^{2})$ ), this adjoint method provides up to a factor of 200 reduction in cost. We demonstrate adjoint-based optimization of the field strength to obtain minimal bootstrap current on a surface. With adjoint-based derivatives, we also compute the local sensitivity to magnetic perturbations on a flux surface and identify regions where tight tolerances on error fields are required for control of the bootstrap current or radial transport. Moreover, the solve for the ambipolar electric field is accelerated using a Newton method with derivatives obtained from the adjoint method.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optically resonant magneto-electric cubic nanoantennas for ultra-directional light scattering

Cubic dielectric nanoparticles are promising candidates for futuristic low-loss, ultra-compact, nanophotonic applications owing to their larger optical coefficients, greater packing density, and relative ease of fabrication as compared to spherical nanoparticles; besides possessing negligible heating at nanoscale in contrast to their metallic counterparts. Here, we present the first theoretical demonstration of azimuthally symmetric, ultra-directional Kerker's-type scattering of simple dielectric nanocubes in visible and near-infrared regions via simultaneous excitation and interference of optically induced electric- and magnetic-resonances up to quadrupolar modes. Unidirectional forward-scattering by individual nanocubes is observed at the first generalized-Kerker's condition for backward-scattering suppression, having equal electric- and magnetic-dipolar responses. Both directionality and magnitude of these unidirectional-scattering patterns get enhanced where matching electric- and magnetic-quadrupolar responses spectrally overlap. While preserving azimuthal-symmetry and backscattering suppression, a nanocube homodimer provides further directionality improvement for increasing interparticle gap, but with reduced main-lobe magnitude due to emergence of side-scattering lobes from diffraction-grating effect. We thoroughly investigate the influence of interparticle gap on scattering patterns and propose optimal range of gap for minimizing side-scattering lobes. Besides suppressing undesired side-lobes, significant enhancement in scattering magnitude and directionality is attained with increasing number of nanocubes forming a linear chain. Optimal directionality, i.e., the narrowest main-scattering lobe, is found at the wavelength of interfering quadrupolar resonances; whereas the largest main-lobe magnitude is observed at the wavelength satisfying the first Kerker's condition. These unique optical properties of dielectric nanocubes thus can revolutionize their applications at visible and near-infrared regions in the fields of nanoantennas, nanolasers, photovoltaics, and even in biomedicine.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗

EnergyPlus Interior Radiant Heat Exchange Runtime Performance Improvements

EnergyPlus is the flagship whole-building energy simulation program developed by the US Department of Energy. This paper describes the various approaches to improve the performance of the interior radiant heat exchange algorithm. Vectorization, optimized Basic Linear Algebra Subprograms (BLAS) library, multithreading, and Graphical Processing Unit (GPU) computation are all investigated. The approach with the best performance, while maintaining drop-in compatibility with existing EnergyPlus code, is the optimized BLAS library. However, GPU computing has the potential to reduce simulation time by orders of magnitude with major refactoring to EnergyPlus.

Adams, Mark↗

Parallelized POD-based suboptimal economic model predictive control of a state-constrained Boussinesq approximation

Motivated by an energy efficient building application, we want to optimize a quadratic cost functional subject to the Boussinesq approximation of the Navier-Stokes equations and to bilateral state and control constraints. Since the computation of such an optimal solution is numerically costly, we design an efficient strategy to compute a sub-optimal (but applicationally acceptable) solution with significantly reduced computational effort. We employ an economic Model Predictive Control (MPC) strategy to obtain a feedback control. The MPC sub-problems are based on a linear-quadratic optimal control problem subjected to mixed control and state constraints and a convection-diffusion equation, reduced with proper orthogonal decomposition. Finally, to solve each sub-problem, we apply a primal-dual active set strategy. The method can be fully parallelized, which enables the solution of large problems with real-world parameters.

97 MATHEMATICS AND COMPUTING↗

Multiphase Optimal and Non-Singular Power Flow by Successive Linear Approximations: Preprint

We propose an optimal power flow method for multiphase power systems. The method works for both radial and meshed networks, and is able to accommodate different types of load/source connections such as wye, delta, etc. Moreover, the method generates a sequence of non-singular points in the electrical state space and a corresponding sequence of power injections, which can be used in real-time control settings. Under certain conditions, the sequences attain the local minimum. The method has been tested using several typical networks, including the IEEE 37-bus and 123-bus test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multigrid preconditioning of linear systems for semi-smooth Newton methods applied to optimization problems constrained by smoothing operators

This article is concerned here with the question of constructing efficient multigrid preconditioners for the linear systems arising when applying semi-smooth Newton methods to large-scale linear-quadratic optimization problems constrained by smoothing operators with box-constraints on the controls. It is shown that, for certain discretizations of the optimization problem, the linear systems to be solved at each semi-smooth Newton iteration reduce to inverting principal minors of the Hessian of the associated unconstrained problem. As in the case when box-constraints on the controls are absent, the multigrid preconditioner introduced here is shown to increase in quality as the mesh-size decreases, resulting in a number of iterations that decreases with mesh-size. However, unlike the unconstrained case, the spectral distance between the preconditioners and the Hessian is shown to be of suboptimal order in general.

97 MATHEMATICS AND COMPUTING↗

Numerical optimization of three-dimensional coils for NSTX-U

A tool for the calculation of optimal three-dimensional (3D) perturbative magnetic fields in tokamaks has been developed. The IPECOPT code builds upon the stellarator optimization code STELLOPT to allow for optimization of linear ideal magnetohydrodynamic perturbed equilibrium (IPEC). This tool has been applied to NSTX-U equilibria, addressing which fields are the most effective at driving NTV torques. The NTV torque calculation is performed by the PENT code. Optimization of the normal field spectrum shows that fields with n = 1 character can drive a large core torque. It is also shown that fields with n = 3 features are capable of driving edge torque and some core torque. Coil current optimization (using the planned in-vessel and existing RWM coils) on NSTX-U suggest the planned coils set is adequate for core and edge torque control. In conclusion, comparison between error field correction experiments on DIII-D and the optimizer show good agreement.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders

Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the reduced-basis method, and (balanced) proper orthogonal decomposition (POD). Unfortunately, restricting the state to evolve in a linear subspace imposes a fundamental limitation to the accuracy of the resulting reduced-order model (ROM). In particular, linear-subspace ROMs can be expected to produce low-dimensional models with high accuracy only if the problem admits a fast decaying Kolmogorov n -width (e.g., diffusion-dominated problems). Unfortunately, many problems of interest exhibit a slowly decaying Kolmogorov n-width (e.g., advection-dominated problems). To address this, we propose a novel framework for projecting dynamical systems onto nonlinear manifolds using minimum-residual formulations at the time-continuous and time-discrete levels; the former leads to manifold Galerkin projection, while the latter leads to manifold least-squares Petrov–Galerkin (LSPG) projection. We perform analyses that provide insight into the relationship between these proposed approaches and classical linear-subspace reduced-order models; we also derive a posteriori discrete-time error bounds for the proposed approaches. In addition, we propose a computationally practical approach for computing the nonlinear manifold, which is based on convolutional autoencoders from deep learning. Lastly, we demonstrate the ability of the method to significantly outperform even the optimal linear-subspace ROM on benchmark advection-dominated problems, thereby demonstrating the method's ability to overcome the intrinsic n -width limitations of linear subspaces.

97 MATHEMATICS AND COMPUTING↗

Linear model decision trees as surrogates in optimization of engineering applications

Machine learning models are promising as surrogates in optimization when replacing difficult to solve equations or black-box type models. This work demonstrates the viability of linear model decision trees as piecewise-linear surrogates in decision-making problems. Linear model decision trees can be represented exactly in mixed-integer linear programming (MILP) and mixed-integer quadratic constrained programming (MIQCP) formulations. Furthermore, they can represent discontinuous functions, bringing advantages over neural networks in some cases. We present several formulations using transformations from Generalized Disjunctive Programming (GDP) formulations and modifications of MILP formulations for gradient boosted decision trees (GBDT). We then compare the computational performance of these different MILP and MIQCP representations in an optimization problem and illustrate their use on engineering applications. Importantly, we observe faster solution times for optimization problems with linear model decision tree surrogates when compared with GBDT surrogates using the Optimization and Machine Learning Toolkit (OMLT).

42 ENGINEERING↗

Dynamic Optimal Dispatch of Energy Systems with Intermittent Renewables and Damage Model

With the increasing penetration of intermittent renewable energy sources into the grid, there is a growing need for process systems-based strategies that integrate dispatchable and variable energy systems for supplying the demand while maintaining grid reliability. The proposed framework corresponds to a dynamic mixed-integer linear programming optimization approach that integrates coal-fired and natural gas-fired power plants, NaS batteries for energy storage, and solar/wind energy to supply the demand. This optimization approach considers an economic goal and constraints to provide power balance while maintaining the overall damage of the natural gas combined cycle (NGCC) power plant drum under a maximum stress as well as avoiding the overheating of the NGCC superheater and reheater. Renewable curtailment levels are also retained at minimum levels. Case studies are analyzed considering different loads and renewable penetration levels. The results show that the demand was met for all cases. Grid flexibility was mostly provided by the NGCC, while the batteries were used sparingly. In addition, considering a CO 2 equivalent analysis, the environmental performance was intrinsically connected to grid flexibility and the level of renewable penetration. Stress analysis results reinforced the necessity for an equipment health-related constraint.

97 MATHEMATICS AND COMPUTING↗

Efficient BiVO 4 /CoFeO x H y photoanodes using controlled annealing and conformal linear-sweep electrocatalyst photodeposition

Although monoclinic bismuth vanadate (BiVO 4 ) is a promising photoanode for solar water splitting, its practical use is hindered by imperfect photocurrent generation/collection, low photovoltage compared to the bandgap, and corrosion side reactions that limit durability. Here, we introduce a controlled-annealing sol–gel process for BiVO 4 thin-film photoanodes along with an optimized linear-sweep-voltammetry photodeposition of CoFeO x H y cocatalysts. The resulting BiVO 4 films annealed at 550 °C exhibited a photocurrent density of 4.1 mA/cm 2 at 1.23 V RHE under 1 sun AM 1.5G solar simulation and a low onset potential of 0.26 V RHE due to high majority carrier conductivity, a crystalline bulk with reduced defects as evidenced by x-ray photoelectron spectroscopy and photoluminescence lifetime analysis, and thus enhanced photocarrier collection. However, significant degradation in performance was found due to interfacial photocorrosion. To protect the surface and speed the oxygen-evolution reaction CoFeO x H y cocatalyst layers were deposited. By varying the number of consecutive sweeps and adjusting the applied bias range, an ultra-thin (~15 nm) CoFeO x H y cocatalyst layer was uniformly grown deposited over 30 cycles on the BiVO 4 surface. The resulting BiVO 4 /CoFeO x H y yielded 4.03 mA/cm 2 at 1.23 V RHE and onset potential of 0.24 V RHE , with stable operation (~15 % loss in photocurrent at 1.23 V RHE relative to ~60 % loss in the uncatalyzed control sample). These conformal CoFeO x H y catalytic layers function simultaneously to selectively collect photoexcited holes from the BiVO 4 , catalyze the water-oxidation reaction, and protect the BiVO 4 from photodegradation.

42 ENGINEERING↗

Nonlinear control of the minimum safety factor in tokamaks by optimal allocation of spatially moving electron cyclotron current drive

The minimum value of the safety factor profile is related to the magnetohydrodynamic (MHD) stability of the plasma confined in a tokamak. Therefore, active control of the minimum safety factor may mitigate MHD instabilities that can degrade or even terminate plasma confinement. Typically, in most tokamak scenarios, the minimum safety factor evolves spatially with time, i.e., the location at which the safety factor achieves the minimum value changes with time. In addition to the inherent nonlinearities in the minimum safety factor evolution, its spatial variation makes the control design challenging. In particular, complexity in control design may arise from the need for time-dependent nonlinear models that account for spatial variation of the minimum safety factor. Furthermore, the minimum safety factor may drift to locations where the actuator authority is low. The problem of minimum safety factor control with target location tracking and moving electron cyclotron current drive (ECCD) is addressed in this work. A nonlinear time-dependent model that incorporates the spatial variation of the minimum safety factor is presented. A nonlinear controller based on optimal feedback linearization is developed to track a target minimum safety factor. The proposed controller treats the ECCD position as a controllable variable. In other words, the controller prescribes the ECCD position (in addition to the non-inductive powers) in real time based on an optimal criterion that is defined a priori. This work also presents the steps necessary to integrate the minimum safety factor controller with a total energy controller to achieve multiple control objectives simultaneously. In conclusion, the proposed integrated control algorithm is tested using nonlinear simulations in the Control Oriented Transport SIMulator (COTSIM) for a DIII-D tokamak scenario.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Sodium doping effect on physicochemical properties of K{sub 1−x}Na{sub x}CaPb{sub 3}(PO{sub 4}){sub 3} (0 ≤ x ≤ 1) for the determination of mercury(II): Application in seawater samples

Highlights: • The apatite, K{sub 1−x}Na{sub x}CaPb{sub 3}(PO{sub 4}){sub 3} (0 ≤ x ≤ 1), was synthesized using reaction solid. • The obtained apatite was used to determine mercury in seawater samples from Morocco. • The effect of doping sodium into apatite on physic-chemical parameters was studied. • The influence of the electrochemical variables was investigated to determine mercury. - Abstract: A new chemically modified electrode was synthesized for the determination of mercury(II) using differential pulse anodic stripping voltammetry (DPASV). The electrode was modified by lacunar apatite K{sub 1−x}Na{sub x}CaPb{sub 3}(PO{sub 4}){sub 3} (0 ≤ x ≤ 1) synthesized using solid reaction. These powders were crystallized in the hexagonal system, space group P6{sub 3}/m. The effect of sodium content on structural, thermodynamic and electrochemical properties of prepared apatite has been studied. Therefore, the best results was obtained using NaCaPb{sub 3}(PO{sub 4}){sub 3} (x = 1) as modifier of carbon paste electrode for the electrochemical detection of mercury(II). The later ions were preconcentrated on the surface of the modified electrode and oxidized at 0.06 V vs. Ag/AgCl. The electroanalytical procedure comprises of two steps: the chemical accumulation of the analyte under open-circuit conditions followed by the electrochemical detection of the preconcentrated species using differential pulse voltammetry. The different parameters that govern the two steps were optimized. A linear response was obtained in the concentration range from 1.0 mol L{sup −1} × 10{sup −4} mol L{sup −1} to 2.0 mol L{sup −1} × 10{sup −7} mol L{sup −1} Hg(II) after activation of the electrode surface under the optimized conditions. The standard deviation was evaluated in a high and low concentration of mercury(II). The values ​​obtained for seven consecutive measurements were 1.24% and 5.07% of 1.0 mol L{sup −1} × 10{sup −4} mol L{sup −1} and 5.0 mol L{sup −1} × 10{sup −6} mol L{sup −1} mercury(II) solutions respectively. The detection limit and quantification limit for mercury(II), calculated from nine times standard deviation of blank/slope of the calibration graph, were 1.086 mol L{sup −1} × 10{sup −8} mol L{sup −1} and 3.62 mol L{sup −1} × 10{sup −8} mol L{sup −1}, respectively. The proposed chemically modified electrode was applied to determine mercury(II) in seawater samples.

36 MATERIALS SCIENCE↗

Feedback-Based Fault-Tolerant and Health-Adaptive Optimal Charging of Batteries

The key technology barriers that hinder the growth of Electric Vehicles (EVs) are long charging time, the shorter life-time of EV batteries, and battery safety. Specifically, EV charging protocols have significant effects on battery lifetime and safety. If not charged properly, the battery could end up with shorter life, and more importantly, improper charging can cause battery faults leading to catastrophic failures. To overcome these barriers, we propose a closed-loop feedback based approach, that enables real-time optimal fast charging protocol adaptation to battery health and possess active diagnostic capabilities in the sense that, during charging, it detects real-time faults and takes corrective action to mitigate such fault effects. We utilize battery electrical-thermal model, explicit battery capacity and power fade aging models, and thermal fault model to capture battery behavior. In conjunction with the models, we adopt linear quadratic optimal control techniques to realize the feedback-based control algorithm. Simulation studies are presented to illustrate the effectiveness of the proposed scheme.

batteries↗

Vertex Reordering for Real-world Graphs and Applications: An Empirical Evaluation

Vertex reordering is a way to improve locality in graph computations. Given an input (or ``natural'') order, reordering aims to compute an alternate permutation of the vertices that is aimed at maximizing a locality-based objective. Given decades of research on this topic, there are tens of graph reordering schemes, and there are also several linear arrangement ``gap'' measures for treatment as objectives. However, a comprehensive empirical analysis of the efficacy of the ordering schemes against the different gap measures, and against real-world applications is currently lacking. In this study, we present an extensive empirical evaluation of up to 11 ordering schemes, taken from different classes of approaches, on a set of 34 real-world graphs emerging from different application domains. Our study is presented in two parts: a) a thorough comparative evaluation of the different ordering schemes on their effectiveness to optimize different linear arrangement gap measures, relevant to preserving locality; and b) extensive evaluation of the impact of the ordering schemes on two real-world, parallel graph applications, namely, community detection and influence maximization. Our studies show a significant divergence among the ordering schemes (up to $40\times$ between the best and the poor) in their effectiveness to reduce the gap measures; and a wide ranging impact of the ordering schemes on various aspects including application runtime (up to $4\times$), memory and cache use, load balancing, and parallel work and efficiency. The comparative study also help reveal the nuances of a parallel environment (compared to serial) on the ordering schemes and their role in optimizing applications.

Barik, Reet↗