Search NASA⌕ Search

SEARCH · Search NASA

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

pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations

We describe pyomo.dae, an open source Python-based modeling framework that enables high-level abstract specification of optimization problems with differential and algebraic equations. The pyomo.dae framework is integrated with the Pyomo open source algebraic modeling language, and is available at http://www.pyomo.org. One key feature of pyomo.dae is that it does not restrict users to standard, predefined forms of differential equations, providing a high degree of modeling flexibility and the ability to express constraints that cannot be easily specified in other modeling frameworks. Other key features of pyomo.dae are the ability to specify optimization problems with high-order differential equations and partial differential equations, defined on restricted domain types, and the ability to automatically transform high-level abstract models into finite-dimensional algebraic problems that can be solved with off-the-shelf solvers. Moreover, pyomo.dae users can leverage existing capabilities of Pyomo to embed differential equation models within stochastic and integer programming models and mathematical programs with equilibrium constraint formulations. Collectively, these features enable the exploration of new modeling concepts, discretization schemes, and the benchmarking of state-of-the-art optimization solvers.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Optimization for the Design and Control of Large-Scale Systems (LDRD Final Report)

Engineering decisions are often formulated as optimization problems such as the optimal design or control of physical systems. In these applications, the resulting optimization problems are constrained by large-scale simulations involving systems of partial differential equations (PDEs), ordinary differential equations (ODEs), and differential algebraic equations (DAEs). In addition, critical components of these systems are fraught with uncertainty, including unverifiable modeling assumptions, unknown boundary and initial conditions, and uncertain coefficients. Typically, these components are estimated using noisy and incomplete data from a variety of sources (e.g., physical experiments). The lack of knowledge of the true underlying probabilistic characterization of model inputs motivates the need for optimal solutions that are robust to this uncertainty. In this report, we introduce a framework for handling "distributional" uncertainties in the context of simulation-based optimization. This includes a novel measure discretization technique that will lead to an adaptive optimization algorithm tailored to exploit the structures inherent to simulation- based optimization.

42 ENGINEERING↗

Kinetics-Informed Neural Networks

Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize feed-forward artificial neural networks as basis functions to solve ordinary differential equations (ODEs) constrained by differential algebraic equations (DAEs) that describe microkinetic models (MKMs). We present an algebraic framework for the mathematical description and classification of reaction networks, types of elementary reaction, and chemical species. Under this framework, we demonstrate that the simultaneous training of neural nets and kinetic model parameters in a regularized multi-objective optimization setting leads to the solution of the inverse problem through the estimation of kinetic parameters from synthetic experimental data. We analyze a set of scenarios to establish the extent to which kinetic parameters can be retrieved from transient kinetic data, and assess the robustness of the methodology with respect to statistical noise. Furthermore, this approach to inverse kinetic ODEs can assist in the elucidation of reaction mechanisms based on transient data.

36 MATERIALS SCIENCE↗

TAS: 89 0227: TAS Recovery Act - Optimization and Control of Electric Power Systems: ARRA

The name SuperOPF is used to refer several projects, problem formulations and soft-ware tools intended to extend, improve and re-define some of the standard methods of optimizing electric power systems. Our work included applying primal-dual interior point methods to standard AC optimal power flow problems of large size, as well as extensions of this problem to include co-optimization of multiple scenarios. The original SuperOPF problem formulation was based on co-optimizing a base scenario along with multiple post-contingency scenarios, where all AC power flow models and constraints are enforced for each, to find optimal energy contracts, endogenously determined locational reserves and appropriate nodal energy prices for a single period optimal power flow problem with uncertainty. This led to example non-linear programming problems on the order of 1 million constraints and half a million variables. The second generation SuperOPF formulation extends this by adding multiple periods and multiple base scenarios per period. It also incorporates additional variables and constraints to model load following reserves, ramping costs, and storage resources. A third generation of the multi-period SuperOPF, adds both integer variables and a receding horizon framework in which the problem type is more challenging (mixed integer), the size is even larger, and it must be solved more frequently, pushing the limits of currently available algorithms and solvers. The consideration of transient stability constraints in optimal power flow (OPF) problems has become increasingly important in modern power systems. Transient stability constrained OPF (TSCOPF) is a nonlinear optimization problem subject to a set of algebraic and differential equations. Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability in OPF. To handle the dynamics in TSCOPF, the set of differential equations can be approximated or converted into equivalent algebraic equations before they are included in an OPF formulation. In Chapter 4, a rigorous evaluation of using a predefined and fixed threshold for rotor angles as a mean to determine transient stability of the system is developed. TSCOPF can be modeled as a large-scale nonlinear programming problem including the constraints of differential-algebraic equations (DAE). Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability constraint in OPF. Unfortunately, even the current best TSCOPF solvers still suffer from the curse of dimensionality and unacceptable computational time, especially for large-scale power systems with multiple contingencies. In chapter 5, thse issues will be addressed and a new method to incorporate the transient stability constraints will be presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Direction-Modulated Brachytherapy for High-Dose-Rate Treatment of Cervical Cancer. I: Theoretical Design

Purpose: To demonstrate that utilization of the direction-modulated brachytherapy (DMBT) concept can significantly improve treatment plan quality in the setting of high-dose-rate (HDR) brachytherapy for cervical cancer. Methods and Materials: The new, MRI-compatible, tandem design has 6 peripheral holes of 1.3-mm diameter, grooved along a nonmagnetic tungsten-alloy rod (ρ = 18.0 g/cm{sup 3}), enclosed in Delrin tubing (polyoxymethylene, ρ = 1.41 g/cm{sup 3}), with a total thickness of 6.4 mm. The Monte Carlo N-Particle code was used to calculate the anisotropic {sup 192}Ir dose distributions. An in-house-developed inverse planning platform, geared with simulated annealing and constrained-gradient optimization algorithms, was used to replan 15 patient cases (total 75 plans) treated with a conventional tandem and ovoids (T and O) applicator. Prescription dose was 6 Gy. For replanning, we replaced the conventional tandem with that of the new DMBT tandem for optimization but left the ovoids in place and kept the dwell positions as originally planned. All DMBT plans were normalized to match the high-risk clinical target volume V100 coverage of the T and O plans. Results: In general there were marked improvements in plan quality for the DMBT plans. On average, D2cc for the bladder, rectum, and sigmoid were reduced by 0.59 ± 0.87 Gy (8.5% ± 28.7%), 0.48 ± 0.55 Gy (21.1% ± 27.2%), and 0.10 ± 0.38 Gy (40.6% ± 214.9%) among the 75 plans, with best single-plan reductions of 3.20 Gy (40.8%), 2.38 Gy (40.07%), and 1.26 Gy (27.5%), respectively. The high-risk clinical target volume D90 was similar, with 6.55 ± 0.96 Gy and 6.59 ± 1.06 Gy for T and O and DMBT, respectively. Conclusions: Application of the DMBT concept to cervical cancer allowed for improved organ at risk sparing while achieving similar target coverage on a sizeable patient population, as intended, by maximally utilizing the anatomic information contained in 3-dimensional imaging. A series of mechanical and clinical validations are to be followed.

62 RADIOLOGY AND NUCLEAR MEDICINE↗