Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear programming.”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

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↗
DOE OSTI2021

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↗
DOE OSTI2025

A Fast Dynamic Internal Predictive Power Scheduling Approach for Power Management in Microgrids: Preprint

This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusing on external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programming (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILPPS) optimization through McCormick's relaxation to reduce computational complexity. A predictive window window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrating the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources while shifting the external power transfers to specified time durations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Elucidating the molecular programming of a nonlinear non-ribosomal peptide synthetase responsible for fungal siderophore biosynthesis

Abstract Siderophores belonging to the ferrichrome family are essential for the viability of fungal species and play a key role for virulence of numerous pathogenic fungi. Despite their biological significance, our understanding of how these iron-chelating cyclic hexapeptides are assembled by non-ribosomal peptide synthetase (NRPS) enzymes remains poorly understood, primarily due to the nonlinearity exhibited by the domain architecture. Herein, we report the biochemical characterization of the SidC NRPS, responsible for construction of the intracellular siderophore ferricrocin. In vitro reconstitution of purified SidC reveals its ability to produce ferricrocin and its structural variant, ferrichrome. Application of intact protein mass spectrometry uncovers several non-canonical events during peptidyl siderophore biosynthesis, including inter-modular loading of amino acid substrates and an adenylation domain capable of poly-amide bond formation. This work expands the scope of NRPS programming, allows biosynthetic assignment of ferrichrome NRPSs, and sets the stage for reprogramming towards novel hydroxamate scaffolds.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2015

Optimization problems in natural gas transportation systems. A state-of-the-art review

Our paper provides a review on the most relevant research works conducted to solve natural gas transportation problems via pipeline systems. The literature reveals three major groups of gas pipeline systems, namely gathering, transmission, and distribution systems. In this work, we aim at presenting a detailed discussion of the efforts made in optimizing natural gas transmission lines.There is certainly a vast amount of research done over the past few years on many decision-making problems in the natural gas industry and, specifically, in pipeline network optimization. In this work, we present a state-of-the-art survey focusing on specific categories that include short-term basis storage (line-packing problems), gas quality satisfaction (pooling problems), and compressor station modeling (fuel cost minimization problems). We also discuss both steady-state and transient optimization models highlighting the modeling aspects and the most relevant solution approaches known to date. Although the literature on natural gas transmission system problems is quite extensive, this is, to the best of our knowledge, the first comprehensive review or survey covering this specific research area on natural gas transmission from an operations research perspective. Furthermore, this paper includes a discussion of the most important and promising research areas in this field. Hence, our paper can serve as a useful tool to gain insight into the evolution of the many real-life applications and most recent advances in solution methodologies arising from this exciting and challenging research area of decision-making problems.

03 NATURAL GAS↗
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗
DOE OSTI2022

Approximating a linear multiplicative objective in watershed management optimization

Implementing management practices in a cost-efficient manner is critical for regional efforts to reduce the amount of pollutants entering the Chesapeake Bay. We study the problem of selecting a subset of practices that minimizes pollutant load—subject to budgetary and environmental constraints—as simulated in a widely used regulatory watershed model. Mimicking the computation of pollutant load in the regulatory model, we formulate this problem as a continuous optimization model with a linear multiplicative objective function and linear constraints. To lay the groundwork for incorporating additional stakeholder requirements in the future, especially those that would require integer variables, we present and study a continuous linear optimization model that approximates the nonlinear model. The linear model, which requires an exponential number of variables, arises naturally as an alternative model for the same underlying physical process. We examine the theoretical behavior of these optimization models and investigate restrictions of the linear model to handle its large number of variables. Through extensive computational tests on real and randomly generated instances, we demonstrate that the linear model and its restrictions provide optimal solutions close to those of the nonlinear model in practice, despite poor approximation properties in the worst case. We conclude that the linear model—together with our approach to handling its large number of variables—provides a viable framework from which to extend the optimization model to better meet the needs of the Chesapeake Bay watershed management stakeholders.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Dynamic Investment and Counterparty Risk

We introduce a dynamic optimization framework in which collateral is used to mitigate losses arising at counterparty’s default. The investor faces two sources of risk: the default risk of the entity referencing the traded credit swap security, and counterparty risk generated from the default event of the trading counterparty. We show that the value function of the control problem coincides with the classical solution of a nonlinear dynamic programming equation. We provide an explicit characterization of the optimal investment strategy, and show that the investor does not trade if counterparty risk is sufficiently high. These findings suggest that moving credit swap trades into well-designed clearinghouses may stimulate economic activities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Finite Element Analysis of the TRUST Nonlinear Dynamics Testbed

This paper builds on prior work conducted within the Los Alamos National Laboratory (LANL) Testbeds to Reduce Uncertainty in Simulations and Tests (TRUST) program. Specifically, it builds on finite element (FE) modeling efforts for the TRUST program’s Nonlinear Dynamics (ND) testbed. Historically, the FE model for the ND testbed has exclusively utilized a Lanczos eigensolver that linearly extracts the system’s natural frequencies. This paper investigates the Abaqus 2024’s explicit dynamic solver, which implements a central difference explicit solver. The central difference method used in Abaqus can capture nonlinear material responses in structural dynamic simulations making it suitable for the ND FE model.

42 ENGINEERING↗
DOE OSTI2013

Development of a Generalized Methodology for Soil-Structure Interaction Analysis Using Nonlinear Time-Domain TechniquesNEAMS Program, DOE Office of Nuclear Energy (NE-41)

A generalized time-domain method for Soil-Structure Interaction Analysis is developed, based upon an extension of the Bielak Method. The methodology is combined with the use of a simple hysteretic soil model based upon the Ramberg-Osgood formulation and applied to a notional Small Modular Reactor. These benchmark results compare well with those obtained by using the industry-standard frequency-domain code SASSI. The methodology provides a path forward for investigation of other sources of nonlinearity, including those associated with the use of more physically-realistic material models incorporating pore-pressure effects, gap opening/closing, the effect of nonlinear structural elements, and 3D seismic inputs.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Optimal Control for Battery Storage Using Nonlinear Models

Battery storage system (BSS) becomes increasingly popular for grid applications due to the advance in battery and power electronics technologies as well as the growing need of flexibility and reserve from power systems with rapidly developed renewable generation. Successful assessment and deployment of BSS requires optimizing its operation and therefore maximizing the potential benefits. Although there exist studies that develop optimal control for evaluation or operational scheduling of BSS, modeling of charging/discharging operation and the corresponding impacts on state-of-charge (SOC) is over simplified in these methods. This paper develops an optimal control for BSS evaluation and operational scheduling using a general nonlinear model that expresses the change of SOC as a function of charging/discharging power and SOC level. The proposed method is compared with a typical existing method through a real-world energy storage evaluation project to show the significance of the proposed method.

battery, energy storage system, dynamic programmin↗
DOE OSTI2025

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

On the Value Function of Weakly Coercive Problems in Nonlinear Stochastic Control

In this paper we investigate via a dynamic programming approach some nonlinear stochastic control problems where the control set is unbounded and a classical coercivity hypothesis is replaced by some weaker assumptions. We prove that these problems can be approximated by finite fuel problems; show the continuity of the relative value functions and characterize them as unique viscosity solutions of a quasi-variational inequality with suitable boundary conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials

We study the design of an electromagnetic cloak from multiple materials with an additional constraint on the mass of the cloak. Our problem is an example of a topology optimization problem, and we formulate this problem as a mixed-integer partial-differential equation constrained optimization (MIPDECO) problem, where Maxwell’s equation models the propagation of the wave through the cloak and surrounding medium. We use binary variables to model the assignment of the different materials, and their relevant properties (permittivity and density). The mass constraint adds a nontrivial constraint to this problem. We propose a two-phase strategy to solve this problem. In the first phase, we solve a continuous relaxation, and then propose a new variant of the feasibility pump that exploits the structure of the PDE to obtain an initial integral solution candidate. In the second phase, we use a trust-region approach to improve this incumbent. We also consider a continuation or mesh-sequencing approach to find better solutions faster on consecutively finer meshes. We present detailed numerical results to illustrate the effectiveness of our approaches for constructing multi-material cloaks with a mass constraint.

Calculus of Variations and Optimization↗