Search NASA⌕ Search

SEARCH · Search NASA

Results for “successive convex approximation”

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.

16 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Beyond Relaxation and Newton–Raphson: Solving AC OPF for Multi-Phase Systems With Renewables

This paper focuses on the AC Optimal Power Flow (OPF) problem for multi-phase systems. Particular emphasis is given to systems with high integration of renewables, where adjustments of the real and reactive output powers from renewable sources of energy are necessary in order to enforce voltage regulation. The AC OPF problem is known to be nonconvex (and, in fact, NP-hard). Convex relaxation techniques have been recently explored to solve the OPF task with reduced computational burden; however, sufficient conditions for tightness of these relaxations are only available for restricted classes of system topologies and problem setups. Identifying feasible power-flow solutions remains hard in more general problem formulations, especially in unbalanced multi-phase systems with renewables. To identify feasible and optimal AC OPF solutions in challenging scenarios where existing methods may fail, this paper leverages the Feasible Point Pursuit - Successive Convex Approximation algorithm - a powerful approach for general nonconvex quadratically constrained quadratic programs. The merits of the approach are illustrated using single- and multiphase distribution networks with renewables, as well as several transmission systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Distributed Optimal Power Flow Using Feasible Point Pursuit

The AC Optimal Power Flow (OPF) is a core optimization task in the domain of power system operations and control. It is known to be nonconvex (and, in fact, NP-hard). In general operational scenarios, identifying feasible (let alone optimal) power-flow solutions remains hard. This paper leverages the recently proposed Feasible Point Pursuit algorithm for solving the OPF problem to devise a fully distributed procedure that can identify AC OPF solutions. The paper considers a multi-area setting and develops an algorithm where all the computations are done locally withing each area, and then the local controllers have to communicate to only their neighbors a small amount of information pertaining to the boundary buses. The merits of the proposed approach are illustrated through an example of a challenging transmission network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2015

Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

This paper investigates a convex optimization based method that can rapidly generate the fuel optimal asteroid powered descent trajectory. The ultimate goal is to autonomously design the optimal powered descent trajectory on-board the spacecraft immediately prior to the descent burn. Compared to a planetary powered landing problem, the major difficulty is the complex gravity field near the surface of an asteroid that cannot be approximated by a constant gravity field. This paper uses relaxation techniques and a successive solution process that seeks the solution to the original nonlinear, nonconvex problem through the solutions to a sequence of convex optimal control problems.

Pinson, Robin↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
NASA NTRS1988

Efficient approximation concepts using second order information

The application of second derivative information for solving structural optimization problems is considered. In the present method, rather than building approximate nonlinear forms for the objective function and constraints, only linear approximations are used. A separable quadratic approximation of the Lagrangian function is included in the subproblem statement. The method has been successfully used for simple problems that can be solved in closed form, in addition to the sizing optimization of trusses, and it is shown to converge faster than the convex linearization method or the method of moving asymptotes.

Fleury, Claude↗
NASA NTRS1993

Multiscale Morphological Filtering for Analysis of Noisy and Complex Images

Images acquired with passive sensing techniques suffer from illumination variations and poor local contrasts that create major difficulties in interpretation and identification tasks. On the other hand, images acquired with active sensing techniques based on monochromatic illumination are degraded with speckle noise. Mathematical morphology offers elegant techniques to handle a wide range of image degradation problems. Unlike linear filters, morphological filters do not blur the edges and hence maintain higher image resolution. Their rich mathematical framework facilitates the design and analysis of these filters as well as their hardware implementation. Morphological filters are easier to implement and are more cost effective and efficient than several conventional linear filters. Morphological filters to remove speckle noise while maintaining high resolution and preserving thin image regions that are particularly vulnerable to speckle noise were developed and applied to SAR imagery. These filters used combination of linear (one-dimensional) structuring elements in different (typically four) orientations. Although this approach preserves more details than the simple morphological filters using two-dimensional structuring elements, the limited orientations of one-dimensional elements approximate the fine details of the region boundaries. A more robust filter designed recently overcomes the limitation of the fixed orientations. This filter uses a combination of concave and convex structuring elements. Morphological operators are also useful in extracting features from visible and infrared imagery. A multiresolution image pyramid obtained with successive filtering and a subsampling process aids in the removal of the illumination variations and enhances local contrasts. A morphology-based interpolation scheme was also introduced to reduce intensity discontinuities created in any morphological filtering task. The generality of morphological filtering techniques in extracting information from a wide variety of images obtained with active and passive sensing techniques is discussed. Such techniques are particularly useful in obtaining more information from fusion of complex images by different sensors such as SAR, visible, and infrared.

Kher, A.↗
DOE OSTI2019

Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources: Preprint

This paper develops and compares algorithms to compute the inner approximation of Minkowski sum of convex polytopes. We consider flexibility from distributed re- sources, such as solar photovoltaic (PV) inverters, demand side resources, etc. A polytopic representation of a single inverter's feasible operating region is proposed first. The aggregate flexibility can be computed using the Minkowski sum. Homothet and Zonotope-based approaches have been explored in literature. We show that as heterogeneity increases, such approaches lead to conservative estimates. Hence, we show how to exploit union-based Minkowski sum computation through successive homothetic decomposition of polytopes. While the union-based approach can lead to dimensionality issues, we show how to limit the complexity by predefining a candidate set. Efficiency, accuracy and trade-offs have been analyzed. Numerical examples have been presented to illustrate the effectiveness of the proposed algorithm.

14 SOLAR ENERGY↗
DOE OSTI2022

Resilient Operating Constraints for Power Distribution Systems under Setpoint Attacks

Integration and operation of distributed generation (DG) and energy storage (ES) in power distribution systems are enabled by communication networks and embedded sensor and control devices that increase the vulnerability of the systems to cyber-threats, broadening the attack surface and making adversary actions more unpredictable. This paper proposes a methodology that uses ellipsoidal approximations to quantify the potential damage caused by successful attacks that affect, directly or indirectly, the desired operation setpoints and may drive the power distribution operation to unsafe states by violating the limits of voltage or line flows. More specifically, a new methodology is introduced to find the optimal non-symmetric operating constraints that can be imposed to each DG and ES in order to guarantee that the power distribution system is resilient to any malicious setpoints. The proposed method takes as inputs the system topology, DG and ES capabilities, and load limits to solve a convex optimization problem formulated using linear matrix inequalities (LMIs) and the power flow equations. The proposed solution is agnostic to the attacker's action or load profile and it does not require any assumption about the location or means of the attack. The numerical results on a test distribution feeder with several DG and ES illustrate how the proposed resilient operating constraints guarantee the security of the power distribution system under setpoint attacks.

Giraldo, Jairo↗
DOE OSTI2020

Application of Koopman operator for model-based control of fracture propagation and proppant transport in hydraulic fracturing operation

This work explores the application of the recently developed Koopman operator approach for model identification and feedback control of a hydraulic fracturing process. Controlling fracture propagation and proppant transport with precision is a challenge due in large part to the difficulty of constructing approximate models that accurately capture the characteristic moving boundary and highly-coupled dynamics exhibited by the process. Koopman operator theory is particularly attractive here as it offers a way to explicitly construct linear representations for even highly nonlinear dynamics. The method is data-driven and relies on lifting the states to an infinite-dimensional space of functions called observables where the dynamics are governed by a linear Koopman operator. Here this work considers two problems: (a) fracture geometry control, and (b) proppant concentration control. In both cases, an approximate linear model of the corresponding dynamics is constructed and used to design a model predictive controller (MPC). The manuscript shows that in the case of highly nonlinear dynamics, as observed in the proppant concentration, use of canonical functions in the observable basis fails. In such cases, a priori system knowledge can be leveraged to choose the required basis. The numerical experiments demonstrate that the Koopman linear model shows excellent agreement with the real system and successfully achieves the desired target values maximizing the oil and gas productivity. Additionally, due to its linear structure, the Koopman models allow convex MPC formulations that avoid any issues associated with nonlinear optimization.

42 ENGINEERING↗
NASA NTRS2008

Jet Engine Fan Blade Containment Using an Alternate Geometry

With a goal of reducing jet engine weight, simulations of a fan blade containment system with an alternate geometry were tested and analyzed. A projectile simulating a fan blade was shot at two alternate geometry containment case configurations using a gas gun. The first configuration was a flat plate representing a standard case configuration. The second configuration was a flat plate with a radially convex curve section at the impact point. The curved surface was designed to force the blade to deform plastically, dissipating energy before the full impact of the blade is received by the plate. The curved case was able to tolerate a higher impact velocity before failure. The computational model was developed and correlated with the tests and a weight savings assessment was performed. For the particular test configuration used in this study the ballistic impact velocity of the curved plate was approximately 60 m/s (200 ft/s) greater than that of the flat plate. For the computational model to successfully duplicate the test, the very high strain rate behavior of the materials had to be incorporated.

Carney, K.S.↗
NASA NTRS1994

Late Cenozoic flexural deformation of the middle U.S. Atlantic passive margin

Despite the century-long recognition of regional epeirogeny along the middle Atlantic passive margin, relatively few studies have focused on understanding postrift uplift mechanisms. Here, we demonstrate that epeirogenic uplift of the central Appalachian Piedmont and subsidence of the Salisbury Embayment represent first-order, flexural isostatic processes driven by continental denudation and offshore deposition. Our results show that regional epeirogenic processes, present on all Atlantic-type passive margins, are best resolved by specific stratigraphic and geomorphic relationships, rather than topography. A simple one-dimensional geodynamic model, constrained by well-dated Baltimore Canyon trough, Coastal Plain, and lower Susquehanna River (piedmont) stratigraphy, simulates flexural deforamtion of the U.S. Atlantic margin. The model represents the passive margin lithosphree as a uniformly thick elastic plate, without horizontal compressive stresses, that deforms flexurally under the stress of strike-averaged, vertically applied line loads. Model results illustrate a complex interaction among margin stratigraphy and geomorphology, the isostatic repsonse to denudational and depositional processes, and the modulating influence of exogenic forces such as eustasy. The current elevation, with respect to modern sea level, of fluvial terraces and correlateive Coastal Plain deposits or unconformities is successfully predicted through the synthesis of paleotopography, eustatic change, and margin flexure. Results suggest that the middle U.S. Atlantic margin landward of East Coast Magnetic Anomaly is underlain by lithoshpere with an average elastic thickness of 40 km (flexural rigidity, D = 4 X 10(exp 23) N m), the margin experience an average, long-term denudation rate of approximately 10m/m.y., and the Piedmont has been flexurally upwaped between 35 and 130 meters in the last 15 m.y. Long term isostatic continental uplift resulting rom denudation and basin subsidence resulting rom sediment loading are accomodated primately by a convex-up flexural hinge, physiographically represented by the Fall Zone. Our results elucidate an inherent danger in using topography alone to constrain late-stage passive margin deformation mechanisms. Only through careful synthesis of field stratigraphic and geomorphic elements such as fluvial terraces, Coastal Plain deposits, and offshore stratigraphy can age control be extended from the offshore depositional setting to the erosionally dominated continent. This sudy demonstrates that despite a relatively subdued topography, the middle U.S. Atlantic margin experiences progressive flexural isostatic deformation similar to that proposed for high-relief margins characterized by great escarpments. Thus margin topographic diversity remains a function of other factors, such as lithospheric composition and/or structure, supracrustal stratigraphy and structure, degree of drainage integration, drainage divide migration and climate.

Pazzaglia, Frank J.↗
NASA NTRS2006

RAISHIN: A High-Resolution Three-Dimensional General Relativistic Magnetohydrodynamics Code

We have developed a new three-dimensional general relativistic magnetohydrodynamic (GRMHD) code, RAISHIN, using a conservative, high resolution shock-capturing scheme. The numerical fluxes are calculated using the Harten, Lax, & van Leer (HLL) approximate Riemann solver scheme. The flux-interpolated, constrained transport scheme is used to maintain a divergence-free magnetic field. In order to examine the numerical accuracy and the numerical efficiency, the code uses four different reconstruction methods: piecewise linear methods with Minmod and MC slope-limiter function, convex essentially non-oscillatory (CENO) method, and piecewise parabolic method (PPM) using multistep TVD Runge-Kutta time advance methods with second and third-order time accuracy. We describe code performance on an extensive set of test problems in both special and general relativity. Our new GRMHD code has proven to be accurate in second order and has successfully passed with all tests performed, including highly relativistic and magnetized cases in both special and general relativity.

Mizuno, Yosuke↗
NASA NTRS2015

Rao-Blackwellization for Adaptive Gaussian Sum Nonlinear Model Propagation

When dealing with imperfect data and general models of dynamic systems, the best estimate is always sought in the presence of uncertainty or unknown parameters. In many cases, as the first attempt, the Extended Kalman filter (EKF) provides sufficient solutions to handling issues arising from nonlinear and non-Gaussian estimation problems. But these issues may lead unacceptable performance and even divergence. In order to accurately capture the nonlinearities of most real-world dynamic systems, advanced filtering methods have been created to reduce filter divergence while enhancing performance. Approaches, such as Gaussian sum filtering, grid based Bayesian methods and particle filters are well-known examples of advanced methods used to represent and recursively reproduce an approximation to the state probability density function (pdf). Some of these filtering methods were conceptually developed years before their widespread uses were realized. Advanced nonlinear filtering methods currently benefit from the computing advancements in computational speeds, memory, and parallel processing. Grid based methods, multiple-model approaches and Gaussian sum filtering are numerical solutions that take advantage of different state coordinates or multiple-model methods that reduced the amount of approximations used. Choosing an efficient grid is very difficult for multi-dimensional state spaces, and oftentimes expensive computations must be done at each point. For the original Gaussian sum filter, a weighted sum of Gaussian density functions approximates the pdf but suffers at the update step for the individual component weight selections. In order to improve upon the original Gaussian sum filter, Ref. [2] introduces a weight update approach at the filter propagation stage instead of the measurement update stage. This weight update is performed by minimizing the integral square difference between the true forecast pdf and its Gaussian sum approximation. By adaptively updating each component weight during the nonlinear propagation stage an approximation of the true pdf can be successfully reconstructed. Particle filtering (PF) methods have gained popularity recently for solving nonlinear estimation problems due to their straightforward approach and the processing capabilities mentioned above. The basic concept behind PF is to represent any pdf as a set of random samples. As the number of samples increases, they will theoretically converge to the exact, equivalent representation of the desired pdf. When the estimated qth moment is needed, the samples are used for its construction allowing further analysis of the pdf characteristics. However, filter performance deteriorates as the dimension of the state vector increases. To overcome this problem Ref. [5] applies a marginalization technique for PF methods, decreasing complexity of the system to one linear and another nonlinear state estimation problem. The marginalization theory was originally developed by Rao and Blackwell independently. According to Ref. [6] it improves any given estimator under every convex loss function. The improvement comes from calculating a conditional expected value, often involving integrating out a supportive statistic. In other words, Rao-Blackwellization allows for smaller but separate computations to be carried out while reaching the main objective of the estimator. In the case of improving an estimator's variance, any supporting statistic can be removed and its variance determined. Next, any other information that dependents on the supporting statistic is found along with its respective variance. A new approach is developed here by utilizing the strengths of the adaptive Gaussian sum propagation in Ref. [2] and a marginalization approach used for PF methods found in Ref. [7]. In the following sections a modified filtering approach is presented based on a special state-space model within nonlinear systems to reduce the dimensionality of the optimization problem in Ref. [2]. First, the adaptive Gaussian sum propagation is explained and then the new marginalized adaptive Gaussian sum propagation is derived. Finally, an example simulation is presented.

state estimation↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS2022

Human Stability While Exercising on a VIS Device in Zero Gravity

BACKGROUND: A Vibration Isolation and Stabilization (VIS) system is being designed for use with the European Enhanced Exploration Exercise Device (E4D) [1]. The exercise bar is attached to cables that extend and retract through openings in the E4D platform, which the subject stands on while exercising. Since the E4D is mounted on a moving VIS device, the whole system moves under the subject’s feet. While tension in the cables does help stabilize a crew member in 0g by bracing him or her against the moving platform, flexible cables do not offer full support against falling. This raises the question of whether various exercises that are successfully performed in 1g on a stationary device can be performed without losing balance in 0g on a moving device. Quantifying stability conditions and establishing stability requirements for exercise countermeasure systems is a long-standing challenge and this work helped to inform this specific need for integrated E4D/VIS flight project development. METHODS AND RESULTS: A simplified stability analysis can be attempted based on platform accelerations generated by the VIS device simulation. In this type of analysis, the subject is conceived as standing on the platform in 0g while being held down to it by the tension in the cables. If the sideways acceleration of the platform is such that the cables cannot generate a sufficient moment relative to, e.g., the heels or the toes of the subject to overcome the tipping moment from the inertial forces on the accelerated subject’s body, the subject becomes unstable. This approach, which we refer to as the ‘static’ approximation, indicated failure of all the exercises that were considered in the comprehensive VIS analysis of the E4D. It was realized, however, that platform accelerations are not externally imposed but are themselves induced by the motion of the subject’s body during exercise, and a model calculation confirmed that this drastically altered the tipping moment on the subject, with the potential to even switch the direction in which the body would tip over. This made it imperative to consider in a coupled manner both the motion of the exercising subject’s body and the induced VIS platform motion while considering stability. The coupled dynamics requirement was met by the VIS simulation incorporating time-dependent human mass properties atop the platform and driven by the inertial forces from the prescribed subject motion relative to the platform based on motion-capture recorded human trajectories in 1g on a stationary E4D [2]. To analyze simulation results, a stability criterion was also needed. We do not know how to account for the human ‘control system’ that would take visual and vestibular cues as inputs as the platform moves in 0g. We thus chose to follow an approach we had previously used to analyze the dynamic feasibility of performing a task in lunar gravity along the human body trajectory recorded in 1g [3]. In this approach, one analyzes the center of pressure (COP) between the shoes and the ground (or platform) and checks if the COP remains within the convex hull of the footprints on the ground (or platform), commonly referred to as base of support (BOS). Since pressure is vertical and, in the absence of foot restraints, positive, the COP going outside the BOS indicates that the trajectory recorded in 1g is not dynamically feasible in microgravity and/or on the moving platform of the device. The outcome of the COP-based analysis was that some of the key exercises, especially the deadlift and the back squat exercises, were found to be dynamically feasible for at least some number of the exercise cycles, this number increasing with the cable tension. While this type of stability analysis does not account for the likely alteration of the exercise trajectory from its 1g form in space, it does show that there exist at least some realistic trajectories that pass the dynamic feasibility criterion. This adds confidence that, with further adjustment by the subject of the exercise form in 0g on a moving device, a number of exercises can be performed without losing balance.

D Frenkel↗