Exploration of multifidelity UQ strategies for network applications
Abstract not provided.
Publications
Search results
Jump to search filtersMaintaining Connected Components for Infinite Graph Streams
Abstract not provided.
EMPIRE and EMPHASIS: Verification and Validation
Abstract not provided.
Applications of Random Walks Utilizing Neuromorphic Computing
Abstract not provided.
The Kokkos C++ Performance Portability EcoSystem
Abstract not provided.
Recent advancements toward generalized sampling strategies for multifidelity Uncertainty Quantification
Abstract not provided.
Software Engineering Questionnaire Responses to NNSA/CEA Codesign Discussion
Abstract not provided.
EMPIRE Sandia's Next Generation Plasma Tool
Abstract not provided.
Future High-Performance Networks
Abstract not provided.
On Scalable Block Preconditioners for Implicit / IMEX FE Continuum Plasma Physics Models
Abstract not provided.
Tracking Network Events with Write Optimized Data Structures
Abstract not provided.
ECP HE Node Simulation - SNL
Abstract not provided.
Lessons Learned from Developing LAMMPS
Abstract not provided.
Reducing E3SM Communication through Task Mapping
Abstract not provided.
Status report on EMPIRE simulations of RKA
Abstract not provided.
Tracking Network Events with Write Optimized Data Structures
Abstract not provided.
Generic Spiking Architecture (GenSA)
Abstract not provided.
Towards Lightweight and Scalable Simulation of Large-Scale OpenSHMEM Applications
Abstract not provided.
ASC CSSE Level 2 Milestone Briefing: SST-GPU
Abstract not provided.
Statistical modeling for quantum information processing
Abstract not provided.
Subspace projection methods and random linear algebra
Abstract not provided.
Building a Comprehensive Neuromorphic Platformfor Remote Computation
Abstract not provided.
High-Performance Computing Storage System Challenges for Theoreticians
Abstract not provided.
Silicon qubit performance in the presence of inhomogeneous strain
Abstract not provided.
Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints
IEEE Transactions on Power Systems
We propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current (ac) model of the transmission network, which is a nonconvex mixed-integer nonlinear programming problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with ac power flow constraints and leverage second-order cone relaxations, piecewise outer approximations, and optimization-based bounds tightening to provide a globally optimal solution at convergence. Numerical results on four benchmark problems illustrate the effectiveness of our algorithm, both in terms of convergence rate and solution quality.
Results 2351–2375 of 9,998