Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bilevel optimization”

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

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

Rapid Optimization of Total Variation with Applications in Imaging, Additive Manufacturing, and Qualification

Total Variation optimization penalizes the gradient of a control variable or state. While this work focuses on image processing in particular, it has also found applications in inverse problems and topology optimization. In image processing, the goal is to maintain faithfulness to the original image while denoising and/or deblurring. Additionally, bilevel optimization over the spatially varying regularization weights can illuminate interfaces such as damage regions and other anomalies. We will address two fundamental challenges with TV-optimization: (i) the typical slow convergence of existing TV-optimization methods, and (ii) the selection of spatially varying TV parameters to promote interface detection. Additionally, we will apply such techniques to image data collected in additive manufacturing. In said context, stochasticity in build events induces flaws in the manufactured piece, compromising the integrity of said part. There is a critical need for in-situ monitoring to spot anomalies once they form, and in this setting we apply our total variation and hyperparameter solvers. We will develop a customized algorithm based on for extreme-scale TV-optimization that achieves super-linear or quadratic-convergence, a critical property for real-time, image-by-image analysis. A worst-case outcome is a preprocessing step that enhances image quality in-situ, specifically for out-of-focus and noisy images.

36 MATERIALS SCIENCE↗

A Bilevel Voltage Regulation Operation for Distribution Systems With Self-Operated Microgrids

The emerging of microgrids in distribution systems has significantly enhanced the resilience of power grids. However, the operators of a distribution system and microgrids therein can be different and have accessibility to different devices. To model the operation of such a grid, this work proposes a bilevel formulation and probes into the voltage regulation operation, considering the interaction between different systems. The proposed bilevel formulation considers the cooperation of active energy resources (AER), transformer tap-changers, and capacitor banks that are controlled by different operators. To facilitate the solution time of the target bilevel optimization, the lower-level problems with different objectives are modeled using deep neural networks (DNNs) which are then converted into a set of constraints. Hence, the bilevel problem can be reformed to a single-level problem. Lastly, the proposed solution procedures are validated using a customized joint system constructed by the IEEE 123-bus system and a real distribution system in Iowa. According to the numerical validation results, the solution time of the proposed nonlinear activation function based DNN model is 69 times faster than other methods in solving voltage regulation with a bilevel structure.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Direct stellarator coil optimization for nested magnetic surfaces with precise quasi-symmetry

We present a robust optimization algorithm for the design of electromagnetic coils that generate vacuum magnetic fields with nested flux surfaces and precise quasi-symmetry. The method is based on a bilevel optimization problem, where the outer coil optimization is constrained by a set of inner least squares optimization problems whose solutions describe magnetic surfaces. The outer optimization objective targets coils that generate a field with nested magnetic surfaces and good quasi-symmetry. The inner optimization problems identify magnetic surfaces when they exist, and approximate surfaces in the presence of magnetic islands or chaos. We show that this formulation can be used to heal islands and chaos, thus producing coils that result in magnetic fields with precise quasi-symmetry. We show that the method can be initialized with coils from the traditional two-stage coil design process, as well as coils from a near-axis expansion optimization. We present a numerical example where island chains are healed and quasi-symmetry is optimized up to surfaces with aspect ratio 6. Another numerical example illustrates that the aspect ratio of nested flux surfaces with optimized quasi-symmetry can be decreased from 6 to approximately 4. In conclusion, the last example shows that our approach is robust and a cold-start using coils from a near-axis expansion optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Failure Probability Constrained AC Optimal Power Flow

Despite cascading failures being the central cause of blackouts in power transmission systems, existing operational and planning decisions are made largely by ignoring their underlying cascade potential. This paper posits a reliability-aware AC Optimal Power Flow formulation that seeks to design a dispatch point which has a low operator-specified likelihood of triggering a cascade starting from any single component outage. By exploiting a recently developed analytical model of the probability of component failure, our Failure Probability-constrained ACOPF (FP-ACOPF) utilizes the system's expected first failure time as a smoothly tunable and interpretable signature of cascade risk. Here, we use techniques from bilevel optimization and numerical linear algebra to efficiently formulate and solve the FP-ACOPF using off-the-shelf solvers. Extensive simulations on the IEEE 118-bus case show that, when compared to the unconstrained and N-1 security-constrained ACOPF, our probability-constrained dispatch points can significantly lower the probabilities of long severe cascades and of large demand losses, while incurring only minor increases in total generation costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Improved Particle Swarm Algorithm Using Rubik’s Cube Topology for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g., renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as reducing power loss and stabilizing the main power grid. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. Additionally, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush–Kuhn–Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence-based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik’s Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubik’s Cube topology-based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology-based PSO and its scalability on larger scale applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Using Gene Essentiality and Synthetic Lethality Information to Correct Yeast and CHO Cell Genome-Scale Models

Essentiality (ES) and Synthetic Lethality (SL) information identify combination of genes whose deletion inhibits cell growth. This information is important for both identifying drug targets for tumor and pathogenic bacteria suppression and for flagging and avoiding gene deletions that are non-viable in biotechnology. In this study, we performed a comprehensive ES and SL analysis of two important eukaryotic models (S. cerevisiae and CHO cells) using a bilevel optimization approach introduced earlier. Information gleaned from this study is used to propose specific model changes to remedy inconsistent with data model predictions. Even for the highly curated Yeast 7.11 model we identified 50 changes (metabolic and GPR) leading to the correct prediction of an additional 28% of essential genes and 36% of synthetic lethals along with a 53% reduction in the erroneous identification of essential genes. Due to the paucity of mutant growth phenotype data only 12 changes were made for the CHO 1.2 model leading to an additional correctly predicted 11 essential and eight non-essential genes. Overall, we find that CHO 1.2 was 76% less accurate than the Yeast 7.11 metabolic model in predicting essential genes. Based on this analysis, 14 (single and double deletion) maximally informative experiments are suggested to improve the CHO cell model by using information from a mouse metabolic model. This analysis demonstrates the importance of single and multiple knockout phenotypes in assessing and improving model reconstructions. The advent of techniques such as CRISPR opens the door for the global assessment of eukaryotic models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.

Feng, Xiaochun↗

A Multi-Parametric optimization approach for bilevel mixed-integer linear and quadratic programming problems

Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. Herein, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multi-parametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems.

42 ENGINEERING↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗

Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets

With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.

active distribution network↗

Strategic Offering and Equilibrium in Coupled Gas and Electricity Markets

The wide integration of gas-fired units and implementation of power-to-gas technologies bring increasing interdependence among the natural gas and electricity infrastructures. This paper studies the equilibrium of the coupled gas and electricity markets, which is driven by the strategic offering behaviors: each producer endeavours to maximize its own profit by taking the market clearing process into consideration. The market equilibrium can be obtained from an equilibrium problem with equilibrium constraints. A special diagonalization algorithm is devised, in which the unilateral equilibrium of the gas or electricity market is found in the inner loop given the rivals' strategies; the interactions of the two markets are tackled in the outer loop. Case studies on two test systems validate the proposed methodology.

bilevel optimization↗

Game Theory Approaches for System-level Incentive Design

This report presents a generalized Stackelberg game framework for designing and evaluating financial incentives that enhance power system resilience through strategic deployment of distributed energy resources(DERs) under various contingencies. The proposed approach addresses the challenge of coordinating individual community investment decisions to meet system-wide resilience objectives. The framework is demonstrated in a three-community test system subjected to two transmission contingency scenarios: inter-community line failure (Case 1) and complete main grid disconnection (Case 2). In both cases, three incentive levels are compared: a Base case with no financial incentives, and low and high incentive cases. In Case 1, the Base case (no incentives) results in a total installed DER capacity of 217.2 MW, with no load shedding due to alternative routing, but community costs remain high. Increasing incentives raises DER deployment to 286.9 MW, lowers aggregate community costs by $22M annually, and completely avoids the need for costly new transmission line construction. In Case 2, the Base case results in 24.3 MWh of unserved load; introducing incentives eliminates all load shedding and ensures up to 89 MWh of battery storage is available for emergency reserve. These results demonstrate that targeted incentives can dramatically improve grid resilience and cost-effectiveness. The framework thus offers policymakers and system planners a robust tool to quantify and compare the effectiveness of incentive programs for multi-community transmission networks behavior, system resilience, and economic efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Succinate Overproduction: A Case Study of Computational Strain Design Using a Comprehensive Escherichia coli Kinetic Model

Computational strain-design prediction accuracy has been the focus for many recent efforts through the selective integration of kinetic information into metabolic models. In general, kinetic model prediction quality is determined by the range and scope of genetic and/or environmental perturbations used during parameterization. Here, we apply the k-OptForce procedure on a kinetic model of E. coli core metabolism constructed using the Ensemble Modeling (EM) method and parameterized using multiple mutant strains data under aerobic respiration with glucose as the carbon source. Minimal interventions are identified that improve succinate yield under both aerobic and anaerobic conditions to test the fidelity of model predictions under both genetic and environmental perturbations. Under aerobic condition, k-OptForce identifies interventions that match existing experimental strategies while pointing at a number of unexplored flux re-directions such as routing glyoxylate flux through the glycerate metabolism to improve succinate yield. Many of the identified interventions rely on the kinetic descriptions that would not be discoverable by a purely stoichiometric description. In contrast, under fermentative (anaerobic) condition, k-OptForce fails to identify key interventions including up-regulation of anaplerotic reactions and elimination of competitive fermentative products. This is due to the fact that the pathways activated under anaerobic condition were not properly parameterized as only aerobic flux data were used in the model construction. This study shed light on the importance of condition-specific model parameterization and provides insight on how to augment kinetic models so as to correctly respond to multiple environmental perturbations.

59 BASIC BIOLOGICAL SCIENCES↗

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

A lower bound for a finite-scenario-based chance-constrained program is the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of solving larger subproblems. The quality of the bound depends on how the scenarios are grouped. In this paper, we formulate a mixed-integer bilevel program that optimally groups scenarios to tighten the quantile bounds. For general chance-constrained programs, we propose a branch-and-cut algorithm to optimize the bilevel program, and for chance-constrained linear programs, a mixed-integer linear-programming reformulation is derived. Here, we also propose several heuristics for grouping similar or dissimilar scenarios. Our computational results demonstrate that optimal grouping bounds are much tighter than heuristic bounds, resulting in smaller root-node gaps and better performance of scenario decomposition for solving chance-constrained 0-1 programs. Also, the optimal grouping bounds can be greatly strengthened using larger group size.

97 MATHEMATICS AND COMPUTING↗

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗