Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear programming problem”

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 163 records · Page 9

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗

Solving the Grid Optimization Competition Challenge 3 Problem

The Grid Optimization Competition Challenge 3 Problem posed a multiperiod security-constrained unit commitment problem with base-case AC power flow. The problem formulation includes binary unit commitment decisions, nonlinear AC power flow and balance, dispatchable loads, and linearized contingency real power flow, among other features. This talk will present a modified consensus ADMM algorithm, which splits the problem into mixed-integer linear and nonlinear components, as a heuristic solution method for this large-scale mixed integer nonlinear program. We will present some computational results from the competition for our implementation and reflect on the challenges of participating the grid optimization competition.

AC power flow↗

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixed-integer nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.

42 ENGINEERING↗

Distributed Load Restoration in Unbalanced Active Distribution Systems

We present that the resilience of modern power systems has been constantly threatened by various natural disasters and manmade attacks. Under those threats, fast and automatic restoration actions are critical for restoring impacted systems to normal operating conditions and preventing from additional disastrous consequences. Smart grid technologies, such as distributed energy resources (DERs) and microgrids, provide both opportunities and challenges for distribution system restoration. In this paper, distributed load restoration (DLR), in unbalanced active distribution networks is developed using the alternating direction method of multipliers (ADMM) algorithm. The step-by-step restoration actions are provided to schedule the output of DERs and distribution system control devices, as well as the power consumption from transmission system restoration. The nonlinearities from three-phase unbalanced power flow and distribution components modeling are relaxed into a convex quadratic programming model. Then, the problem is decomposed into subproblems for each node by applying ADMM-DLR; and solves through each agent by exchanging limited information with neighboring nodes in an iterative procedure. The developed models and algorithms are validated and demonstrated through testing of the IEEE 13-node and 123-node test feeders. Lastly, simulation results demonstrate the effectiveness of restoring unbalanced distribution system with the hybrid bottom-up and top-down restoration strategies.

14 SOLAR ENERGY↗

Simulation and optimization of pressure swing adsorption systmes using reduced-order modeling

Over the past three decades, pressure swing adsorption (PSA) processes have been widely used as energyefficient gas separation techniques, especially for high purity hydrogen purification from refinery gases. Models for PSA processes are multiple instances of partial differential equations (PDEs) in time and space with periodic boundary conditions that link the processing steps together. The solution of this coupled stiff PDE system is governed by steep fronts moving with time. As a result, the optimization of such systems represents a significant computational challenge to current differential algebraic equation (DAE) optimization techniques and nonlinear programming algorithms. Model reduction is one approach to generate cost-efficient low-order models which can be used as surrogate models in the optimization problems. This study develops a reducedorder model (ROM) based on proper orthogonal decomposition (POD), which is a low-dimensional approximation to a dynamic PDE-based model. The proposed method leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization and making the optimization problem computationally efficient. The method has been applied to the dynamic coupled PDE-based model of a twobed four-step PSA process for separation of hydrogen from methane. Separate ROMs have been developed for each operating step with different POD modes for each of them. A significant reduction in the order of the number of states has been achieved. The reduced-order model has been successfully used to maximize hydrogen recovery by manipulating operating pressures, step times and feed and regeneration velocities, while meeting product purity and tight bounds on these parameters. Current results indicate the proposed ROM methodology as a promising surrogate modeling technique for cost-effective optimization purposes.

08 HYDROGEN↗

Porting the Nonlinear Optimization Library HiOp to Accelerator-Based Hardware Architectures

While interior point method has been the centerpiece of nonlinear programming tools used in science and engineering, its reliance on linear solvers that can tackle sparse symmetric indefinite and highly ill-conditioned problems made it difficult to implement it effectively on hardware accelerators. HiOp optimization package attempts to provide an implementation of the interior point method suitable for hardware accelerators by compressing the original sparse problem to produce an underlying linear problem that is dense and of manageable size. Implementations of dense linear solvers are more mature and utilize hardware accelerators better than their sparse counterparts. There is a number of important domain problems, such as optimal power flow analysis for power grids, where the sparse problem can be effectively compressed and deploying dense linear solver within the interior point method can improve performance. Here we describe a portable implementation of HiOp optimization engine, which uses a linear solver from Magma library and runs entirely on hardware accelerators. To compress the problem, HiOp uses customized mixed dense-sparse linear algebra. All HiOp kernels are implemented using Umpire and RAJA portability libraries. We describe details of the implementation and discuss trade-offs between performance, portability and development cost.

97 MATHEMATICS AND COMPUTING↗

Models and Strategies for Optimal Demand Side Management in the Chemical Industries

Deregulation and the increase of renewable electricity generation from wind and solar photovoltaics have transformed the U.S. electricity market. Economic and environmental benefits notwithstanding, the presence of renewables has increased variability and uncertainty on the supply side of the grid. Managing demand, rather than generation – a strategy referred to as “demand response (DR)” – is an attractive approach for mitigating this imbalance. DR efforts aim to reduce electricity usage during peak demand times, lessening stress on the grid. Industrial users are particularly attractive entities for DR participation since they present large, localized loads that can provide significant relief on grid demand and –unlike other large loads, such as buildings – are minimally dependent on human needs and preferences. In this project, we accomplished three main objectives. (1) We developed data-driven low-order DR scheduling-relevant dynamic models of chemical processes. Concurrently, we studied the formulation and solution of the associated optimal DR production scheduling problems. (a) A prototype air separation unit (ASU) model was used to generate simulated operating data for initial modeling efforts, which enabled the later use of industrial data for data-driven modeling. (b) We utilized Hammerstein-Wiener (HW) and Finite Step Response (FSR) models to represent nonlinear plant dynamics. (c) The HW models were linearized using exact linearization so they could potentially be embedded in power system models, which are formulated as mixed integer linear programs (MILPs). (d) We solved DR optimization problems under uncertainty and found that even naïve predictions of electricity price and product demand led to significant cost savings benefits. (2) Our DR scheduling optimization problem formulations are amenable to real-time solution. (a) We utilized Lagrangian Relaxation (LR) to efficiently solve the optimization problem by decoupling subproblems linked by complicating constraints. (b) We have achieved computation times for the 3-day DR scheduling problem of an ASU as low as 1.88 minutes. (3) Our representations of the DR behavior of chemical process as grid-level batteries were embedded in power system models. (a) For a small-scale grid, we found that incorporating the dynamics of the chemical plant in the optimal power flow calculations resulted in better resource management leading to up to 15% and 46% cost reduction for the grid and chemical plant operations, respectively, during periods of power line congestion. We have published several works dedicated to modeling and solving DR optimization problems from the user side. These were published in top peer-reviewed journals and are summarized in this report. The most recent work (and papers in preparation) considers DR scheduling from the grid side. Future efforts will consider networked plants (e.g., air separation units operating on a common pipeline) for DR participation, which is expected to amplify the capabilities of industrial DR participants to perform load-shifting. Our consideration of uncertainty in DR has inspired future directions in this area as well: we plan to develop multistage methods to fully account for the effects of uncertainty in DR scheduling.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Model predictive control for optimal dispatch of chillers and thermal energy storage tank in airports

Cost of energy consumption is one of the biggest operational cost for airports, and it is increasing from time to time as airports expand to support growing number of passengers. Various factors affect the energy consumption including efficiency of airport Heating Ventilation and Air conditioning (HVAC) systems, which in turn depends on the efficiency of individual subsystems. Here, in this paper, we present an optimal scheduling method for the central plant system at Dallas Fort Worth airport, involving chillers, pumps, and a thermal energy storage (TES) system. A model predictive control (MPC) problem is formulated to minimize both energy and demand charge costs while satisfying the cooling needs of the airport. The proposed Mixed-Integer Nonlinear Programming (MINLP) formulation includes performance curve based models for chillers and pumps and a simplified state of charge model for TES. The formulation also includes predictions of cooling load and chilled water return temperature. Simulation results for a month in summer show savings around 10% compared to the baseline. Initial recommendations based on insights from simulation results to the manual operation procedures resulted in significant savings. Field test results show a 7% chiller efficiency improvement.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Nonlinear Acceleration of Transport Criticality Problems

We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-based, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system) and a factor of 5 in a non-diffusive system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Nonlinear Acceleration of Transport Criticality Problems [Slides]

We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-brused, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system, and a factor of 5 in a non-diffusive system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improve earthquake hypocenter using adaptive simulated annealing inversion in regional tectonic, volcano tectonic, and geothermal observation

Observation of earthquakes is routinely used widely in tectonic activity observation, and also in local scale such as volcano tectonic and geothermal activity observation. It is necessary for determining the location of precise hypocenter which the process involves finding a hypocenter location that has minimum error between the observed and the calculated travel times. When solving this nonlinear inverse problem, simulated annealing inversion method can be applied to such global optimization problems, which the convergence of its solution is independent of the initial model. In this study, we developed own program codeby applying adaptive simulated annealing inversion in Matlab environment. We applied this method to determine earthquake hypocenter using several data cases which are regional tectonic, volcano tectonic, and geothermal field. The travel times were calculated using ray tracing shooting method. We then compared its results with the results using Geiger’s method to analyze its reliability. Our results show hypocenter location has smaller RMS error compared to the Geiger’s result that can be statistically associated with better solution. The hypocenter of earthquakes also well correlated with geological structure in the study area. Werecommend using adaptive simulated annealing inversion to relocate hypocenter location in purpose to get precise and accurate earthquake location.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the DAKOTA software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of DAKOTA-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of DAKOTA's iterative analysis capabilities.

99 GENERAL AND MISCELLANEOUS↗

Fusion Simulation Program Execution Plan

The overall science goal of the FSP is to develop predictive simulation capability for magnetically confined fusion plasmas at an unprecedented level of integration and fidelity. This will directly support and enable effective U.S. participation in research related to the International Thermonuclear Experimental Reactor (ITER) and the overall mission of delivering practical fusion energy. The FSP will address a rich set of scientific issues together with experimental programs, producing validated integrated physics results. This is very well aligned with the mission of the ITER Organization to coordinate with its members the integrated modeling and control of fusion plasmas, including benchmarking and validation activities. Initial FSP research will focus on two critical areas: 1) the plasma edge and 2) whole device modeling including disruption avoidance. The first of these problems involves the narrow plasma boundary layer and its complex interactions with the plasma core and the surrounding material wall. The second requires development of a computationally tractable, but comprehensive model that describes all equilibrium and dynamic processes at a sufficient level of detail to provide useful prediction of the temporal evolution of fusion plasma experiments. The initial driver for the whole device model (WDM) will be prediction and avoidance of discharge-terminating disruptions, especially at high performance, which are a critical impediment to successful operation of machines like ITER. If disruptions prove unable to be avoided, their associated dynamics and effects will be addressed in the next phase of the FSP. The FSP plan targets the needed modeling capabilities by developing Integrated Science Applications (ISAs) specific to their needs. The Pedestal-Boundary model will include boundary magnetic topology, cross-field transport of multi-species plasmas, parallel plasma transport, neutral transport, atomic physics and interactions with the plasma wall. It will address the origins and structure of the plasma electric field, rotation, the L-H transition, and the wide variety of pedestal relaxation mechanisms. The Whole Device Model will predict the entire discharge evolution given external actuators (i.e., magnets, power supplies, heating, current drive and fueling systems) and control strategies. Based on components operating over a range of physics fidelity, the WDM will model the plasma equilibrium, plasma sources, profile evolution, linear stability and nonlinear evolution toward a disruption (but not the full disruption dynamics). The plan assumes that, as the FSP matures and demonstrates success, the program will evolve and grow, enabling additional science problems to be addressed. The next set of integration opportunities could include: 1) Simulation of disruption dynamics and their effects; 2) Prediction of core profile including 3D effects, mesoscale dynamics and integration with the edge plasma; 3) Computation of non-thermal particle distributions, self-consistent with fusion, radio frequency (RF) and neutral beam injection (NBI) sources, magnetohydrodynamics (MHD) and short-wavelength turbulence.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scalable Optimization Methods for Distribution Networks With High PV Integration

Here this paper proposes a suite of algorithms to determine the active- and reactive-power setpoints for photovoltaic (PV) inverters in distribution networks. The objective is to optimize the operation of the distribution feeder according to a variety of performance objectives and ensure voltage regulation. In general, these algorithms take a form of the widely studied ac optimal power flow (OPF) problem. For the envisioned application domain, nonlinear power-flow constraints render pertinent OPF problems nonconvex and computationally intensive for large systems. To address these concerns, we formulate a quadratic constrained quadratic program (QCQP) by leveraging a linear approximation of the algebraic power-flow equations. Furthermore, simplification from QCQP to a linearly constrained quadratic program is provided under certain conditions. The merits of the proposed approach are demonstrated with simulation results that utilize realistic PV-generation and load-profile data for illustrative distribution-system test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Nuclear Materials Packaging, Transportation, and Systems Analysis Group Software Quality Assurance Plan: ANSYS Mechanical Finite Element Analysis Software Version 2023R1

ANSYS Inc. develops and markets engineering simulation software and services used in the aerospace, automotive, manufacturing, electronics, biomedical, energy, defense, and many other industries. ANSYS is dedicated to engineering simulation and is the world’s leading software provider. ANSYS was founded in 1970 and is headquartered in Canonsburg, Pennsylvania. ANSYS provides an engineering analysis tool combining structural, thermal, computational fluid dynamics, acoustic, and electromagnetic simulation capabilities. ANSYS has two main programs, which use the same solvers: (1) Mechanical APDL (ANSYS Design Parametric Language), a Fortran-based coding platform, and (2) ANSYS Workbench, which uses a graphical user interface to aid in finite element analysis implementation. This plan covers both APDL and Workbench. The ANSYS computer program is a large-scale, multipurpose finite element program that can be used to solve several classes of engineering analyses. The analysis capabilities of ANSYS include the ability to solve static and dynamic structural analyses, steady-state and transient heat transfer problems, mode-frequency and buckling eigenvalue problems, static or time-varying magnetic analyses, and various types of field and coupled-field applications. The program contains many special features that allow nonlinearities or secondary effects such as plasticity, large strain, hyperelasticity, creep, swelling, large deflections, contact, stress stiffening, temperature dependency, material anisotropy, and radiation to be included in the solution. As ANSYS has been developed, other special capabilities such as substructuring, submodeling, random vibration, kinetostatics, kinetodynamics, free convection fluid analysis, acoustics, magnetics, piezoelectrics, coupled-field analysis, and design optimization have been added to the program. These capabilities contribute further to making ANSYS a multipurpose analysis tool for varied engineering disciplines. The ANSYS program has been in commercial use for over 50 years and has been used extensively in the aerospace, automotive, construction, electronic, energy services, manufacturing, nuclear, plastics, oil, and steel industries. Additionally, many consulting firms and hundreds of universities have used ANSYS for analysis, research, and educational purposes. ANSYS is recognized worldwide as one of the most widely used and capable programs of its type. Ansys design analysis software is the first created within a quality system with ISO 9001 certification, the internationally accepted quality standard. Product development, testing, maintenance and support processes also meet the United States Nuclear Regulatory Commission's quality requirements, as they have for nearly four decades. The Quality Assurance Service Agreement is suitable for the customers working in the nuclear industry who need to meet specific federal regulations including 10CRF50 Appendix B and provisions of 10CFR21. ANSYS has retained its original International Organization for Standardization (ISO) 9001 accreditation certificate since1995-05-04, It’s current certificate is valid until 2027-05-29.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A complementarity constraint formulation of convex multiobjective optimization problems.

We propose a new approach to convex nonlinear multiobjective optimization that captures the geometry of the Pareto set by generating a discrete set of Pareto points optimally. We show that the problem of finding a maximally uniform representation of the Pareto surface can be formulated as a mathematical program with complementarity constraints. The complementarity constraints arise from modeling the set of Pareto points, and the objective maximizes some quality measure of this discrete set. We present encouraging numerical experience on a range of test problems collected from the literature.

97 MATHEMATICS AND COMPUTING↗

Comparison of open-source linear programming solvers.

When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.

Gearhart, Jared Lee↗