Search NASA⌕ Search

SEARCH · Search NASA

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,315 records · Page 73

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints (SHEBO) v1.0

SHEBO (surrogate optimization of problems with hidden constraints and expensive black-box objectives) is an efficient optimization algorithm that employs surrogate models to solve computationally expensive black-box simulation optimization problems that have hidden constraints. Hidden constraints are encountered when the objective function evaluation does not return a value for a parameter vector. These constraints are often encountered in optimization problems in which the objective function is computed by a black-box simulation code. SHEBO uses a combination of local and global search strategies together with an evaluability prediction function and a dynamically adjusted evaluability threshold to iteratively select new sample points.

Mueller, Juliane↗

Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Furthermore, extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.

97 MATHEMATICS AND COMPUTING↗

A Scalable Meter Placement Method for Distribution System State Estimation

This paper studies the optimal meter placement problem for distribution system state estimation given limited measurement resources. We formulate the problem as a mixed integer semi-definite programming that minimizes the worst case estimation errors over a set of operating points. To solve the problem, we first relax the problem as a convex optimization problem. Motivated by the lack of scalability of existing solvers, we next leverage the special structure of the cost function and propose an algorithm based on barrier method that solves the problem with significantly better numerical performance. The proposed method has been validated on the IEEE 13-bus, IEEE 123-bus, and IEEE 8,500-bus feeders.

barrier method↗

A unifying modeling abstraction for infinite-dimensional optimization

Infinite-dimensional optimization (InfiniteOpt) problems involve modeling components (variables, objectives, and constraints) that are functions defined over infinite-dimensional domains. Examples include continuous-time dynamic optimization (time is an infinite domain and components are functions of time), PDE optimization problems (space and time are infinite domains and components are functions of space-time), as well as stochastic and semi-infinite optimization (random space is an infinite domain and components are a function of such random space). InfiniteOpt problems also arise from combinations of these problem classes (e.g., stochastic PDE optimization). Given the infinite-dimensional nature of objectives and constraints, one often needs to define appropriate quantities (measures) to properly pose the problem. Moreover, InfiniteOpt problems often need to be transformed into a finite dimensional representation so that they can be solved numerically. Here in this work, we present a unifying abstraction that facilitates the modeling, analysis, and solution of InfiniteOpt problems. The proposed abstraction enables a general treatment of infinite-dimensional domains and provides a measure-centric paradigm to handle associated variables, objectives, and constraints. This abstraction allows us to transfer techniques across disciplines and with this identify new, interesting, and useful modeling paradigms (e.g., event constraints and risk measures defined over time domains). Our abstraction serves as the backbone of an intuitive Julia-based modeling package that we call InfiniteOpt.jl. We demonstrate the developments using diverse case studies arising in engineering.

42 ENGINEERING↗

Identification of the Diffusion Parameter in Nonlocal Steady Diffusion Problems

The problem of identifying the diffusion parameter appearing in a nonlocal steady diffusion equation is considered. The identification problem is formulated as an optimal control problem having a matching functional as the objective of the control and the parameter function as the control variable. The analysis makes use of a nonlocal vector calculus that allows one to define a variational formulation of the nonlocal problem. In a manner analogous to the local partial differential equations counterpart, we demonstrate, for certain kernel functions, the existence of at least one optimal solution in the space of admissible parameters. We introduce a Galerkin finite element discretization of the optimal control problem and derive a priori error estimates for the approximate state and control variables. Using one-dimensional numerical experiments, we illustrate the theoretical results and show that by using nonlocal models it is possible to estimate non-smooth and discontinuous diffusion parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Optimal Control for Series Hybrid Electric Vehicles

Increasing demand for improving fuel economy and reducing emissions has stimulated significant research and investment in hybrid propulsion systems. In this paper, we address the problem of optimizing online the supervisory control in a series hybrid configuration by modeling its operation as a controlled Markov chain using the average cost criterion. We treat the stochastic optimal control problem as a dual constrained optimization problem. We show that the control policy that yields higher probability distribution to the states with low cost and lower probability distribution to the states with high cost is an optimal control policy, defined as an equilibrium control policy. We demonstrate the effectiveness of the efficiency of the proposed controller in a series hybrid configuration and compare it with a thermostat-type controller.

fuel economy↗

Necessary Optimality Conditions for Some Control Problems of Elliptic Equations with Venttsel Boundary Conditions

In this paper we derive a necessary optimality condition for a local optimal solution of some control problems. These optimal control problems are governed by a semi-linear Vettsel boundary value problem of a linear elliptic equation. The control is applied to the state equation via the boundary and a functional of the control together with the solution of the state equation under such a control will be minimized. A constraint on the solution of the state equation is also considered.

97 MATHEMATICS AND COMPUTING↗

Economic dispatch of offshore renewable energy resources for islanded communities with optimal storage sizing

Coastal or isolated microgrids depend on diesel generators and could benefit from renewable energy resources, especially offshore wind and wave energy. Integrating these resources into microgrids is complicated by their high intermittency, which requires optimal economic dispatch to effectively evaluate. This study considers three coastal or islanded sites, and uses mid-fidelity models of wind and wave energy technologies, and local demand data to solve the optimal economic dispatch problem. An optimal storage sizing method is developed that finds the smallest capacity of energy storage required to meet the microgrid load during each season. The storage capacity decreases by a factor of two at most when adding wave energy converters to a system. Adding wave energy converters to a farm decreases cost by about 30%. Furthermore, the required storage size varies by two to three times from summer to winter. Compared with the state-of-the-art approaches that often overlook realistic offshore renewable energy technology in microgrid economic dispatch and optimal storage sizing, the proposed solution introduced in this study allows for better site selection, microgrid design, converter selection, and storage sizing considerations for isolated microgrids.

16 TIDAL AND WAVE POWER↗