Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 1,099 records · Page 61

Bayesian Optimization Under Mixed Constraints with A Slack-Variable Augmented Lagrangian

An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usually solved with local solvers. Recently, surrogate-based Bayesian optimization (BO) sub-solvers have been successfully deployed in the AL framework for a more global search in the presence of inequality constraints; however, a drawback was that expected improvement (EI) evaluations relied on Monte Carlo. Here we introduce an alternative slack variable AL, and show that in this formulation the EI may be evaluated with library routines. The slack variables furthermore facilitate equality as well as inequality constraints, and mixtures thereof. We show our new slack “ALBO” compares favorably to the original. Its superiority over conventional alternatives is reinforced on several mixed constraint examples.

Picheny, Victor↗

A hybrid data-driven and model-based approach for computationally efficient stochastic unit commitment and economic dispatch under wind and solar uncertainty

Stochastic unit commitment (UC) and economic dispatch (ED) are imperative in dealing with uncertainty in renewable forecast for power system operation and planning such that the overall expected production cost is minimized over the planning horizon. However, accurate calculation of the expected production cost requires assessment of a very large number of different scenarios of uncertain renewable resources, such as solar and wind, which is practically infeasible to simulate in real time. This article proposes a hybrid datadriven and physics-based model-predictive paradigm to efficiently solve for stochastic unit commitment and economic dispatch considering uncertainty in wind and solar power forecasts. Here, the novelty of the approach lies in decoupling the production cost estimation from the unit commitment and economic dispatch optimization problems under uncertainty without compromising on the fidelity of the solutions. A data-driven machine learning model is first developed to predict the mean optimal production cost. A physics-based inverse problem is then solved to get the stochastic UC and ED profiles from the expected cost. The presented approach considers, for the first time, solar uncertainty in UC/ED determination and enables efficient and accurate propagation of wind and solar uncertainty to estimate the statistics of the production cost. The effectiveness of the developed approach is demonstrated systematically on a stylized RTS-GMLC single-node system. The overall framework predicts the expected cost 62.5% more accurately than the existing state-of-the-art, on unforeseen days during the entire year, and yields, for the first time, the associated physically consistent UC and ED profiles. The solutions are also shown to be flexible in providing adequate daily reserves to address any statistical deviations from probabilistic power forecasts. The computational time associated with the presented method is only about 10 s compared to over 24 h needed for a conventional stochastic UC/ED determination under uncertainty on an Intel Core i9 processor with 32 GB of RAM.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗

An Improved Genetic Algorithm approach to the Unit Commitment/Economic Dispatch problem

The deployment of new technologies, the importance of accurately modeling the dynamics of the generating units and the introduction of new policies are making the solution of the Unit Commitment/Economic Dispatch problem more and more complicated.In the present scenario, traditionally followed scheduling criteria might not lead to the optimal fleet configuration any more. In addition, most of the widely used techniques have limited capabilities at modeling the nonlinear dynamics of committed power plants. When realistic power systems comprising of several tens of generating units are modeled, the resulting optimization problem turns to be computationally intensive for the current computing capabilities. In this paper, an improved version of a GA-based optimization algorithm is presented. A detailed methodology aimed at obtaining a more efficient version of the GA, and a more detailed and accurate description of the flexible operation flexibility of the power plants is described.

genetic algorithm↗

A Survey of Recent Advances in Transmission Network Switching

Optimal Transmission Switching for electric power networks is a research topic of great interest for both researchers and electric power engineers. Transmission switching is commonly considered a corrective mechanism tool for overloaded networks; however in recent years it has been sought as a means to reduce power loss in the network. Ultimately the objective of this analysis is to provide smart tools for power and economic dispatch planning, allowing utilities and engineers to utilize existing infrastructure as a means of automatic control. The optimization problem is a complex multi-objective search including criteria such as system power loss, equality/non-equality constraints, islanding management, and radial topology configuration in the case of distribution networks. Many optimization methods have been adopted for the transmission switching problem in past years using various heuristic search algorithms. The scope of methodology extends from tried and true methods such as simulated annealing to more modern methods like neural network optimization. Solution benchmarks under consideration commonly include solution state accuracy, computational burden and solution time. The objective of this presentation is to provide a comprehensive account of development in transmission switching methodologies. Benchmarking and testing strategies will be discussed as well as application of the Transmission Expansion Planning Tool in finding transmission switching solutions. Limited Discrepancy Search (LOS) and Probe Discrepancy Search (PDS) Algorithms are compared with more classic optimization strategies, as seen in defining literature and publications in this research field.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗

A Lagrangian dual method for two-stage robust optimization with binary uncertainties

This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.

42 ENGINEERING↗

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

First order impulsive solutions

A mathematically rigorous derivation is given of first order corrections to multi-impulse approximations to the solutions to space flight optimization problems with bang-bang control. The rocket was subjected to an inverse square gravitational force and to a thrust force with constant magnitude. The mass decreased linearly with time. An optimal impulsive solution was obtained for a problem with given initial and final conditions. The method was then used to obtain first-order corrections to the initial values of the costate variables. Indications are given on how the theory may be extended to higher order corrections. The theory was applied to intercept and rendezvous problems.

Andrus, J. F.↗

Quantum Optimization and Approximation Algorithms

Shor's groundbreaking quantum algorithm for integer factoring provides an exponential speedup over the best-known classical algorithms. In the 20 years since Shor's algorithm was conceived, only a handful of fundamental quantum algorithmic kernels, generally providing modest polynomial speedups over classical algorithms, have been invented. To better understand the potential advantage quantum resources provide over their classical counterparts, one may consider other resources than execution time of algorithms. Quantum Approximation Algorithms direct the power of quantum computing towards optimization problems where quantum resources provide higher-quality solutions instead of faster execution times. We provide a new rigorous analysis of the recent Quantum Approximate Optimization Algorithm, demonstrating that it provably outperforms the best known classical approximation algorithm for special hard cases of the fundamental Maximum Cut graph-partitioning problem. We also develop new types of classical approximation algorithms for finding near-optimal low-energy states of physical systems arising in condensed matter by extending seminal discrete optimization techniques. Our interdisciplinary work seeks to unearth new connections between discrete optimization and quantum information science.

97 MATHEMATICS AND COMPUTING↗

A Plug-and-Play Priors Approach for Solving Nonlinear Imaging Inverse Problems

In the past two decades, nonlinear image reconstruction methods have led to substantial improvements in the capabilities of numerous imaging systems. Such methods are traditionally formulated as optimization problems that are solved iteratively by simultaneously enforcing data consistency and incorporating prior models. Recently, the Plug-and-Play Priors (PPP) framework suggested that by using more sophisticated denoisers, not necessarily corresponding to an optimization objective, it is possible to improve the quality of reconstructed images. Here in this letter, we show that the PPP approach is applicable beyond linear inverse problems. In particular, we develop the fast iterative shrinkage/thresholding algorithm variant of PPP for model-based nonlinear inverse scattering. The key advantage of the proposed formulation over the original ADMM-based one is that it does not need to perform an inversion on the forward model. We show that the proposed method produces high quality images using both simulated and experimentally measured data.

97 MATHEMATICS AND COMPUTING↗

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Optimization Layers for Pyomo [SWR-25-132]

Optimization Layers for Pyomo solves an optimization problem using Pyomo and IPOPT during the forward pass. It computes the gradient of the optimal solution with respect to the parameters based on the KKT conditions in the backward pass. It is a Python library for constructing differentiable optimization layers in PyTorch from Pyomo optimization models.

Chen, Kejun [National Laboratory of the Rockies (N↗

Design Optimization Toolkit: Users' Manual

The Design Optimization Toolkit (DOTk) is a stand-alone C++ software package intended to solve complex design optimization problems. DOTk software package provides a range of solution methods that are suited for gradient/nongradient-based optimization, large scale constrained optimization, and topology optimization. DOTk was design to have a flexible user interface to allow easy access to DOTk solution methods from external engineering software packages. This inherent flexibility makes DOTk barely intrusive to other engineering software packages. As part of this inherent flexibility, DOTk software package provides an easy-to-use MATLAB interface that enables users to call DOTk solution methods directly from the MATLAB command window.

97 MATHEMATICS AND COMPUTING↗

Minimum energy control of a class of electrically driven vehicles

Theoretical and experimental results are obtained in the investigation of a minimum energy control problem associated with a class of electrically driven vehicles. Analytical results are obtained by making several justifiable approximations in the dynamical equations of the plant, the performance index of which is related to the minimization of system energy consumption for any required control action. The control problem of interest is simplified and solved by using Bellman's invariant imbedding technique. The optimality of the resulting control law is compared with those of the bang-bang control law, which is the exact solution for the case of speed-setting control action, and the classical control laws under identical conditions. A stochastic optimization problem is then formulated and solved by using Bellman's dynamic programming technique. The resulting control law is mechanized for a particular vehicle configuration which is simulated in the laboratory.

Sahinkaya, Y. E.↗

Low-Thrust Many-Revolution Trajectory Optimization via Differential Dynamic Programming and a Sundman Transformation

Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to the eccentric anomaly and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are shown in excess of 1000 revolutions while subject to Earths J2 perturbation and lunar gravity.

Aziz, Jonathan↗