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 1,549 records · Page 86

On a nonlocal Cahn–Hilliard model permitting sharp interfaces

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

97 MATHEMATICS AND COMPUTING↗

Calibration of Car-Following Models Using a Dual Genetic Algorithm with Central Composite Design

We report the calibration of microscopic traffic simulation models has received much attention in the simulation field. Although no standard has been established for it, a genetic algorithm (GA) has been widely employed in recent literature because of its high efficiency to find solutions in such optimization problems. However, the performance still falls short in simulation analyses to support fast decision making. This paper proposes a new calibration procedure using a dual GA and central composite design (CCD) in order to improve the efficiency. The calibration exercise goes through three major sequential steps: (1) experimental design using CCD for a quadratic response surface model (RSM) estimation, (2) 1st GA procedure using the RSM with CCD to find a near-optimal initial population for a next step, and (3) 2nd GA procedure to find a final solution. The proposed method was applied in calibrating the Gipps car-following model with respect to maximizing the likelihood of a spacing distribution between a lead and following vehicle. In order to evaluate the performance of the proposed method, a conventional calibration approach using a single GA was compared under both simulated and real vehicle trajectory data. It was found that the proposed approach enhances the optimization speed by starting to search from an initial population that is closer to the optimum than that of the other approach. This result implies the proposed approach has benefits for a large-scale traffic network simulation analysis. Finally, this method can be extended to other optimization tasks using GA in transportation studies.

42 ENGINEERING↗

Complexity of the Quantum Adiabatic Algorithm

The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.

Hen, Itay↗

A Comparison of Metallic, Composite and Nanocomposite Optimal Transonic Transport Wings

Current and future composite material technologies have the potential to greatly improve the performance of large transport aircraft. However, the coupling between aerodynamics and structures makes it challenging to design optimal flexible wings, and the transonic flight regime requires high fidelity computational models. We address these challenges by solving a series of high-fidelity aerostructural optimization problems that explore the design space for the wing of a large transport aircraft. We consider three different materials: aluminum, carbon-fiber reinforced composites and an hypothetical composite based on carbon nanotubes. The design variables consist of both aerodynamic shape (including span), structural sizing, and ply angle fractions in the case of composites. Pareto fronts with respect to structural weight and fuel burn are generated. The wing performance in each case is optimized subject to stress and buckling constraints. We found that composite wings consistently resulted in lower fuel burn and lower structural weight, and that the carbon nanotube composite did not yield the increase in performance one would expect from a material with such outstanding properties. This indicates that there might be diminishing returns when it comes to the application of advanced materials to wing design, requiring further investigation.

Kennedy, Graeme J.↗

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗

Control Co-Design Studies for a 22 MW Semisubmersible Floating Wind Turbine Platform

We present a control co-design software framework that can be used to optimize floating wind turbines and their controllers. Because this framework has many options for design variables, constraints, and merit figures, along with modeling fidelity levels, we seek to demonstrate best practices for using the tool while designing a floating platform for the new 22 MW offshore reference wind turbine developed within the International Energy Agency Wind Technology Commercialization Programme 55 on Reference Wind Turbines and Farms. During these studies, we evaluate the use of different simulation fidelity levels, the effect of using different load cases for controller tuning, and the difference between sequential and simultaneous control co-design solutions. Based on these efforts, we suggest using an algorithm that performs an initial search of the design space before optimization. We find that solving smaller optimization problems, in a sequential manner, leads to more reliable outcomes in fewer iterations than larger, simultaneous control co-design solutions. However a simultaneous CCD solution produces a platform with a 2% lower mass than the sequential CCD outcome.

17 WIND ENERGY↗

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗

Performance Models for Split-execution Computing Systems

Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We analyze the performance of a split-execution computing system developed from conventional and quantum processing units (QPUs) by using behavioral models that track resource usage. We focus on asymmetric processing models built using conventional CPUs and a family of special-purpose QPUs that employ quantum computing principles. Our performance models account for the translation of a classical optimization problem into the physical representation required by the quantum processor while also accounting for hardware limitations and conventional processor speed and memory. We conclude that the bottleneck in this split-execution computing system lies at the quantum-classical interface and that the primary time cost is independent of quantum processor behavior.

multiprocessor↗

SU-E-T-574: Novel Chance-Constrained Optimization in Intensity-Modulated Proton Therapy Planning to Account for Range and Patient Setup Uncertainties

Purpose: We propose to apply a probabilistic framework, namely chanceconstrained optimization, in the intensity-modulated proton therapy (IMPT) planning subject to range and patient setup uncertainties. The purpose is to hedge against the influence of uncertainties and improve robustness of treatment plans. Methods: IMPT plans were generated for a typical prostate patient. Nine dose distributions are computed — the nominal one and one each for ±5mm setup uncertainties along three cardinal axes and for ±3.5% range uncertainty. These nine dose distributions are supplied to the solver CPLEX as chance constraints to explicitly control plan robustness under these representative uncertainty scenarios with certain probability. This probability is determined by the tolerance level. We make the chance-constrained model tractable by converting it to a mixed integer optimization problem. The quality of plans derived from this method is evaluated using dose-volume histogram (DVH) indices such as tumor dose homogeneity (D5% – D95%) and coverage (D95%) and normal tissue sparing like V70 of rectum, V65, and V40 of bladder. We also compare the results from this novel method with the conventional PTV-based method to further demonstrate its effectiveness Results: Our model can yield clinically acceptable plans within 50 seconds. The chance-constrained optimization produces IMPT plans with comparable target coverage, better target dose homogeneity, and better normal tissue sparing compared to the PTV-based optimization [D95% CTV: 67.9 vs 68.7 (Gy), D5% – D95% CTV: 11.9 vs 18 (Gy), V70 rectum: 0.0 % vs 0.33%, V65 bladder: 2.17% vs 9.33%, V40 bladder: 8.83% vs 21.83%]. It also simultaneously makes the plan more robust [Width of DVH band at D50%: 2.0 vs 10.0 (Gy)]. The tolerance level may be varied to control the tradeoff between plan robustness and quality. Conclusion: The chance-constrained optimization generates superior IMPT plan compared to the PTV-based optimization with explicit control of plan robustness. NIH/NCI K25CA168984, Eagles Cancer Research Career Development, The Lawrence W. and Marilyn W. Matteson Fund for Cancer Research, Mayo ASU Seed Grant, and The Kemper Marley Foundation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Constrained optimal ascent-flyback shuttle trajectories.

An optimal Space Shuttle ascent-flyback trajectory shaping capability is presented which is based on the accelerated gradient parameter optimization technique. A typical atmospheric flight branched optimization problem is analyzed which required the determination of 31 parameters. This parameter set includes the description of the vehicle attitude control angles for three branches of Shuttle flight: first stage ascent, second stage ascent, and first stage flyback. The important in-flight inequality constraints required to maintain the integrity of the vehicle are considered. Results indicate that for a launch into a 55 deg inclined ellipse, a 13% increase in payload can be realized by using optimal control in the first-stage ascent rather than the conventional gravity-turn steering.

Kamm, J. L.↗

Numerical Methods for Large-Scale Data Factorization (Final Report (Milestone Date 9/30/11) for Subcontract No. B594099)

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead of the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.

97 MATHEMATICS AND COMPUTING↗

A safe reinforcement learning algorithm for supervisory control of power plants

Traditional control theory-based methods require tailored engineering for each system and constant fine-tuning. In power plant control, one often needs to obtain a precise representation of the system dynamics and carefully design the control scheme accordingly. Model-free Reinforcement learning (RL) has emerged as a promising solution for control tasks due to its ability to learn from trial-and-error interactions with the environment. It eliminates the need for explicitly modeling the environment’s dynamics, which is potentially inaccurate. However, the direct imposition of state constraints in power plant control raises challenges for standard RL methods. To address this, we propose a chance-constrained RL algorithm based on Proximal Policy Optimization for supervisory control. Our method employs Lagrangian relaxation to convert the constrained optimization problem into an unconstrained objective, where trainable Lagrange multipliers enforce the state constraints. In conclusion, our approach achieves the smallest distance of violation and violation rate in a load-follow maneuver for an advanced Nuclear Power Plant design.

constrained optimization↗

Optimizing Intermittent Water Supply in Urban Pipe Distribution Networks

In many urban areas of the developing world, piped water is supplied only intermittently, as valves direct water to different parts of the water distribution system at different times. The flow is transient, and may transition between free-surface and pressurized, resulting in complex dynamical features with important consequences for water suppliers and users. Here, we develop a computational model of transition, transient pipe flow in a network, accounting for a wide variety of realistic boundary conditions. We validate the model against several published data sets and demonstrate its use on a real pipe network. The model is extended to consider several optimization problems motivated by realistic scenarios. Here, we demonstrate how to infer water flow in a small pipe network from a single pressure sensor, and show how to control water inflow to minimize damaging pressure transients.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Resilient Distribution System Restoration with Equitable Load Shedding

A methodology is proposed for the improvement of electric distribution system resilience to high-impact, low-probability catastrophic events. An approach for dynamic network reconfiguration and coordination of distributed energy resources is introduced to assist in restoration efforts. The problem is formulated as a mixed-integer linear program that minimizes generation costs, the cost of lost load, and costs associated with equitable load shedding, while respecting operational limits of generation, loads, and the network. Constraints are imposed on binary switching variables to ensure equitable load shedding in emergency situations. Numerical validation of the proposed approach is conducted on an example distribution feeder, and case studies are performed to analyze the impact of various parameters in the optimization problem formulation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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

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

59 BASIC BIOLOGICAL SCIENCES↗

An indirect method for numerical optimization using the Kreisselmeir-Steinhauser function

A technique is described for converting a constrained optimization problem into an unconstrained problem. The technique transforms one of more objective functions into reduced objective functions, which are analogous to goal constraints used in the goal programming method. These reduced objective functions are appended to the set of constraints and an envelope of the entire function set is computed using the Kreisselmeir-Steinhauser function. This envelope function is then searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. Advantages of this approach are the use of unconstrained optimization methods to find a constrained minimum without the draw down factor typical of penalty function methods, and that the technique may be started from the feasible or infeasible design space. In multiobjective applications, the approach has the advantage of locating a compromise minimum design without the need to optimize for each individual objective function separately.

Wrenn, Gregory A.↗

The Influences of Lamination Angles on the Interior Noise Levels of an Aircraft

The feasibility of reducing the interior noise levels of an aircraft passenger cabin through optimization of the composite lay up of the fuselage is investigated. MSC/NASTRAN, a commercially available finite element code, is used to perform the dynamic analysis and subsequent optimization of the fuselage. The numerical calculation of sensitivity of acoustic pressure to lamination angle is verified using a simple thin, cylindrical shell with point force excitations as noise sources. The thin shell used represents a geometry similar to the fuselage and analytic solutions are available for the cylindrical thin shell equations of motion. Optimization of lamination angle for the reduction of interior noise is performed using a finite element model of an actual aircraft fuselage. The aircraft modeled for this study is the Beech Starship. Point forces simulate the structure borne noise produced by the engines and are applied to the fuselage at the wing mounting locations. These forces are the noise source for the optimization problem. The acoustic pressure response is reduced at a number of points in the fuselage and over a number of frequencies. The objective function is minimized with the constraint that it be larger than the maximum sound pressure level at the response points in the passenger cabin for all excitation frequencies in the range of interest. Results from the study of the fuselage model indicate that a reduction in interior noise levels is possible over a finite frequency range through optimal configuration of the lamination angles in the fuselage. Noise reductions of roughly 4 dB were attained. For frequencies outside the optimization range, the acoustic pressure response may increase after optimization. The effects of changing lamination angle on the overall structural integrity of the airframe are not considered in this study.

Fernholz, Christian M.↗

A Multi-Objective, Hub-and-Spoke Supply Chain Design Model For Densified Biomass

In this paper we propose a model to design the supply chain for densified biomass. Rail is typically used for long-haul, high-volume shipment of densified biomass. This is the reason why a hub-and-spoke network structure is used to model this supply chain. The model is formulated as a multi-objective, mixed-integer programing problem under economic, environmental, and social criteria. The goal is to identify the feasibility of meeting the Renewable Fuel Standard (RFS) by using biomass for production of cellulosic ethanol. The focus in not just on the costs associated with meeting these standards, but also exploring the social and environmental benefits that biomass production and processing offers by creating new jobs and reducing greenhouse gas (GHG) emissions. We develop an augmented ?-constraint method to find the exact Pareto solution to this optimization problem. We develop a case study using data from the Mid-West. The model identifies the number, capacity and location of biorefineries needed to make use of the biomass available in the region. The model estimates the delivery cost of cellulosic ethanol under different scenario, the number new jobs created and the GHG emission reductions in the supply chain.

09 BIOMASS FUELS↗