Search NASA⌕ Search

SEARCH · Search NASA

Results for “non convex”

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 19 records

Identifying and Characterizing Non-Convexities in the Feasible Spaces of Optimal Power Flow Problems

Optimal power flow (OPF) is an important problem in the operation of electric power systems. The solution to an OPF problem provides a minimum cost operating point that satisfies constraints imposed by both the non-linear power flow equations and engineering limits. These constraints can yield non-convex feasible spaces that result in significant computational challenges. This brief proposes an algorithm that identifies and characterizes non-convexities in OPF feasible spaces. This algorithm searches for a pair of feasible points whose connecting line segment contains an infeasible point. Such points certify the existence of a non-convexity in the OPF feasible space. Moreover, the constraint violations at the infeasible point along the connecting line segment physically characterize a cause of the non-convexity. Numerical demonstrations include a small illustrative example as well as applications to various test cases.

Molzahn, Daniel K.↗

Scalable Computation of 2D-Minkowski Sum of Arbitrary Non-Convex Domains: Modeling Flexibility in Energy Resources

The flexibility of active ($p$) and reactive power ($q$) consumption in distributed energy resources (DERs) can be represented as a (potentially non-convex) set of points in the $p$-$q$ plane. Modeling of the aggregated flexibility in a heterogeneous ensemble of DERs as a Minkowski sum (M-sum) is computationally intractable even for moderately sized populations. In this article, we propose a scalable method of computing the M-sum of the flexibility domains of a heterogeneous ensemble of DERs, which are allowed to be non-convex, non-compact. In particular, the proposed algorithm computes a guaranteed superset of the true M-sum, with desired accuracy. The worst-case complexity of the algorithm is computed. Special cases are considered, and it is shown that under certain scenarios, it is possible to achieve a complexity that is linear with the size of the ensemble. Numerical examples are provided by computing the aggregated flexibility of different mix of DERs under varying scenarios.

Kundu, Soumya↗

Dissipative issue of high-order shock capturing schemes with non-convex equations of state

It is well known that, closed with a non-convex equation of state (EOS), the Riemann problem for the Euler equations allows non-standard waves, such as split shocks, sonic isentropic compressions or rarefaction shocks, to occur. Loss of convexity then leads to non-uniqueness of entropic or Lax solutions, which can only be resolved via the Liu-Oleinik criterion (equivalent to the existence of viscous profiles for all admissible shock waves). This suggests that in order to capture the physical solution, a numerical scheme must provide an appropriate level of dissipation. A legitimate question then concerns the ability of high-order shock capturing schemes to naturally select such a solution. To investigate this question and evaluate modern as well as future high-order numerical schemes, there is therefore a crucial need for well-documented benchmarks. A thermodynamically consistent C{sup {infinity}} non-convex EOS that can be easily introduced in Eulerian as well as Lagrangian hydrocodes for test purposes is here proposed, along with a reference solution for an initial value problem exhibiting a complex composite wave pattern (the Bizarrium test problem). Two standard Lagrangian numerical approaches, both based on a finite volume method, are then reviewed (vNR and Godunov-type schemes) and evaluated on this Riemann problem. In particular, a complete description of several state-of-the-art high-order Godunov-type schemes applicable to general EOSs is provided. We show that this particular test problem reveals quite severe when working on high-order schemes, and recommend it as a benchmark for devising new limiters and/or next-generation highly accurate schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

Dynamical tunneling versus fast diffusion for a non-convex Hamiltonian

This paper attempts to resolve the issue of the nature of the 0.01-0.1 cm{sup −1} peak splittings observed in high-resolution IR spectra of polyatomic molecules. One hypothesis is that these splittings are caused by dynamical tunneling, a quantum-mechanical phenomenon whereby energy flows between two disconnected regions of phase-space across dynamical barriers. However, a competing classical mechanism for energy flow is Arnol’d diffusion, which connects different regions of phase-space by a resonance network known as the Arnol’d web. The speed of diffusion is bounded by the Nekhoroshev theorem, which guarantees stability on exponentially long time scales if the Hamiltonian is steep. Here we consider a non-convex Hamiltonian that contains the characteristics of a molecular Hamiltonian, but does not satisfy the Nekhoroshev theorem. The diffusion along the Arnol’d web is expected to be fast for a non-convex Hamiltonian. While fast diffusion is an unlikely competitor for longtime energy flow in molecules, we show how dynamical tunneling dominates compared to fast diffusion in the nearly integrable regime for a non-convex Hamiltonian, as well as present a new kind of dynamical tunneling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Limited range spatial load balancing in non-convex environments using sampling-based motion planners

This paper analyzes the limited range, spatial load balancing problem for agents deployed in non-convex environments and subject to differential constraints which restricts how the agents can move. First, the (unlimited range) spatial load balancing problem is introduced and the minimization problem with area constraints is defined. Then, to extend the problem for limited ranges, two cost functions and a sub-partition are defined. The problems are then analyzed and the results prove the existence of a partition that satisfies the area constraints. The non-convex environment makes the problem difficult to solve in continuous-space. Therefore, a probabilistic roadmap is used to approximate agents’ cells via a graph. A distributed algorithm is proven to converge to an approximate solution. Lastly, the convergence of the algorithm is shown in simulation.

42 ENGINEERING↗

Unconditionally stable, second-order schemes for gradient-regularized, non-convex, finite-strain elasticity modeling martensitic phase transformations

In the setting of continuum elasticity martensitic phase transformations are characterized by a non-convex free energy density function that possesses multiple wells in strain space and includes higher-order gradient terms for regularization. Metastable martensitic microstructures, defined as solutions that are local minimizers of the total free energy, are of interest and are obtained as steady state solutions to the resulting transient formulation of Toupin’s gradient elasticity at finite strain. This type of problem poses several numerical challenges including stiffness, the need for fine discretization to resolve microstructures, and following solution branches. Accurate time-integration schemes are essential to obtain meaningful solutions at reasonable computational cost. Here in this work we introduce two classes of unconditionally stable second-order time-integration schemes for gradient elasticity, each having relative advantages over the other. Numerical examples are shown highlighting these features.

42 ENGINEERING↗

Anomalous wave structure in magnetized materials described by non-convex equations of state

We analyze the anomalous wave structure appearing in flow dynamics under the influence of magnetic field in materials described by non-ideal equations of state. We consider the system of magnetohydrodynamics equations closed by a general equation of state (EOS) and propose a complete spectral decomposition of the fluxes that allows us to derive an expression of the nonlinearity factor as the mathematical tool to determine the nature of the wave phenomena. We prove that the possible formation of non-classical wave structure is determined by both the thermodynamic properties of the material and the magnetic field as well as its possible rotation. We demonstrate that phase transitions induced by material properties do not necessarily imply the loss of genuine nonlinearity of the wavefields as is the case in classical hydrodynamics. The analytical expression of the nonlinearity factor allows us to determine the specific amount of magnetic field necessary to prevent formation of complex structure induced by phase transition in the material. We illustrate our analytical approach by considering two non-convex EOS that exhibit phase transitions and anomalous behavior in the evolution. We present numerical experiments validating the analysis performed through a set of one-dimensional Riemann problems. In the examples we show how to determine the appropriate amount of magnetic field in the initial conditions of the Riemann problem to transform a thermodynamic composite wave into a simple nonlinear wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-convex Multi-species Hopfield Models

In this work we introduce a multi-species generalization of the Hopfield model for associative memory, where neurons are divided into groups and both inter-groups and intra-groups pair-wise interactions are considered, with different intensities. Thus, this system contains two of the main ingredients of modern deep neural-network architectures: Hebbian interactions to store patterns of information and multiple layers coding different levels of correlations. The model is completely solvable in the low-load regime with a suitable generalization of the Hamilton–Jacobi technique, despite the Hamiltonian can be a non-definite quadratic form of the Mattis magnetizations. The family of multi-species Hopfield model includes, as special cases, the 3-layers Restricted Boltzmann Machine with Gaussian hidden layer and the Bidirectional Associative Memory model.

97 MATHEMATICS AND COMPUTING↗

A Computationally Efficient Algorithm for Computing Convex Hull Prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.

61 RADIATION PROTECTION AND DOSIMETRY↗

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

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

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together with pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automated Resonance Fitting for Nuclear Data Evaluation

Global and national efforts to deliver high-quality nuclear data to users have a wide-ranging impact, affecting applications in national security, reactor operations, basic science, medicine, and more. Cross section evaluation is a major part of this effort, combining theory and experimentation to produce recommended values and uncertainties for reaction probabilities. Resonance region evaluation is a specialized type of nuclear data evaluation that can require significant manual effort and months of time from expert scientists. In this article, non-convex non-linear optimization methods are combined with concepts of inferential statistics to infer a resonance model from experimental data in an automated manner that is not dependent on prior evaluation(s). This methodology aims to enhance the workflow of a resonance evaluator by minimizing time, effort, and the potential for bias from prior assumptions, while enhancing reproducibility and documentation, thereby addressing well-known challenges in the field.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗

Unconditionally stable, second-order accurate schemes for solid state phase transformations driven by mechano-chemical spinodal decomposition

Here, we consider solid state phase transformations that are caused by free energy densities with domains of non-convexity in strain-composition space; we refer to the non-convex domains as mechano-chemical spinodals. The non-convexity with respect to composition and strain causes segregation into phases with different crystal structures. We work on an existing model that couples the classical Cahn-Hilliard model with Toupin’s theory of gradient elasticity at finite strains. Both systems are represented by fourth-order, nonlinear, partial differential equations. The goal of this work is to develop unconditionally stable, second-order accurate time-integration schemes, motivated by the need to carry out large scale computations of dynamically evolving microstructures in three dimensions. We also introduce reduced formulations naturally derived from these proposed schemes for faster computations that are still second-order accurate. Although our method is developed and analyzed here for a specific class of mechano-chemical problems, one can readily apply the same method to develop unconditionally stable, second-order accurate schemes for any problems for which free energy density functions are multivariate polynomials of solution components and component gradients. Apart from an analysis and construction of methods, we present a suite of numerical results that demonstrate the schemes in action.

36 MATERIALS SCIENCE↗