Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonlinear 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 577 records · Page 32

Mixed-Integer Linear Programming Formulation with Embedded Machine Learning Surrogates for the Design of Chemical Process Families

In previous work, we introduced process family design. The main idea is to design a platform of common elements, and, allowing us to capture additional cost savings, simultaneously design a family of processes, and reducing both engineering and deployment timelines. We formulate this as an optimization problem, specifically a nonlinear generalized disjunctive program (GDP). We have proposed two approaches for reformulating and solving this problem: one based on full-discretization of the design space and one that uses Machine Learning (ML) surrogates to replace the nonlinear process models. Using ML surrogates to predict required system costs and performance indicators allows us to reformulate the nonlinearities in the GDP generate an efficient MILP formulation. In this work, we apply the ML surrogate approach to two case studies. One case study involves designing a family of carbon capture systems to cover a set of different flue gas flow rates and inlet CO 2 concentrations, where we consider the absorber and stripper as common unit module types. The second case study focuses on a water-desalination process, where we design a family of these processes for a variety of salt concentrations and flow rates. In both of these case studies, we demonstrate a scalable optimization approach that enables the design of multiple processes simultaneously, reducing the time-to-market and overall costs by maximizing the cost savings due to both economies of scale and economies of numbers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Membrane Cascade Design for Critical Mineral Recovery Through Logic-based Superstructure Optimization

Critical minerals and rare earth elements play an important role in our climate change initiatives, particularly in applications related with energy storage. Here, we use discrete optimization approaches to design a process for the recovery of Lithium and Cobalt from battery recycling, through membrane separation. Our contribution involves proposing a Generalized Disjunctive Programming (GDP) model for the optimal design of a multistage diafiltration cascade for Li-Co separation. By solving the resulting nonconvex mixed-integer nonlinear program model to global optimality, we investigated scalability and solution quality variations with changes in the number of stages and elements per stage. Results demonstrate the computational tractability of the nonlinear GDP formulation for design of membrane separation processes while opening the door for decom-position strategies for multicomponent separation cascades. Future work aims to extend the GDP formulation to account for stage installation and explore various decomposition techniques to enhance solution efficiency.

Ovalle, Daniel↗

Computable optimal value bounds for generalized convex programs

It has been shown by Fiacco that convexity or concavity of the optimal value of a parametric nonlinear programming problem can readily be exploited to calculate global parametric upper and lower bounds on the optimal value function. The approach is attractive because it involves manipulation of information normally required to characterize solution optimality. A procedure is briefly described for calculating and improving the bounds as well as its extensions to generalized convex and concave functions. Several areas of applications are also indicated.

Fiacco, Anthony V.↗

NASA Tech Briefs, December 2005

Topics covered include: Video Mosaicking for Inspection of Gas Pipelines; Shuttle-Data-Tape XML Translator; Highly Reliable, High-Speed, Unidirectional Serial Data Links; Data-Analysis System for Entry, Descent, and Landing; Hybrid UV Imager Containing Face-Up AlGaN/GaN Photodiodes; Multiple Embedded Processors for Fault-Tolerant Computing; Hybrid Power Management; Magnetometer Based on Optoelectronic Microwave Oscillator; Program Predicts Time Courses of Human/ Computer Interactions; Chimera Grid Tools; Astronomer's Proposal Tool; Conservative Patch Algorithm and Mesh Sequencing for PAB3D; Fitting Nonlinear Curves by Use of Optimization Techniques; Tool for Viewing Faults Under Terrain; Automated Synthesis of Long Communication Delays for Testing; Solving Nonlinear Euler Equations With Arbitrary Accuracy; Self-Organizing-Map Program for Analyzing Multivariate Data; Tool for Sizing Analysis of the Advanced Life Support System; Control Software for a High-Performance Telerobot; Java Radar Analysis Tool; Architecture for Verifiable Software; Tool for Ranking Research Options; Enhanced, Partially Redundant Emergency Notification System; Close-Call Action Log Form; Task Description Language; Improved Small-Particle Powders for Plasma Spraying; Bonding-Compatible Corrosion Inhibitor for Rinsing Metals; Wipes, Coatings, and Patches for Detecting Hydrazines; Rotating Vessels for Growing Protein Crystals; Oscillating-Linear-Drive Vacuum Compressor for CO2; Mechanically Biased, Hinged Pairs of Piezoelectric Benders; Apparatus for Precise Indium-Bump Bonding of Microchips; Radiation Dosimetry via Automated Fluorescence Microscopy; Multistage Magnetic Separator of Cells and Proteins; Elastic-Tether Suits for Artificial Gravity and Exercise; Multichannel Brain-Signal-Amplifying and Digitizing System; Ester-Based Electrolytes for Low-Temperature Li-Ion Cells; Hygrometer for Detecting Water in Partially Enclosed Volumes; Radio-Frequency Plasma Cleaning of a Penning Malmberg Trap; Reduction of Flap Side Edge Noise - the Blowing Flap; and Preventing Accidental Ignition of Upper-Stage Rocket Motors.

Source record↗

Algorithmic Perspectives on Problem Formulations in MDO

This work is concerned with an approach to formulating the multidisciplinary optimization (MDO) problem that reflects an algorithmic perspective on MDO problem solution. The algorithmic perspective focuses on formulating the problem in light of the abilities and inabilities of optimization algorithms, so that the resulting nonlinear programming problem can be solved reliably and efficiently by conventional optimization techniques. We propose a modular approach to formulating MDO problems that takes advantage of the problem structure, maximizes the autonomy of implementation, and allows for multiple easily interchangeable problem statements to be used depending on the available resources and the characteristics of the application problem.

Alexandrov, Natalia M.↗

A Review: Indirect Optimal Control of Wave Energy Converters

Wave energy conversion has been the subject of interest in the past several years. While there are several concepts for converting wave power into electric power, the cost of the electric power harvested from ocean waves remains high. One of the main challenges, though it receives less attention, is the control of the wave energy converter (WEC). This paper presents a treatment for the WEC control problem within the context of optimal control theory. The result is systematic development for an explicit expression for a control that maximizes the harvested energy while meeting operational constraints such as the maximum device stroke and the maximum control force. The control presented here can also be adjusted to meet device design constraints such as a limitation on the amount of reactive power available from the power take-off (PTO) unit; this feature enables a control co-design for the PTO unit. Numerical simulations are presented in this paper for demonstration.

control design↗

Low-Thrust Transfers from Distant Retrograde Orbits to L2 Halo Orbits in the Earth-Moon System

This paper presents a study of transfers between distant retrograde orbits (DROs) and L2 halo orbits in the Earth-Moon system that could be flown by a spacecraft with solar electric propulsion (SEP). Two collocation-based optimal control methods are used to optimize these highly-nonlinear transfers: Legendre pseudospectral and Hermite-Simpson. Transfers between DROs and halo orbits using low-thrust propulsion have not been studied previously. This paper offers a study of several families of trajectories, parameterized by the number of orbital revolutions in a synodic frame. Even with a poor initial guess, a method is described to reliably generate families of solutions. The circular restricted 3-body problem (CRTBP) is used throughout the paper so that the results are autonomous and simpler to understand.

trajectory design↗

Measuring Low-Order Aberrations in a Segmented Telescope

The in-focus PSF optimizer (IPO) is an algorithm for use in monitoring and controlling the alignment of the segments of a segmented-mirror astronomical telescope. IPO is so named because it computes wave-front aberrations of the telescope from digitized pointspread functions (PSFs) measured in infocus images. Inasmuch as distant astronomical objects that behave optically as point sources can typically be seen in almost any astronomical image, the main benefit afforded by IPO may be to enable maintenance of mirror-segment alignments without detracting from valuable scientific-observation time. IPO evolved from prescription-retrieval type algorithms. Prescription retrieval uses in-focus and out-of-focus PSFs to infer the state of an imaging optical system. The state, in this context, refers to the positions, orientations, and low-order figure errors of the optical elements in the system. Both prescription- retrieval and IPO use an iterative, nonlinear, least-squares optimizer to compute the optimal state parameters such that a digital computer-generated model image matches the digitized image acquired from the real system. The difference between IPO and prescription- retrieval algorithms is that IPO is specifically designed to utilize infocus images only. Although the restriction to in-focus images limits IPO to calculating only the lowest-order wave front aberrations, it also causes the resulting computation to take much less time because fewer degrees of freedom are included in the optimization process. In the prescription retrieval software developed at JPL, the model images are generated using the ray-trace/physical optics program, MACOS. IPO, on the other hand, uses a linear sensitivity matrix to compute the exit-pupil wave front from the system parameters; the wave front is then converted into a complex pupil field, which is then propagated to the image plane via a fast Fourier transform. This approach is computationally faster and requires less computer memory than is needed for prescription retrieval.

Ohara, Catherine↗

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗

Identification and Quantification of Beta-Emitters in Waste Packages by Segmented Gamma-Scanning - 20114

A commonly applied method for the non-destructive characterization of the radioactive inventory of waste packages (e.g. 200-l drums) is segmented gamma-scanning. The gamma-emitting inventory is identified via their characteristic lines in the measured spectra. The corresponding net peak areas allow for quantification applying appropriate models. The identification and quantification of beta-emitters present in the waste package require further evaluation. While some of them emit gamma-rays, too, which can be used for identification and quantification, pure beta-emitters contribute to the gamma-spectra only by their Bremsstrahlung-spectra. {sup 32}P, {sup 90}Sr and {sup 90}Y are typical representatives of these isotopes. A method is developed for identification and quantification of these pure beta-emitters in radioactive waste packages. Origin of the procedure is the evaluation of the measured gamma-spectrum. After the identification of all lines present in the spectrum (characteristic gamma-lines, single- and double-escape-lines, X-ray-lines, annihilation peak etc.) this information is used together with calibration data of the detection system and further a-priori information like matrix composition, cross-section data from databases etc. to simulate the spectra without the Bremsstrahlung-components by an appropriate method. This may be Monte Carlo simulations or, like in our case, a computer code taking into account mathematical descriptions of the physical effects like photo effect, (multiple) Compton scattering, backscattering etc. and the attenuation effects of the waste matrix. In any case, the resulting spectrum must simulate the real spectrum without its Bremsstrahlung-component as good as possible. Subtracting the simulated from the measured spectrum then results in the Bremsstrahlung-components caused by the beta-emitters. Prior to evaluation, a set of Bremsstrahlung-spectra is calculated and stored for different beta-emitters in different matrices using the Bethe-Heitler equation. This data set can be extended for new conditions, if necessary, and is allocated in a data base for future application. Applying a non-linear optimization using the generalized reduced gradient method for comparing the calculated with the derived Bremsstrahlung-spectra results in the identification of the beta-emitter and a factor, which is proportional to its activity. The proportionality is determined by previous calibration measurements. The application of the method is demonstrated by measurements on a 200-l mock-up drum and a real waste package. (authors)

07 ISOTOPE AND RADIATION SOURCES↗

Computation of maximum gust loads in nonlinear aircraft using a new method based on the matched filter approach and numerical optimization

Time-correlated gust loads are time histories of two or more load quantities due to the same disturbance time history. Time correlation provides knowledge of the value (magnitude and sign) of one load when another is maximum. At least two analysis methods have been identified that are capable of computing maximized time-correlated gust loads for linear aircraft. Both methods solve for the unit-energy gust profile (gust velocity as a function of time) that produces the maximum load at a given location on a linear airplane. Time-correlated gust loads are obtained by re-applying this gust profile to the airplane and computing multiple simultaneous load responses. Such time histories are physically realizable and may be applied to aircraft structures. Within the past several years there has been much interest in obtaining a practical analysis method which is capable of solving the analogous problem for nonlinear aircraft. Such an analysis method has been the focus of an international committee of gust loads specialists formed by the U.S. Federal Aviation Administration and was the topic of a panel discussion at the Gust and Buffet Loads session at the 1989 SDM Conference in Mobile, Alabama. The kinds of nonlinearities common on modern transport aircraft are indicated. The Statical Discrete Gust method is capable of being, but so far has not been, applied to nonlinear aircraft. To make the method practical for nonlinear applications, a search procedure is essential. Another method is based on Matched Filter Theory and, in its current form, is applicable to linear systems only. The purpose here is to present the status of an attempt to extend the matched filter approach to nonlinear systems. The extension uses Matched Filter Theory as a starting point and then employs a constrained optimization algorithm to attack the nonlinear problem.

Pototzky, Anthony S.↗

An Efficient Numerical Algorithm for Solving Data Driven Feedback Control Problems

The goal of this paper is to solve a class of stochastic optimal control problems numerically, in which the state process is governed by an Itô type stochastic differential equation with control process entering both in the drift and the diffusion, and is observed partially. The optimal control of feedback form is determined based on the available observational data. In this work, we call this type of control problems the data driven feedback control. The computational framework that we introduce to solve such type of problems aims to find the best estimate for the optimal control as a conditional expectation given the observational information. To make our method feasible in providing timely feedback to the controlled system from data, we develop an efficient stochastic optimization algorithm to implement our computational framework.

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↗

Delivery drone route planning over a battery swapping network

Many enterprises invest on drone delivery research and development to drop off packages at consumers’ doorsteps in a matter of minutes. We study delivery drone route planning over a battery swapping network allowing farther reach by penetrating current battery capacity constraints. A mixed-integer nonlinear programming model is created to plan efficient drone routing over the swapping machines by minimizing the delivery lead time. We develop an exact solution method, evaluate its performance, and compare it with a straightforward nonlinear solver application. A case study highlights the applicability of the model. Data and source code to the solver are publicly shared.

drone battery swapping↗

Refueling infrastructure planning in intercity networks considering route choice and travel time delay for mixed fleet of electric and conventional vehicles

The range anxiety has been a major factor that affects the market acceptance of electric vehicles. Even with the recent development of battery technologies, a lack of charging stations and range anxiety are still significant concerns, specifically for intercity trips. This calls for more investments in building charging stations and advancing battery technologies to increase the market share of electric vehicles and improve sustainability. This study suggests a configuration for plug-in electric vehicle charging infrastructure to support long-distance intercity trips of electric vehicles at the network level. A model is proposed to minimize the total system cost including infrastructure investment (building charging stations/spots) and travel time delays (charging time, waiting time in the queue, and detour time to access charging stations). This study fills existing gaps in the literature by capturing realistic patterns of travel demand and considering flow-dependent charging delays at charging stations. Furthermore, the proposed model, which is formulated as a mixed-integer program with nonlinear constraints, solves the optimization problem at the network level. At the network level, impacts of charging station locations on the traffic assignment problem with a mixed fleet of electric and conventional vehicles need to be considered. To this end, a traffic assignment module is integrated with a simulated annealing algorithm. The numerical experiments show a satisfactory application of the model for a full-scale case study (intercity network in Michigan). The solution quality and efficiency of the proposed solution algorithm are evaluated against those of an enumeration approach for a small case study. The results suggest that even for the current market share and charging stations’ setting, a significant investment is needed to support intercity trips without range anxiety issues and with acceptable delays. Additionally, through sensitivity analyses, the required infrastructure and battery investments to support intercity trips with acceptable delays are established for hypothetical increased market shares and battery size in the future.

42 ENGINEERING↗

A learned closure method applied to phase mixing in a turbulent gradient-driven gyrokinetic system in simple geometry

We present a new method for formulating closures that learn from kinetic simulation data. We apply this method to phase mixing in a simple gyrokinetic turbulent system – temperature-gradient-driven turbulence in an unsheared slab. The closure, called the learned multi-mode (LMM) closure, is constructed by, first, extracting an optimal basis from a nonlinear kinetic simulation using singular value decomposition. Subsequent nonlinear fluid simulations are projected onto this basis and the results are used to formulate the closure. We compare the closure with other closures schemes over a broad range of the relevant two-dimensional parameter space (collisionality and gradient drive). We find that the turbulent kinetic system produces phase-mixing rates much lower than the linear expectations, which the LMM closure is capable of capturing. We also compare radial heat fluxes. A Hammett–Perkins closure, generalized to include collisional effects, is quite successful throughout the parameter space, producing ${\sim }14\,\%$ root-mean-square (r.m.s.) error. The LMM closure is also very effective: when trained at three (two) points (in a 35 point parameter grid), the LMM closure produces $8\,\%$ ( $12\,\%$ ) r.m.s. errors. The LMM procedure can be readily generalized to other closure problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗