Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “primal-dual”

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 37 records · Page 2

Economic Dispatch With Distributed Energy Resources: Co-Optimization of Transmission and Distribution Systems

The increasing penetration of distributed energy resources (DERs) in the distribution networks has turned the conventionally passive load buses into active buses that can provide grid services for the transmission system. To take advantage of the DERs in the distribution networks, this letter formulates a transmission-and-distribution (T&D) systems co-optimization problem that achieves economic dispatch at the transmission level and optimal voltage regulation at the distribution level by leveraging large generators and DERs. A primal-dual gradient algorithm is proposed to solve this optimization problem jointly for T&D systems, and a distributed market-based equivalent of the gradient algorithm is used for practical implementation. Finally, the results are corroborated by numerical examples with the IEEE 39-Bus system connected with 7 different distribution networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Performance Evaluation of Peer-to-Peer Distributed Microgrids Coordination for Voltage Regulation

This paper presents the performance evaluation of a peer-to-peer microgrids coordination algorithm for sub-transmission systems. As distributed energy resources (DERs) in distribution system start to show negative impact to the bulk power system, a paradigm shift is needed for transmission planning and operation. Because distribution substations are located far from the sub-transmission system, and it is hard to use traditional centralized control for real-time control and coordination. Thus, distributed control is a natural choice because it requires less communication and central computation. In this paper, each distribution substation is treated as a microgrid, and the peer-to-peer distributed microgrids control is formulated as a real-time optimal power flow problem to reduce the negative impact in sub-transmission systems. A distributed primal-dual optimization algorithm is adopted to solve the problem. Validation of the peer-to-peer algorithm is performed through the simulation of a real-world sub-transmission system composing of many distribution systems with high renewable penetration. Simulation results show that the peer-to-peer algorithm can achieve satisfactory performance (e.g., voltage regulation) in sub-transmission system by coordinating and controlling DERs in distribution systems.

distributed control↗

Multi-Level Optimal Power Flow Solver in Large Distribution Networks

Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗

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↗

Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs

We study solution sensitivity for nonlinear programs (NLPs) whose structures are induced by graphs. These NLPs arise in many applications such as dynamic optimization, stochastic optimization, optimization with partial differential equations, and network optimization. We illustrate that for a given pair of nodes, the sensitivity of the primal-dual solution at one node against a data perturbation at the other node decays exponentially with respect to the distance between these two nodes on the graph. In other words, the solution sensitivity decays as one moves away from the perturbation point. This result, which we call exponential decay of sensitivity, holds under the strong second-order sufficiency condition and the linear independence constraint qualification. We also present conditions under which the decay rate remains uniformly bounded; this allows us to characterize the sensitivity behavior of NLPs defined over subgraphs of infinite graphs. The theoretical developments are illustrated with numerical examples.

97 MATHEMATICS AND COMPUTING↗

Peer-to-Peer Energy Management System for Distributed Microgrid Coordination [SWR-21-92]

Resiliency is one of the key challenges in today's power system. Natural disasters and cyber-attacks both can limit communications between microgrids and the central management system. Thus, having a Distributed Microgrid Coordination (DMC) algorithm can improve the system resiliency, which enables the microgrids to operate without communication with the central management system. Peer-to-Peer Energy Management System for Distributed Microgrid Coordination adopts a primal-dual approach, where each microgrid controller keeps a local estimate of the dual variables. The estimate is updated with local measurements and peer-to-peer communication, leading to a fully distributed algorithm. While the DMC is developed for microgrid coordination, it can be used for general distributed control purpose.

Li, Yashen↗

maranasgroup/KETCHUP

Repository for Kinetic Estimation Tool Capturing Heterogeneous Datasets Using Pyomo (KETCHUP), a flexible parameter estimation tool that leverages a primal-dual interior-point algorithm to solve a nonlinear programming (NLP) problem that identifies a set of parameters capable of recapitulating the steady-state fluxes and concentrations in wild-type and perturbed metabolic networks.

Suthers, Patrick↗

The discrete complementary variational principle and optimal control systems

A discrete complementary variational principle is developed and applied to linear and nonlinear discrete-time optimal control systems. Using the variational approach, a primal-dual relationship is established. This relationship provides a precise measure of system suboptimality independent of any a priori knowledge of the optimal solution.

Chan, W. L.↗

Probabilistic structural analysis by extremum methods

The objective is to demonstrate discrete extremum methods of structural analysis as a tool for structural system reliability evaluation. Specifically, linear and multiobjective linear programming models for analysis of rigid plastic frames under proportional and multiparametric loadings, respectively, are considered. Kinematic and static approaches for analysis form a primal-dual pair in each of these models and have a polyhedral format. Duality relations link extreme points and hyperplanes of these polyhedra and lead naturally to dual methods for system reliability evaluation.

Nafday, Avinash M.↗

Newton modified barrier method in constrained optimization

In this paper, we develop and investigate the Newton method for solving constrained (non-smooth) optimization problems. This approach is based on the modified barrier functions (MBF) theory and on the global converging step-size version of the Newton method for smooth unconstrained optimization. Due to the excellent properties of the MBF near primal-dual solution, the Newton modified barrier method (NMBM) has a better rate of convergence, better complexity bound, and is much more stable in the final stage of the computational process than the methods which are based on the classical barrier functions (CBF).

Polyak, R.↗

Symmetry as Bias: Rediscovering Special Relativity

This paper describes a rational reconstruction of Einstein's discovery of special relativity, validated through an implementation: the Erlanger program. Einstein's discovery of special relativity revolutionized both the content of physics and the research strategy used by theoretical physicists. This research strategy entails a mutual bootstrapping process between a hypothesis space for biases, defined through different postulated symmetries of the universe, and a hypothesis space for physical theories. The invariance principle mutually constrains these two spaces. The invariance principle enables detecting when an evolving physical theory becomes inconsistent with its bias, and also when the biases for theories describing different phenomena are inconsistent. Structural properties of the invariance principle facilitate generating a new bias when an inconsistency is detected. After a new bias is generated. this principle facilitates reformulating the old, inconsistent theory by treating the latter as a limiting approximation. The structural properties of the invariance principle can be suitably generalized to other types of biases to enable primal-dual learning.

Lowry, Michael R.↗

Modified Interior Distance Functions (Theory and Methods)

In this paper we introduced and developed the theory of Modified Interior Distance Functions (MIDF's). The MIDF is a Classical Lagrangian (CL) for a constrained optimization problem which is equivalent to the initial one and can be obtained from the latter by monotone transformation both the objective function and constraints. In contrast to the Interior Distance Functions (IDF's), which played a fundamental role in Interior Point Methods (IPM's), the MIDF's are defined on an extended feasible set and along with center, have two extra tools, which control the computational process: the barrier parameter and the vector of Lagrange multipliers. The extra tools allow to attach to the MEDF's very important properties of Augmented Lagrangeans. One can consider the MIDFs as Interior Augmented Lagrangeans. It makes MIDF's similar in spirit to Modified Barrier Functions (MBF's), although there is a fundamental difference between them both in theory and methods. Based on MIDF's theory, Modified Center Methods (MCM's) have been developed and analyzed. The MCM's find an unconstrained minimizer in primal space and update the Lagrange multipliers, while both the center and the barrier parameter can be fixed or updated at each step. The MCM's convergence was investigated, and their rate of convergence was estimated. The extension of the feasible set and the special role of the Lagrange multipliers allow to develop MCM's, which produce, in case of nondegenerate constrained optimization, a primal and dual sequences that converge to the primal-dual solutions with linear rate, even when both the center and the barrier parameter are fixed. Moreover, every Lagrange multipliers update shrinks the distance to the primal dual solution by a factor 0 less than gamma less than 1 which can be made as small as one wants by choosing a fixed interior point as a 'center' and a fixed but large enough barrier parameter. The numericai realization of MCM leads to the Newton MCM (NMCM). The approximation for the primal minimizer one finds by Newton Method followed by the Lagrange multipliers update. Due to the MCM convergence, when both the center and the barrier parameter are fixed, the condition of the MDF Hessism and the neighborhood of the primal ninimizer where Newton method is 'well' defined remains stable. It contributes to both the complexity and the numerical stability of the NMCM.

Polyak, Roman A.↗

Implementation of a Point Algorithm for Real-Time Convex Optimization

The primal-dual interior-point algorithm implemented in G-OPT is a relatively new and efficient way of solving convex optimization problems. Given a prescribed level of accuracy, the convergence to the optimal solution is guaranteed in a predetermined, finite number of iterations. G-OPT Version 1.0 is a flight software implementation written in C. Onboard application of the software enables autonomous, real-time guidance and control that explicitly incorporates mission constraints such as control authority (e.g. maximum thrust limits), hazard avoidance, and fuel limitations. This software can be used in planetary landing missions (Mars pinpoint landing and lunar landing), as well as in proximity operations around small celestial bodies (moons, asteroids, and comets). It also can be used in any spacecraft mission for thrust allocation in six-degrees-of-freedom control.

Acikmese, Behcet↗

G-DYN Multibody Dynamics Engine

G-DYN is a multi-body dynamic simulation software engine that automatically assembles and integrates equations of motion for arbitrarily connected multibody dynamic systems. The algorithm behind G-DYN is based on a primal-dual formulation of the dynamics that captures the position and velocity vectors (primal variables) of each body and the interaction forces (dual variables) between bodies, which are particularly useful for control and estimation analysis and synthesis. It also takes full advantage of the spare matrix structure resulting from the system dynamics to numerically integrate the equations of motion efficiently. Furthermore, the dynamic model for each body can easily be replaced without re-deriving the overall equations of motion, and the assembly of the equations of motion is done automatically. G-DYN proved an essential software tool in the simulation of spacecraft systems used for small celestial body surface sampling, specifically in simulating touch-and-go (TAG) maneuvers of a robotic sampling system from a comet and asteroid. It is used extensively in validating mission concepts for small body sample return, such as Comet Odyssey and Galahad New Frontiers proposals.

Acikmese, Behcet↗

Using Power Diagrams to Build Optimal Unstructured Meshes for C-Grid Models

The Model for Prediction Across Scales (MPAS) for Ocean (-O), Sea-Ice (-SI) and Land-Ice (-LI), in addition to the Coastal Ocean Marine Prediction Across Scales (COMPAS) are two novel general circulation models designed to resolve coupled ocean-ice dynamics over variable spatial scales using non-uniform unstructured grids. Both models are based on a conservative mimetic finite-difference/volume formulation (TRiSK), in which staggered momentum, vorticity and mass-based degrees- of-freedom are distributed over an orthogonal 'primal-dual' mesh.

Engwirda, Darren↗

Multi-Level Optimal Power Flow Solver in Large Distribution Networks: Preprint

Solving optimal power flow (OPF) problem for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution networks of tree topology with deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multi-level implementation of the primal-dual gradient algorithm for solving the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verifies that the proposed algorithm can significantly improve computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Performance Evaluation of Peer-to-Peer Distributed Microgrids Coordination for Voltage Regulation: Preprint

This paper presents the performance evaluation of a peer-to-peer microgrids coordination algorithm for sub-transmission systems. As distributed energy resources (DERs) in distribution system start to show negative impact to the bulk power system, a paradigm shift is needed for transmission planning and operation. Because distribution substations are located far from the sub-transmission system, and it is hard to use traditional centralized control for real-time control and coordination. Thus, distributed control is a natural choice because it requires less communication and central computation. In this paper, each distribution substation is treated as a microgrid, and the peer-to-peer distributed microgrids control is formulated as a real-time optimal power flow problem to reduce the negative impact in sub-transmission systems. A distributed primal-dual optimization algorithm is adopted to solve the problem. Validation of the peer-to-peer algorithm is performed through the simulation of a real-world sub-transmission system composing of many distribution systems with high renewable penetration. Simulation results show that the peer-to-peer algorithm can achieve satisfactory performance (e.g., voltage regulation) in sub-transmission system by coordinating and controlling DERs in distribution systems.

distributed control↗

Towards constrained grid-forming control

Grid-forming converters are commonly envisioned to replace conventional synchronous generators as the cornerstone of future power systems. However, compared to synchronous generators, power converters and their power sources (e.g., renewable generation, energy storage) are subject to significant physical constraints (e.g., current limits, modulation limits). Grid-forming controls are commonly designed neglecting these constraints and subsequently augmented with limiters for a subset of constraints. In this work, we propose a systematic approach to constrained grid-forming control of two-level voltage source converters interfacing photovoltaics. We first formulate grid-forming control objectives and constraints of voltage source converters and photovoltaics in a one-step optimal grid-forming control problem. Next, we leverage primal-dual dynamics to obtain a dynamic feedback controller that approximates the solution of the one-step optimal grid-forming control problem. Finally, electromagnetic transient simulations are used to illustrate the results.

Gross, Dominic↗