Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete 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 55 records · Page 3

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗

Space-time least-squares Petrov-Galerkin projection in nonlinear model reduction.

Our work proposes a space-time least-squares Petrov-Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply Petrov-Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space-time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space-time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted ℓ 2 -norm. This norm can be de ned to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space-time collocation and space-time GNAT variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov-Galerkin projection include: (1) a reduction of both the spatial and temporal dimensions of the dynamical system, (2) the removal of spurious temporal modes (e.g., unstable growth) from the state space, and (3) error bounds that exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

From Physics Model to Results: An Optimizing Framework for Cross-Architecture Code Generation

Starting from a high-level problem description in terms of partial differential equations using abstract tensor notation, the Chemora framework discretizes, optimizes, and generates complete high performance codes for a wide range of compute architectures. Chemora extends the capabilities of Cactus, facilitating the usage of large-scale CPU/GPU systems in an efficient manner for complex applications, without low-level code tuning. Chemora achieves parallelism through MPI and multi-threading, combining OpenMP and CUDA. Optimizations include high-level code transformations, efficient loop traversal strategies, dynamically selected data and instruction cache usage strategies, and JIT compilation of GPU code tailored to the problem characteristics. The discretization is based on higher-order finite differences on multi-block domains. Chemora's capabilities are demonstrated by simulations of black hole collisions. This problem provides an acid test of the framework, as the Einstein equations contain hundreds of variables and thousands of terms.

Blazewicz, Marek↗

Optimal Membrane Cascade Design for Critical Mineral Recovery Through Logic-based Superstructure Optimization

Critical minerals and rare earth elements play an important role in our climate change initiatives, particularly in applications related with energy storage. Here, we use discrete optimization approaches to design a process for the recovery of Lithium and Cobalt from battery recycling, through membrane separation. Our contribution involves proposing a Generalized Disjunctive Programming (GDP) model for the optimal design of a multistage diafiltration cascade for Li-Co separation. By solving the resulting nonconvex mixed-integer nonlinear program model to global optimality, we investigated scalability and solution quality variations with changes in the number of stages and elements per stage. Results demonstrate the computational tractability of the nonlinear GDP formulation for design of membrane separation processes while opening the door for decom-position strategies for multicomponent separation cascades. Future work aims to extend the GDP formulation to account for stage installation and explore various decomposition techniques to enhance solution efficiency.

Ovalle, Daniel↗

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

Distributed Optimization Approaches with Discrete Variables in the Power Distribution Systems

Traditionally, centralized approaches have predominantly been used for the power system operation and control. With increasing penetration of small-scale distributed energy resources (DERs) in the distribution network, especially independently owned renewable resources, distributed algorithms can serve as a potential alternative for improving scalability, resiliency and addressing privacy concerns. However, the complexity of distributed algorithms significantly increases with the integration of the legacy devices, the operation of which depend on discrete control variables. This paper aims to provide a review of the distributed optimization algorithms incorporating discrete control variables for the power distribution system. While the research in this domain is still at its nascence, an extensive comparison of the approaches in the literature for applying quadratic penalty, branch and bound,ordinal optimization and proximal operator to handle discrete variables in the framework of ADMM and dual decomposition have been addressed. Future research direction in this field have been also provided.

Adan, Jannatul↗

Phased: Phase-Aware Submodularity-Based Energy Disaggregation

Energy disaggregation is the task of discerning the energy consumption of individual appliances from aggregated measurements, which holds promise for understanding and reducing energy usage. In this paper, we propose PHASED, an optimization approach for energy disaggregation that has two key features: PHASED (i) exploits the structure of power distribution systems to make use of readily available measurements that are neglected by existing methods, and (ii) poses the problem as a minimization of a difference of sub-modular functions. We leverage this form by applying a discrete optimization variant of the majorization-minimization algorithm to iteratively minimize a sequence of global upper bounds of the cost function to obtain high-quality approximate solutions. PHASED improves the disaggregation accuracy of state-of-the-art models by up to 61% and achieves better prediction on heavy load appliances.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION↗

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal test selection for prediction uncertainty reduction

Economic factors and experimental limitations often lead to sparse and/or imprecise data used for the calibration and validation of computational models. This paper addresses resource allocation for calibration and validation experiments, in order to maximize their effectiveness within given resource constraints. When observation data are used for model calibration, the quality of the inferred parameter descriptions is directly affected by the quality and quantity of the data. This paper characterizes parameter uncertainty within a probabilistic framework, which enables the uncertainty to be systematically reduced with additional data. The validation assessment is also uncertain in the presence of sparse and imprecise data; therefore, this paper proposes an approach for quantifying the resulting validation uncertainty. Since calibration and validation uncertainty affect the prediction of interest, the proposed framework explores the decision of cost versus importance of data in terms of the impact on the prediction uncertainty. Often, calibration and validation tests may be performed for different input scenarios, and this paper shows how the calibration and validation results from different conditions may be integrated into the prediction. Then, a constrained discrete optimization formulation that selects the number of tests of each type (calibration or validation at given input conditions) is proposed. Furthermore, the proposed test selection methodology is demonstrated on a microelectromechanical system (MEMS) example.

97 MATHEMATICS AND COMPUTING↗

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗

Function Maximization with Dynamic Quantum Search

Finding the maximum value of a function in a dynamic model plays an important role in many application settings, including discrete optimization in the presence of hard constraints. We present an iterative quantum algorithm for finding the maximum value of a function in which prior search results update the acceptable response. Our approach is based on quantum search and utilizes a dynamic oracle function to mark items in a specified input set. As a realization of function optimization, we verify the correctness of the algorithm using numerical simulations of quantum circuits for the Knapsack problem. In conclusion, our simulations make use of an explicit oracle function based on arithmetic operations and a comparator subroutine, and we verify these implementations using numerical simulations up to 30 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Conformal truncation of chern-simons theory at large $N$ f

We set up and analyze the lightcone Hamiltonian for an abelian Chern-Simons field coupled to N f fermions in the limit of large Nf using conformal truncation, i.e. with a truncated space of states corresponding to primary operators with dimension below a maximum cutoff Δ max . In both the Chern-Simons theory, and in the O(N) model at infinite N, we compute the current spectral functions analytically as a function of Δ max and reproduce previous results in the limit that the truncation Δ max is taken to ∞. Along the way, we determine how to preserve gauge invariance and how to choose an optimal discrete basis for the momenta of states in the truncation space.

1/N expansion, Chern-Simons Theories↗

A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials

We study the design of an electromagnetic cloak from multiple materials with an additional constraint on the mass of the cloak. Our problem is an example of a topology optimization problem, and we formulate this problem as a mixed-integer partial-differential equation constrained optimization (MIPDECO) problem, where Maxwell’s equation models the propagation of the wave through the cloak and surrounding medium. We use binary variables to model the assignment of the different materials, and their relevant properties (permittivity and density). The mass constraint adds a nontrivial constraint to this problem. We propose a two-phase strategy to solve this problem. In the first phase, we solve a continuous relaxation, and then propose a new variant of the feasibility pump that exploits the structure of the PDE to obtain an initial integral solution candidate. In the second phase, we use a trust-region approach to improve this incumbent. We also consider a continuation or mesh-sequencing approach to find better solutions faster on consecutively finer meshes. We present detailed numerical results to illustrate the effectiveness of our approaches for constructing multi-material cloaks with a mass constraint.

Calculus of Variations and Optimization↗

Gaussian Mean Field Lattice Gas

We study rigorously a lattice gas version of the Sherrington–Kirckpatrick spin glass model. In discrete optimization literature this problem is known as unconstrained binary quadratic programming and it belongs to the class NP-hard. We prove that the fluctuations of the ground state energy tend to vanish in the thermodynamic limit, and we give a lower bound of such ground state energy. Then we present a heuristic algorithm, based on a probabilistic cellular automaton, which seems to be able to find configurations with energy very close to the minimum, even for quite large instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sequential ensemble transform for Bayesian inverse problems

In this work, we present the Sequential Ensemble Transform (SET) method, an approach for generating approximate samples from a Bayesian posterior distribution. The method explores the posterior distribution by solving a sequence of discrete optimal transport problems to produce a series of transport plans which map prior samples to posterior samples. We prove that the sequence of Dirac mixture distributions produced by the SET method converges weakly to the true posterior as the sample size approaches infinity. Furthermore, our numerical results indicate that, when compared to standard Sequential Monte Carlo (SMC) methods, the SET approach is more robust to the choice of Markov mutation kernels and requires less computational efforts to reach a similar accuracy when used to explore complex posterior distributions. Finally, we describe adaptive schemes that allow to completely automate the use of the SET method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗

Relaxation dynamics in quantum dissipative systems: The microscopic effect of intramolecular vibrational energy redistribution

We investigate the effect of inter-mode coupling on the vibrational relaxation dynamics of molecules in weak dissipative environments. The simulations are performed within the reduced density matrix formalism in the Markovian regime, assuming a Lindblad form for the system-bath interaction. The prototypical two-dimensional model system representing two CO molecules approaching a Cu(100) surface is adapted from an ab initio potential, while the diatom-diatom vibrational coupling strength is systematically varied. In the weak system-bath coupling limit and at low temperatures, only first order non-adiabatic uni-modal coupling terms contribute to surface-mediated vibrational relaxation. Since dissipative dynamics is non-unitary, the choice of representation will affect the evolution of the reduced density matrix. Two alternative representations for computing the relaxation rates and the associated operators are thus compared: the fully coupled spectral basis, and a factorizable ansatz. The former is well-established and serves as a benchmark for the solution of Liouville-von Neumann equation. In the latter, a contracted grid basis of potential-optimized discrete variable representation is tailored to incorporate most of the inter-mode coupling, while the Lindblad operators are represented as tensor products of one-dimensional operators, for consistency. This procedure results in a marked reduction of the grid size and in a much more advantageous scaling of the computational cost with respect to the increase of the dimensionality of the system. The factorizable method is found to provide an accurate description of the dissipative quantum dynamics of the model system, specifically of the time evolution of the state populations and of the probability density distribution of the molecular wave packet. The influence of intra-molecular vibrational energy redistribution appears to be properly taken into account by the new model on the whole range of coupling strengths. It demontrates that most of the mode mixing during relaxation is due to the potential part of the Hamiltonian and not to the coupling among relaxation operators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗