Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 811 records · Page 45

Planar Transformer With Asymmetric Integrated Leakage Inductance Using Horizontal Air Gap

This article presents a novel planar-based transformer winding and core structure with controllable leakage inductance generation for integrated magnetics applications. As a result of limitations in integrated magnetics from the literature, a new approach is proposed utilizing semi-interleaved windings and controllable leakage via a leakage flux core leg featuring a horizontal air gap. Here, the proposed transformer design is analyzed via detailed reluctance modeling to determine closed-form equations for the magnetizing and asymmetrically distributed leakage inductances. Next, a genetic-algorithm-based multiobjective design optimization problem is developed, seeking to minimize the core and winding losses of the proposed transformer subject to a set of parametric and geometric constraints in a dc-ac dual-active-bridge topology for microinverter applications. The optimization was extended to include other integrated magnetic structures from the literature, where it is determined that the proposed transformer is superior from the perspectives of efficiency, footprint area, and parasitic capacitance. Based on the results of the optimization analysis, two designs with theoretical transformer California Energy Commission (CEC) efficiency drops (i.e., CEC efficiency reduction specifically due to the transformer loss mechanisms) of 1.19% and 0.83% were fabricated and evaluated for electrical and thermal performance in the proposed 40 V, 400 W microinverter.

42 ENGINEERING↗

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗

Optimizing human activity patterns using global sensitivity analysis

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. Here we use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Finally, though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

97 MATHEMATICS AND COMPUTING↗

Sequence of polyhedral relaxations for nonlinear univariate functions

Here, given a nonlinear, univariate, bounded, and differentiable function f(x), this article develops a sequence of Mixed Integer Linear Programming (MILP) and Linear Programming (LP) relaxations that converge to the graph of f(x) and its convex hull, respectively. Theoretical convergence of the sequence of relaxations to the graph of the function and its convex hull is established. For nonlinear non-convex optimization problems, the relaxations presented in this article can be used to construct tight MILP and LP relaxations. These MILP and the LP relaxations can also be used with MILP-based and spatial branch-and-bound based global optimization algorithms, respectively.

42 ENGINEERING↗

A class of customized proximal point algorithms for linearly constrained convex optimization

In this paper, we propose a class of customized proximal point algorithms for linearly constrained convex optimization problems. The algorithms are implementable, provided that the proximal operator of the objective function is easy to evaluate. We show that, with special setting of the algorithmic scalar, our algorithms contain the customized proximal point algorithm (He et al., Optim Appl 56:559–572, 2013), the linearized augmented Lagrangian method (Yang and Yuan, Math Comput 82:301–329, 2013), the Bregman Operator Splitting algorithm (Zhang et al., SIAM J Imaging Sci 3:253–276, 2010) as special cases. The global convergence and worst-case convergence rate measured by the iteration complexity are established for the proposed algorithms. Numerical results demonstrate that the algorithms work well for a wide range of the scalar.

97 MATHEMATICS AND COMPUTING↗

On the role of Battery Energy Storage Systems in the day-ahead Contingency-Constrained Unit Commitment problem under renewable penetration

The integration of variable Renewable Energy Sources (vRES) to alleviate greenhouse gas emissions has introduced significant challenges for power systems operations. These challenges include high levels of uncertainty due to the intermittence associated with vRES and therefore impose the need to devise a reliable and cost-effective day-ahead unit commitment and power and reserves scheduling for real-time operations. Also, this increasing penetration of vRES requires higher ramping capabilities from units originally designed for other purposes (e.g., base-load generation), which might be exacerbated during contingency states. Hence, in this work, we propose a methodology to address the day-ahead Contingency-Constrained Unit Commitment (CCUC) problem that leverages the participation of Battery Energy Storage Systems (BESSs) to address load-following and post-contingency management, therefore alleviating the ramping burden on conventional thermal generators. To do so, we formulate a three-level optimization problem that represents the decision-making process of obtaining the least-cost commitment, generation and reserves scheduling, while restricting the Conditional Value-at-Risk (CVaR) of the system imbalance at real-time operations to user-defined tolerance levels. In addition, we devise a computationally efficient solution approach for the proposed problem based on the Column-and Constraint Generation (CCG) algorithmic framework. Two numerical experiments are conducted to empirically illustrate the benefits of the proposed methodology. Key results indicate a reduction in real-time ramping needs and a better usage of the system resources, with a reduction in the overall system commitment levels and reserve scheduling costs when compared to a benchmark case in which storage is not available.

Moreira, Alexandre↗

Dose reduction using a dynamic, piecewise-linear attenuator

Purpose: The authors recently proposed a dynamic, prepatient x-ray attenuator capable of producing a piecewise-linear attenuation profile customized to each patient and viewing angle. This attenuator was intended to reduce scatter-to-primary ratio (SPR), dynamic range, and dose by redistributing flux. In this work the authors tested the ability of the attenuator to reduce dose and SPR in simulations. Methods: The authors selected four clinical applications, including routine full field-of-view scans of the thorax and abdomen, and targeted reconstruction tasks for an abdominal aortic aneurysm and the pancreas. Raw data were estimated by forward projection of the image volume datasets. The dynamic attenuator was controlled to reduce dose while maintaining peak variance by solving a convex optimization problem, assuminga priori knowledge of the patient anatomy. In targeted reconstruction tasks, the noise in specific regions was given increased weighting. A system with a standard attenuator (or “bowtie filter”) was used as a reference, and used either convex optimized tube current modulation (TCM) or a standard TCM heuristic. The noise of the scan was determined analytically while the dose was estimated using Monte Carlo simulations. Scatter was also estimated using Monte Carlo simulations. The sensitivity of the dynamic attenuator to patient centering was also examined by shifting the abdomen in 2 cm intervals. Results: Compared to a reference system with optimized TCM, use of the dynamic attenuator reduced dose by about 30% in routine scans and 50% in targeted scans. Compared to the TCM heuristics which are typically used withouta priori knowledge, the dose reduction is about 50% for routine scans. The dynamic attenuator gives the ability to redistribute noise and variance and produces more uniform noise profiles than systems with a conventional bowtie filter. The SPR was also modestly reduced by 10% in the thorax and 24% in the abdomen. Imaging with the dynamic attenuator was relatively insensitive to patient centering, showing a 17% increase in peak variance for a 6 cm shift of the abdomen, instead of an 82% increase in peak variance for a fixed bowtie filter. Conclusions: A dynamic prepatient x-ray attenuator consisting of multiple wedges is capable of achieving substantial dose reductions and modest SPR reductions.

61 RADIATION PROTECTION AND DOSIMETRY↗

FORCE-DISPATCHES Integration - Initial Demonstration

Integrated energy systems (IES) combine, in mutually beneficial ways, power from variable renewable energy sources and nuclear power plants (NPP) to improve economic viability under uncertain market and weather conditions. The open-source Framework for Optimization of Resources and Economics (FORCE) tool suite, developed at Idaho National Laboratory (INL), has enabled comprehensive modeling and simulation of IES. The capabilities within FORCE include grid portfolio optimization through the Holistic Energy Resource Optimization Network (HERON) and the transient process model analysis library HYBRID, among others. Continuous efforts and investments from the IES programs have been made to expand and improve the versatility of the FORCE toolset in fiscal year 2022. Code-coupling and cross-tool communication have been important methods for improving this versatility. This report focuses on an additional workflow in the HERON tool for capacity and dispatch stochastic optimization through integration with the external tool Design Integration and Synthesis Platform to Advance Tightly Coupled Hybrid Energy Systems (DISPATCHES). DISPATCHES was primarily developed by the National Energy Technology Laboratory, in collaboration with other national laboratories, which included INL, universities, and industry partners. It is coupled to a library of algebraic models for specific plant components, and to a framework for stochastic optimization different from that provided in the current Risk Analysis Virtual Environment (RAVEN)-running-RAVEN algorithm in HERON. HERON currently conducts stochastic optimization via an outer-inner loop: it optimizes over variable capacity on the outer loop, and at each step within the capacity parameter space, conducts an inner optimization over scenarios (of market signals, demand, and/or weather patterns) and hourly dispatch throughout a user-specified number of years. On the other hand, DISPATCHES conducts stochastic optimization via an “all-at-once” strategy in which capacity variables are optimized at the same level as dispatch variables, as all scenarios are considered at once. The latter method works especially well for projects of limited size and project length, as the necessary computational power and memory increases with the number of variables and scenarios. The new capability to use the DISPATCHES workflow in HERON enhances standalone simulations by leveraging FORCE tools—namely, the economic metrics from the Tool for Economic Analysis (TEAL) and reduced-order model (ROM) sampling from RAVEN. The initial demonstration of the DISPATCHES workflow simulates an existing nuclear-case flowsheet within the DISPATCHES repository—this models a NPP with a secondary revenue stream for hydrogen production. Electrical output from the plant is converted to hydrogen via a proton-exchange membrane (PEM) electrolyzer, hydrogen tanks are used for storage, and an additional turbine is added for hydrogen combustion. Continued work regarding this FORCE-DISPATCHES integration will include automatic generation of DISPATCHES models from HERON inputs, offering analysts the option of using either the RAVEN-runsRAVEN or DISPATCHES workflow to solve technoeconomic optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SAT operates as a sequence of iterations, in which bitstrings returned from one iteration are used to set spin-dependent phases in oscillating transverse fields in the next iteration. Over several iterations, the novel mechanism of the algorithm steers the system toward the problem ground state. We benchmark IST-SAT on sets of hard MAX-3-XORSAT problem instances with exact state vector simulation, and report polynomial speedups over Trotterized adiabatic quantum computation and the best known semi-greedy classical algorithm. When IST-SAT is seeded with a sufficiently good initial approximation, the algorithm converges to exact solution(s) in a polynomial number of iterations. Our numerical results identify a critical Hamming radius, or quality of initial approximation, where the time-to-solution crosses from exponential to polynomial scaling in problem size. This work proposes IST-SAT a new quantum algorithm, which improves upon solutions obtained from initial classical or quantum optimization algorithms. The steering mechanism we introduce through IST-SAT presents a new path toward achieving quantum advantage in optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling and Optimization of a Rotating Packed Bed Contactor with a Tetraamine-Appended Metal−Organic Framework for CO 2 Capture

A potential contactor technology for sorbent-based CO 2 capture is the rotating packed bed that contains separate sections for continuous adsorption and desorption. A heat exchanger can be embedded to remove heat in the adsorption section and add heat in the desorption section. In this work, we develop a two-dimensional (2D) model of a rotating packed bed for use in CO 2 capture applications. Mass and energy balances for the model are developed based on a Ljungström-type air preheater, which accounts for the counter-current axial flow of gas phases in separate sections of the bed and the rotation of a solid sorbent, which cycles between adsorption and desorption sections. The sorbent used for this analysis is the tetraamine-appended metal−organic framework Mg 2 (dobpdc)(3−4− 3), chosen for its stability and affinity for CO 2 at low partial pressures, such as those from a natural gas power plant source. An optimization problem is solved that considers the trade-off between maximizing the productivity of the bed and minimizing energy consumption. Maximum productivity and minimum energy are found to be 8.53 kg/h/m 3 and 3.84 MJ/kg, respectively, when these objectives are optimized independently. It is observed that the flue gas pressure and bed rotational speed are the desired operating variables to vary for model-based design of experiments to reduce uncertainty in parameter estimation, as these two variables yielded the most information content based on the Fisher information matrix.

20 FOSSIL-FUELED POWER PLANTS↗

Reaction Path Optimization with Holonomic Constraints and Kinetic Energy Potentials

Two methods are developed to enhance the stability, efficiency, and robustness of reaction path optimization using a chain of replicas. First, distances between replicas are kept equal during path optimization via holonomic constraints. Finding a reaction path is, thus, transformed into a constrained optimization problem. This approach avoids force projections for finding minimum energy paths (MEPs), and fast-converging schemes such as quasi-Newton methods can be readily applied. Second, we define a new objective function - the total Hamiltonian - for reaction path optimization, by combining the kinetic energy potential of each replica with its potential energy function. Minimizing the total Hamiltonian of a chain determines a minimum Hamiltonian path (MHP). If the distances between replicas are kept equal and a consistent force constant is used, then the kinetic energy potentials of all replicas have the same value. The MHP in this case is the most probable isokinetic path. Our results indicate that low-temperature kinetic energy potentials (<5 K) can be used to prevent the development of kinks during path optimization and can significantly reduce the required steps of minimization by 2-3 times without causing noticeable differences between a MHP and MEP. These methods are applied to three test cases, the C₇eq-to-Cax isomerization of an alanine dipeptide, the ⁴C₁- to-¹C₄ transition of an α-D-glucopyranose, and the helix-to-sheet transition of a GNNQQNY heptapeptide. By applying the methods developed in this work, convergence of reaction path optimization can be achieved for these complex transitions, involving full atomic details and a large number of replicas (>100). For the case of helix-to-sheet transition, we identify pathways whose energy barriers are consistent with experimental measurements. Further, we develop a method based on the work energy theorem to quantify the accuracy of reaction paths and to determine whether the atoms used to define a path are enough to provide quantitative estimation of energy barriers.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Electronic structure with direct diagonalization on a D-wave quantum annealer

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

97 MATHEMATICS AND COMPUTING↗

Asymmetrical Magnet Shape Optimization Based on S-C Mapping for Torque Profile Mitigation in Unidirectional Application of SPMS Machine

Surface-mounted Permanent Magnet Synchronous (SPMS) machines are widely used in applications that require low torque ripple, reduced vibration and acoustic noise. For those applications of SPMSM in which only unidirectional operation is needed, asymmetric design optimization show to have significant advantages over symmetric designs. In this paper, an analytical method based on Schwarz -Christoffel mapping is presented for asymmetrical magnet shape optimization in SPMS machine. In this method, permanent magnet is divided into finite cells so that each cell can be assigned with either air (OFF) or magnet (ON). The Optimization problem is solved using Genetic Algorithms (GAs). In order to remove non-manufacturable shapes, the cluster of materials and cleaning method is used and applied into magnet cells. The analytical method can significantly reduce the computation time used by optimization process as compared with methods based on Finite Element Analysis (FEA). This method is applied to a 12-pole SPMS machine. Validation of the S-C mapping method and final results are carried out using 2D and 3D finite element analysis. Here, the results obtained demonstrate that asymmetrical magnet shape improves cogging torque and torque ripple performance of SPMS machine by a significant margin.

42 ENGINEERING↗

Crystal Plasticity Modeling and Experimental Validation with an Orientation Distribution Function for Ti-7Al Alloy

An orientation distribution function based model is used for micromechanical modeling of the titanium-aluminum alloys, Ti-0 wt % Al and Ti-7 wt % Al, which are in demand for many aerospace applications. This probability descriptor based modeling approach is different than crystal plasticity finite element techniques since it computes the averaged material properties using upper bound averaging. A rate-independent single-crystal plasticity model is implemented to compute the effect of macroscopic strain on the polycrystal. An optimization problem is defined for calibrating the basal, prismatic, pyramidal slip system and twin parameters using the available tension and compression experimental data. The crystal plasticity parameters of Ti-7 wt % Al are not studied extensively in literature, and therefore the optimization results for the crystal plasticity model realization produce unique data, which will be beneficial to future studies in the field. The sensitivities of the slip and twin parameters to the design objectives are also investigated to identify the most critical slip system parameters. Using the optimum design parameters, the microstructural textures, during the tension test, are predicted by the crystal plasticity finite element simulations, and compared to the available experimental texture and scanning electron microscope—digital image correlation data.

36 MATERIALS SCIENCE↗

Efficient numerical method to calculate the three-tangle of mixed states

We demonstrate an efficient numerical method to calculate the three-tangle of general mixed states. We construct an ''energy function'' (target function) for the three-tangle of the mixed state under certain constraints. The energy function (target function) is then optimized via the replica exchange Monte Carlo method. We have extensively tested the method for the examples with known analytical results, showing remarkable agreement. The method can be applied to other optimization problems in quantum information theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Insider Models with Finite Utility in Markets with Jumps

In this article we consider, under a Levy process model for the stock price, the utility optimization problem for an insider agent whose additional information is the final price of the stock blurred with an additional independent noise which vanishes as the final time approaches. Our main interest is establishing conditions under which the utility of the insider is finite. Mathematically, the problem entails the study of a 'progressive' enlargement of filtration with respect to random measures. We study the jump structure of the process which leads to the conclusion that in most cases the utility of the insider is finite and his optimal portfolio is bounded. This can be explained financially by the high risks involved in models with jumps.

97 MATHEMATICS AND COMPUTING↗

Analytical gradient-based optimization of CALPHAD model parameters

The calibration of CALPHAD (CALculation of PHAse Diagrams) models involves the solution of a very challenging high-dimensional multiobjective optimization problem. Traditional approaches to parameter fitting predominantly rely on gradient-free methods, which while robust, are computationally inefficient and often scale poorly with model complexity. In this work, we introduce and demonstrate a generalizable framework for analytic gradient-based optimization of the parameters of the CALPHAD model enabled by the recently formalized Jansson derivative technique. This method allows for efficient evaluation of gradients of thermodynamic properties at equilibrium with respect to model parameters, even in the presence of arbitrarily complex internal degrees of freedom. Leveraging these semi-analytic gradients, we employ the conjugate gradient (CG) method to optimize thermodynamic model parameters for four binary alloy systems: Cu-Mg, Fe-Ni, Cr-Ni, and Cr-Fe. Across all systems, CG achieves comparable or superior optimality relative to Bayesian ensemble Markov Chain Monte Carlo (MCMC) with improvements in computational efficiency ranging from one to three orders of magnitude. Furthermore, our results establish a new paradigm for CALPHAD assessments in which high fidelity data-rich model calibration becomes tractable using deterministic gradient-informed algorithms.

CALPHAD↗