Search NASA⌕ Search

SEARCH · Search NASA

Results for “alternating direction multiplier method”

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.

Security Constrained Distributed Transaction Model for Multiple Prosumers

Massive access of renewable energy has prompted demand-side distributed resources to participate in regulation and improve flexibility of power systems. With large-scale access of massive, decentralized, and diverse distributed resources, demand-side market members have transformed from traditional “consumers” to “prosumers”. To explore the distributed transaction model of prosumers, in this paper, a multi-prosumer distributed transaction model is proposed, and the Conditional Value-at-Risk (CVaR) theory is applied to quantify potential risks caused by the stochastic characteristics inherited from renewable energy. First, a prosumer model under constraints of the distribution network including photovoltaic units, fuel cells, energy storage system, central air conditioning and flexible loads is established, and a multi-prosumer distributed transaction strategy is proposed to achieve power sharing among multiple prosumers. Second, a prosumer transaction model based on CVaR is constructed to measure risks inherited from the uncertainty of PV output within the prosumer and ensure safety of system operation in extreme PV output scenarios. Then, the alternating direction multiplier method (ADMM) is utilized to solve the constructed model efficiently. Finally, distributed transaction costs of prosumers are distributed fairly based on the generalized Nash equilibrium to maximize social benefits. Simulation results show the multi-prosumer distributed transaction mechanism established under the proposed generalized Nash equilibrium method can encourage power sharing among prosumers, increasing their own income and social benefits. Also, the CVaR can assist decision making of prosumers in weighting the risks and benefits, improving system resilience through energy management of prosumers.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Using Filter Methods to Guide Convergence for ADMM, with Applications to Nonnegative Matrix Factorization Problems

Nonconvex, nonlinear optimization problems arise naturally in parameter fitting and machine learning. While augmented Lagrangian methods have demonstrated robust convergence for classes of these problems, their convergence for block updates has been relatively unexplored outside of the context of the alternating direction method of multipliers (ADMM). ADMM has seen extensive use in these applications, but may exhibit uncertain convergence behavior in many practical nonconvex settings, and struggles with general nonlinear constraints. In contrast, filter methods have proved effective in enforcing convergence for sequential quadratic programming methods and interior point methods with feasibility criteria. We develop an ADMM-filter method for highly nonlinear and nonconvex problems. Here, we show convergence under mild assumptions for several types of coordinate descent schemes, and demonstrate our algorithm on nonnegative matrix factorization and completion problems in imaging and chemical spectrum analysis.

Nonconvex optimization↗

e RPCA : Robust Principal Component Analysis for Exponential Family Distributions

Abstract Robust principal component analysis (RPCA) is a widely used method for recovering low‐rank structure from data matrices corrupted by significant and sparse outliers. These corruptions may arise from occlusions, malicious tampering, or other causes for anomalies, and the joint identification of such corruptions with low‐rank background is critical for process monitoring and diagnosis. However, existing RPCA methods and their extensions largely do not account for the underlying probabilistic distribution for the data matrices, which in many applications are known and can be highly non‐Gaussian. We thus propose a new method called RPCA for exponential family distributions (), which can perform the desired decomposition into low‐rank and sparse matrices when such a distribution falls within the exponential family. We present a novel alternating direction method of multiplier optimization algorithm for efficient decomposition, under either its natural or canonical parametrization. The effectiveness of is then demonstrated in two applications: the first for steel sheet defect detection and the second for crime activity monitoring in the Atlanta metropolitan area.

Zheng, Xiaojun↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗

Real-Time Multiregional Market-to-Market Congestion Management Through Exchange of Relief Cost Curve

This paper introduces a novel method for multiregional market-to-market (M2M) coordinated congestion management. It identifies shortcomings in existing M2M approaches, where Regional Transmission Organizations (RTOs) exchange shadow prices and relief requests to optimize congestion relief allocations across interconnected regions. Two methods are proposed to enhance flow and price convergence. The first method proposes that both Regional Transmission Organizations (RTOs) use state-estimator flows directly to determine relief requirements, eliminating delays and potential oscillations caused by using market flows calculated from the prior period under existing M2M approach. The second method involves exchanging transmission relief cost curves, enabling each RTOs to integrate other RTOs' relief costs curve into its real-time security-constrained economic dispatch (SCED). This method can effectively extend the coordination to multiple transmission lines and across more than two RTOs. The alternating direction method of multipliers (ADMM) is also applied to the M2M coordination problem and compared with the proposed methods. Case studies on small and large-scale systems demonstrate the effectiveness of these approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Networked Microgrids Optimization

This project is mainly about the operation optimization of three networked microgrids (MG), including centralized optimization and distributed optimization. The alternating direction method of multipliers (ADMM) algorithm is used for distributed optimization. In the distribution network considered here, there is a Distribution Management system (DMS) as the system coordinator and several networked microgrids. In grid-connected mode, power could be imported or exported at the distribution substation bus according to the utility rate, and the exchanged power at point of common coupling (PCC) of any microgrid has a limitation. In islanded mode, the power imports/exports at the distribution substation are zero. In both grid-connected and islanded mode, the distribution substation is taken as a slack bus with fixed voltage magnitude.

Chen, Yang [Oak Ridge National Laboratory (ORNL), ↗

Fidelity-preserving enhancement of ptychography with foundational text-to-image models

Ptychographic phase retrieval enables high-resolution imaging of complex samples but often suffers from artifacts such as grid pathology and multislice crosstalk, which degrade reconstructed images. We propose a plug-and-play (PnP) framework that integrates physics model-based phase retrieval with text-guided image editing using foundational diffusion models. By employing the alternating direction method of multipliers, our approach ensures consensus between data fidelity and artifact removal subproblems, maintaining physical consistency while enhancing image quality. Artifact removal is achieved using a text-guided diffusion image editing method (LEDITS++) with a pre-trained foundational diffusion model, allowing users to specify artifacts for removal in natural language. Demonstrations on simulated and experimental datasets show significant improvements in artifact suppression and structural fidelity, validated by metrics such as peak signal-to-noise ratio and diffraction pattern consistency. This work highlights the combination of text-guided generative models and model-based phase retrieval algorithms as a transferable and fidelity-preserving method for high-quality diffraction imaging.

image editing↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover n cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,4,4,4) independent of n. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Miao, Daniel [University of Minnesota]↗

Nonlinear Analysis of Bonded Composite Tubular Lap Joints

The present study describes a semi-analytical solution method for predicting the geometrically nonlinear response of a bonded composite tubular single-lap joint subjected to general loading conditions. The transverse shear and normal stresses in the adhesive as well as membrane stress resultants and bending moments in the adherends are determined using this method. The method utilizes the principle of virtual work in conjunction with nonlinear thin-shell theory to model the adherends and a cylindrical shear lag model to represent the kinematics of the thin adhesive layer between the adherends. The kinematic boundary conditions are imposed by employing the Lagrange multiplier method. In the solution procedure, the displacement components for the tubular joint are approximated in terms of non-periodic and periodic B-Spline functions in the longitudinal and circumferential directions, respectively. The approach presented herein represents a rapid-solution alternative to the finite element method. The solution method was validated by comparison against a previously considered tubular single-lap joint. The steep variation of both peeling and shearing stresses near the adhesive edges was successfully captured. The applicability of the present method was also demonstrated by considering tubular bonded lap-joints subjected to pure bending and torsion.

E. Oterkus↗

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Nash, Stephen G.↗

Directions for lunar construction - A derivation of requirements from a construction scenario analysis

This paper provides an initial trade-off study among several lunar construction options available to the Space Exploration Initiative. The relative time effectiveness of Extra-Vehicular Activity (EVA), Intra-Vehicular Activity (IVA), and Earth-based remote control assembly and construction methods are studied. Also considered is whether there is any construction time savings to building roads in advance, or surveying the construction sites with orbiters or rovers in advance. The study was conducted by adding detail to a potentially real scenario - a nuclear power plant - and applying time multipliers for the various control options and terrain alternatives, provided by roboticists among the authors. The authors conclude that IVA is a faster construction method than either EVA or construction conducted remotely from Earth. Surveying proposed sites in advance, with orbiters and rovers, provides a significant time savings through adding to certainty, and therefore may be cost effective. Developing a heavy-lift launch capability and minimizing assembly and construction processes by landing large payloads is probably worthwhile to the degree possible, as construction activities would use a large amount of surface operations time.

Dias, William S.↗

Improved Joining of Metal Components to Composite Structures

Systems requirements for complex spacecraft drive design requirements that lead to structures, components, and/or enclosures of a multi-material and multifunctional design. The varying physical properties of aluminum, tungsten, Invar, or other high-grade aerospace metals when utilized in conjunction with lightweight composites multiply system level solutions. These multi-material designs are largely dependent upon effective joining techAn improved method of joining metal components to matrix/fiber composite material structures has been invented. The method is particularly applicable to equipping such thin-wall polymer-matrix composite (PMC) structures as tanks with flanges, ceramic matrix composite (CMC) liners for high heat engine nozzles, and other metallic-to-composite attachments. The method is oriented toward new architectures and distributing mechanical loads as widely as possible in the vicinities of attachment locations to prevent excessive concentrations of stresses that could give rise to delaminations, debonds, leaks, and other failures. The method in its most basic form can be summarized as follows: A metal component is to be joined to a designated attachment area on a composite-material structure. In preparation for joining, the metal component is fabricated to include multiple studs projecting from the aforementioned face. Also in preparation for joining, holes just wide enough to accept the studs are molded into, drilled, or otherwise formed in the corresponding locations in the designated attachment area of the uncured ("wet') composite structure. The metal component is brought together with the uncured composite structure so that the studs become firmly seated in the holes, thereby causing the composite material to become intertwined with the metal component in the joining area. Alternately, it is proposed to utilize other mechanical attachment schemes whereby the uncured composite and metallic parts are joined with "z-direction" fasteners. The resulting "wet" assembly is then subjected to the composite-curing heat treatment, becoming a unitary structure. It should be noted that this new art will require different techniques for CMC s versus PMC's, but the final architecture and companion curing philosophy is the same. For instance, a chemical vapor infiltration (CVI) fabrication technique may require special integration of the pre-form and

Semmes, Edmund↗

CFD 2030 Grand Challenge: CFD-in-the-Loop Monte Carlo Flight Simulation for Space Vehicle Design

Flight qualification of space vehicles is markedly different from those typically employed for aircraft. The concept of an extensive flight test campaign for a space vehicle does not exist, and vehicle designers must look to alternative techniques for demonstrating robust and reliable performance of their vehicles prior to operational flight. A space vehicle may undergo only a handful of flight tests in its development cycle, with each flight representing a drastically different flight phase or flight configuration. For instance, NASA’s Space Launch System (SLS) launch vehicle and Orion spacecraft will only see a total of four flight demonstrations before flying a crew on its first operational mission, and each flight demonstrates a unique vehicle configuration and/or set of flight conditions. The SLS will be flown only one time before it becomes operational (Artemis 1). The Orion spacecraft Crew Module (CM) will have been tested twice, once on a Delta IV launch vehicle (Exploration Flight Test 1) and once as a fully integrated system with the SLS launch vehicle (Artemis 1). The Orion Launch abort system will have been tested twice, once in a pad abort scenario (Pad Abort 1) and once in an inflight abort scenario (Ascent Abort 2) on a modified Peacekeeper booster. Both of these latter tests involve only a boiler plate CM, not a functional Orion spacecraft. Thus, unlike aircraft, there is very little opportunity for engineers to assess and evaluate their preflight predictions. Instead, space vehicle designers rely on Monte Carlo flight simulations with detailed dispersions of predicted nominal flight behavior to determine how robust their design is to errors and uncertainties in the flight conditions their vehicle may encounter. These Monte Carlo analyses entail thousands of trajectory simulations to demonstrate that the vehicle can meet design requirements at a specified level of reliability. From an aerodynamics and aerothermodynamics perspective, these trajectory simulations are fueled by an extensive aerodynamic database that covers the complete range of expected flight conditions, vehicle configurations, and flight attitudes expected in a given mission. Today, these databases amount to a table of engineering parameters that can be quickly interrogated by the trajectory simulator. The aerodynamic and aerothermodynamic databases are assembled via a series of ground tests, empirical and analytical analysis, physics-based computational analysis, applicable past flight performance data, and in some cases, engineering judgment. These databases generally take years to assemble for a new space vehicle system and in the case of SLS/Orion, over a decade of test and analysis have been expended to develop the extensive databases required to cover the myriad of configurations and potential flight conditions required for the system. Recently, it has been proposed that Computational Fluid Dynamic (CFD) and computing capability may be reaching a point where it is foreseeable that CFD could be integrated directly into the production trajectory simulation tools used to design NASA’s space vehicles. To demonstrate this, NASA has embarked on two demonstrations of this type of capability, one where six degree of freedom flight trajectory simulation equations are embedded in an existing CFD solver and another where a production CFD solver is loosely coupled with a production trajectory simulation tool. These efforts represent an initial demonstration of a future approach to flight trajectory simulation, but they are a far cry from the capability required to perform a full-up CFD-in-the-loop Monte Carlo trajectory simulation. Therefore, this represents a viable grand challenge for computational methods addressing space vehicle design and development. The final paper/presentation will discuss the many hurdles, beyond simply raw computational power, to realizing this grand challenge and how they map directly to the CFD Vision 2030 ojectives. Among these are the wide range of flight conditions, including accelerating/decelerating flight, encountered by a space vehicle during launch and/or entry. The vehicle can also encounter numerous configuration changes, some of which can be quite drastic, during the course of its flight, so robust, automated geometry modeling, grid generation, and adaptation will play a huge role in reaching this goal. Multiply this by 1000’s of trajectory simulations occurring simultaneously in a given Monte Carlo analysis, and the problem readily scales to absorb virtually any size of supercomputer envisioned today. The concept of CFD-in-the-loop Monte Carlo trajectory simulation poses a formidable challenge for emerging and future computing systems, and it has the potential to shave years off the development cycle for aerodynamic and aerothermodynamic performance predictions as compared to today’s space vehicle design approach.

CFD 2030↗