SEARCH · Search NASA

Results for “convex 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.

SourceResearch connectionFrom yearThrough year

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

At least 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimension. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Furthermore, our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

DOE OSTI2020

Mathematical Models for Optimization of Grid-Integrated Energy Storage Systems

Energy storage has been proven to yield positive effects on planning, operation and control of electric grids. It has become a crucial task to properly model the energy storage systems (ESS) under the framework of grid optimization on transmission and distribution networks including microgrids. This paper presents a review on mathematical models and test cases of ESSs used for grid optimization studies, where the network constraints of power systems are included. The existing ESS models are mainly classified into two categories – linear and nonlinear models. The two main categories are further divided into several subcategories respectively; such as mixed-integer linear and convex nonlinear sub-categories. Based on the review and discussions, this paper aims at providing suggestions for choosing proper ESS models for specific grid optimization studies considering the chosen power network model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1989

Trajectory optimization and guidance for an aerospace plane

The first step in the approach to developing guidance laws for a horizontal take-off, air breathing single-stage-to-orbit vehicle is to characterize the minimum-fuel ascent trajectories. The capability to generate constrained, minimum fuel ascent trajectories for a single-stage-to-orbit vehicle was developed. A key component of this capability is the general purpose trajectory optimization program OTIS. The pre-production version, OTIS 0.96 was installed and run on a Convex C-1. A propulsion model was developed covering the entire flight envelope of a single-stage-to-orbit vehicle. Three separate propulsion modes, corresponding to an after burning turbojet, a ramjet and a scramjet, are used in the air breathing propulsion phase. The Generic Hypersonic Aerodynamic Model Example aerodynamic model of a hypersonic air breathing single-stage-to-orbit vehicle was obtained and implemented. Preliminary results pertaining to the effects of variations in acceleration constraints, available thrust level and fuel specific impulse on the shape of the minimum-fuel ascent trajectories were obtained. The results show that, if the air breathing engines are sized for acceleration to orbital velocity, it is the acceleration constraint rather than the dynamic pressure constraint that is active during ascent.

Mease, Kenneth D.↗

NASA NTRS1990

The shape of Eros

Monte Carlo simulations are presently used to optimize estimation, ascertain associated errors, and guide bias-correction procedures, for the Eros polar silhouette convex hull that has been estimated from radar echo spectra. This hull is trapezoidal; this nonaxisymmetric shape may account for odd harmonics in Eros' echo spectral signature as a function of rotation phase. Additional constraints have been obtained for the figure of Eros through the inversion of the optical lightcurve to estimate the asteroid's two-dimensional average of the three-dimensional shape. This 'mean cross-section' and the polar silhouette exhibit similar elongations.

Ostro, S. J.↗

DOE OSTI2021

Variational Information Planning for Sequential Decision Making

We consider the setting of sequential decision making where, at each stage, potential actions are evaluated based on expected reduction in posterior uncertainty, given by mutual information (MI). As MI typically lacks a closed form, we propose an approach which maintains variational approximations of, both, the posterior and MI utility. Our planning objective extends an established variational bound on MI to the setting of sequential planning. The result, variational information planning (VIP), is an efficient method for sequential decision making. We further establish convexity of the variational planning objective and, under conditional exponential family approximations, we show that the optimal MI bound arises from a relaxation of the well-known exponential family moment matching property. Here, we demonstrate VIP for sensor selection, experiment design, and active learning, where it meets or exceeds methods requiring more computation, or those specialized to the task.

Pacheco, Jason↗

NASA NTRS1990

Global nonlinear optimization of spacecraft protective structures design

The global optimization of protective structural designs for spacecraft subject to hypervelocity meteoroid and space debris impacts is presented. This nonlinear problem is first formulated for weight minimization of the space station core module configuration using the Nysmith impact predictor. Next, the equivalence and uniqueness of local and global optima is shown using properties of convexity. This analysis results in a new feasibility condition for this problem. The solution existence is then shown, followed by a comparison of optimization techniques. Finally, a sensitivity analysis is presented to determine the effects of variations in the systemic parameters on optimal design. The results show that global optimization of this problem is unique and may be achieved by a number of methods, provided the feasibility condition is satisfied. Furthermore, module structural design thicknesses and weight increase with increasing projectile velocity and diameter and decrease with increasing separation between bumper and wall for the Nysmith predictor.

Mog, R. A.↗

DOE OSTI2020

Optimal economic operation of liquid petroleum products pipeline systems

The majority of overland transport needs for crude petroleum and refined petroleum products are met using pipelines. Numerous studies have developed optimization methods for design of these systems in order to minimize construction costs while meeting capacity requirements. Here, we formulate problems to optimize the operations of existing single liquid commodity pipeline systems subject to physical flow and pump engineering constraints. The objectives are to maximize the economic value created for users of the system and to minimize operating costs. We present a general computational method for this class of continuous, non-convex nonlinear programs, and examine the use of pump operating settings and flow allocations as decision variables. Furthermore, the approach is applied to compute optimal operating regimes and perform engineering economic sensitivity analyses for a case study of a crude oil pipeline developed using publicly available data.

02 PETROLEUM↗

DOE OSTI2021

Effect of Nozzle Curvature on Supersonic Gas Jets Used in Laser-Plasma Acceleration

Supersonic gas jets produced by converging-diverging (C-D) nozzles are commonly used as targets for laser-plasma acceleration (LPA) experiments. A major point of interest for these targets is the gas density at the region of interaction where the laser ionizes the gas plume to create a plasma, providing the acceleration structure. Tuning the density profiles at this interaction region is crucial to LPA optimization. A "flat-top" density profile is desired at this line of interaction to control laser propagation and high energy electron acceleration, while a short high-density profile is often preferred for acceleration of lower-energy tightly-focused laser-plasma interactions. A particular design parameter of interest is the curvature of the nozzle's diverging section. We examine three nozzle designs with different curvatures: the concave "bell", straight conical and convex "trumpet" nozzles. We demonstrate that, at mm-scale distances from the nozzle exit, the trumpet and straight nozzles, if optimized, produce "flat-top" density profiles whereas the bell nozzle creates focused regions of gas with higher densities. An optimization procedure for the trumpet nozzle is derived and compared to the straight nozzle optimization process. We find that the trumpet nozzle, by providing an extra parameter of control through its curvature, is more versatile for creating flat-top profiles and its optimization procedure is more refined compared to the straight nozzle and the straight nozzle optimization process. Furthermore, we present results for different nozzle designs from computational fluid dynamics (CFD) simulations performed with the program ANSYS Fluent and verify them experimentally using neutral density interferometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2018

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads

This paper considers power distribution networks with distributed energy resources and designs an incentive-based algorithm that allows the network operator and customers to pursue given operational and economic objectives while concurrently ensuring that voltages are within prescribed limits. Heterogeneous DERs with continuous and discrete control commands are considered. We address four major challenges: discrete decision variables, non-convexity due to a Stackelberg game structure, unavailability of private information from customers, and asynchronous operation. Starting from a non-convex setting, we develop a distributed stochastic dual algorithm that solves a relaxed problem, and prove that the proposed algorithm achieves the global optimal solution of the original problem on average. Feasible values for discrete decision variables are also recovered. Stability of the algorithm is analytically established and numerically corroborated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2018

Enhanced Light Extraction from OLEDs Fabricated on Patterned Plastic Substrates

A key scientific and technological challenge in organic light-emitting diodes (OLEDs) is enhancing the light outcoupling factor η out , which is typically <20%. This paper reports experimental and modeling results of a promising approach to strongly increase η out by fabricating OLEDs on novel flexible nanopatterned substrates that result in a >2× enhancement in green phosphorescent OLEDs (PhOLEDs) fabricated on corrugated polycarbonate (PC). The external quantum efficiency (EQE) reaches 50% (meaning ηout ≥50%); it increases 2.6x relative to a glass/ITO device and 2× relative to devices on glass/poly(3,4-ethylenedioxythiophene):polystyrene sulfonate (PEDOT:PSS) or flat PC/PEDOT:PSS. A significant enhancement is also observed for blue PhOLEDs with EQE 1.7× relative to flat PC. The corrugated PC substrates are fabricated efficiently and cost-effectively by direct room-temperature molding. These substrates successfully reduce photon losses due to trapping/waveguiding in the organic+anode layers and possibly substrate, and losses to plasmons at the metal cathode. Focused ion beam gauged the conformality of the OLEDs. Dome-shaped convex nanopatterns with height of ~280–400 nm and pitch ~750–800 nm were found to be optimal. Lastly, substrate design and layer thickness simulations, reported first for patterned devices, agree with the experimental results that present a promising method to mitigate photon loss paths in OLEDs.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1990

Large scale nonlinear numerical optimal control for finite element models of flexible structures

This paper discusses the development of large scale numerical optimal control algorithms for nonlinear systems and their application to finite element models of structures. This work is based on our expansion of the optimal control algorithm (DDP) in the following steps: improvement of convergence for initial policies in non-convex regions, development of a numerically accurate penalty function method approach for constrained DDP problems, and parallel processing on supercomputers. The expanded constrained DDP algorithm was applied to the control of a four-bay, two dimensional truss with 12 soft members, which generates geometric nonlinearities. Using an explicit finite element model to describe the structural system requires 32 state variables and 10,000 time steps. Our numerical results indicate that for constrained or unconstrained structural problems with nonlinear dynamics, the results obtained by our expanded constrained DDP are significantly better than those obtained using linear-quadratic feedback control.

Shoemaker, Christine A.↗

DOE OSTI2016

TH-EF-BRB-04: 4π Dynamic Conformal Arc Therapy Dynamic Conformal Arc Therapy (DCAT) for SBRT

Purpose: To develop an efficient and effective trajectory optimization methodology for 4π dynamic conformal arc treatment (4π DCAT) with synchronized gantry and couch motion; and to investigate potential clinical benefits for stereotactic body radiation therapy (SBRT) to breast, lung, liver and spine tumors. Methods: The entire optimization framework for 4π DCAT inverse planning consists of two parts: 1) integer programming algorithm and 2) particle swarm optimization (PSO) algorithm. The integer programming is designed to find an optimal solution for arc delivery trajectory with both couch and gantry rotation, while PSO minimize a non-convex objective function based on the selected trajectory and dose-volume constraints. In this study, control point interaction is explicitly taken into account. Beam trajectory was modeled as a series of control points connected together to form a deliverable path. With linear treatment planning objectives, a mixed-integer program (MIP) was formulated. Under mild assumptions, the MIP is tractable. Assigning monitor units to control points along the path can be integrated into the model and done by PSO. The developed 4π DCAT inverse planning strategy is evaluated on SBRT cases and compared to clinically treated plans. Results: The resultant dose distribution of this technique was evaluated between 3D conformal treatment plan generated by Pinnacle treatment planning system and 4π DCAT on a lung SBRT patient case. Both plans share the same scale of MU, 3038 and 2822 correspondingly to 3D conformal plan and 4π DCAT. The mean doses for most of OARs were greatly reduced at 32% (cord), 70% (esophagus), 2.8% (lung) and 42.4% (stomach). Conclusion: Initial results in this study show the proposed 4π DCAT treatment technique can achieve better OAR sparing and lower MUs, which indicates that the developed technique is promising for high dose SBRT to reduce the risk of secondary cancer.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗

NASA NTRS2000

Robust Control of Uncertain Systems via Dissipative LQG-Type Controllers

Optimal controller design is addressed for a class of linear, time-invariant systems which are dissipative with respect to a quadratic power function. The system matrices are assumed to be affine functions of uncertain parameters confined to a convex polytopic region in the parameter space. For such systems, a method is developed for designing a controller which is dissipative with respect to a given power function, and is simultaneously optimal in the linear-quadratic-Gaussian (LQG) sense. The resulting controller provides robust stability as well as optimal performance. Three important special cases, namely, passive, norm-bounded, and sector-bounded controllers, which are also LQG-optimal, are presented. The results give new methods for robust controller design in the presence of parametric uncertainties.

Joshi, Suresh M.↗

DOE OSTI2017

Optimal Allocation of Dynamic Var Sources Using the Voronoi Diagram Method Integrating Linear Programing

Dynamic reactive power (var) sources can effectively mitigate fault-induced delayed voltage recovery (FIDVR) issues. This paper optimizes the sizes of dynamic var sources at given locations against FIDVR issues under severe contingencies. First, the geometric characteristics about the non-convex solution space of this problem are studied. Accordingly, a Voronoi diagram approach integrating linear programming (LP) is proposed, which disperses a number of sample points of potential solutions in the searching space to construct a Voronoi diagram blending the local cost functions over the entire space by Barycentric interpolation in Voronoi regions. New sample points are then recursively added, including the tentative optimal point using LP, the most depopulated area point ensuring global fidelity, and the connecting point, until the stopping criterion is met. The new approach is demonstrated in detail on the WSCC 9-bus system. A case study on the NPCC 140-bus system also validates that the proposed approach can effectively estimate the boundary and the geometry of the feasible solution region in the searching space and find the optimal solution.

barycentric interpolation↗

NASA NTRS1992

Fuel consumption in optimal control

A method has been developed for comparing three optimal control strategies based on fuel consumption. A general cost function minimization procedure was developed by applying two theorems associated with convex sets. Three cost functions associated with control saturation, pseudofuel, and absolute fuel are introduced and minimized. The first two cost functions led to the bang-bang and continuous control strategies, and the minimization of absolute fuel led to an impulsive strategy. The three control strategies were implemented on two elementary systems and a comparison of fuel consumption was made. The impulse control strategy consumes significantly less fuel than the continuous and bang-bang control strategies. This comparison suggests a potential for fuel savings in higher-order systems using impulsive control strategies. However, since exact solutions to fuel-optimal control for large-order systems are difficult if not impossible to achieve, the alternative is to develop near-optimal control strategies.

Redmond, Jim↗