Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic optimizations”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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↗
DOE OSTI2021

Scenario Creation and Power-Conditioning Strategies for Operating Power Grids with Two-Stage Stochastic Economic Dispatch

A significant difficulty associated with the use of stochastic programming to solve optimal power flow problems on a 5-minute timescale is the quality of renewable energy scenarios input by the user. This is especially true when considering power systems with high penetrations of renewable energy, e.g. wind power. This paper introduces the use of stochastic programming to solve the DC optimal power flow problem with scenarios drawn directly from high-fidelity data sets. Hence, the proposed method avoids the problem of lost physics by finding high-fidelity analogs that can describe future states of the system. Furthermore, this method can be simply extended to output multi-period scenarios to the stochastic program. We demonstrate the effectiveness of this technique by simulating dispatch operations on a synthetic test system over the course of a week.

analog forecast↗
NASA NTRS1974

Sequential decision analysis for nonstationary stochastic processes

A formulation of the problem of making decisions concerning the state of nonstationary stochastic processes is given. An optimal decision rule, for the case in which the stochastic process is independent of the decisions made, is derived. It is shown that this rule is a generalization of the Bayesian likelihood ratio test; and an analog to Wald's sequential likelihood ratio test is given, in which the optimal thresholds may vary with time.

Schaefer, B.↗
NASA NTRS1991

Limits on the isolation of stochastic vibration for microgravity space experiments

The limitations on the isolation of stochastic vibrations for microgravity space experiments are explored. These limitations result from the restricted interior space available for vibration isolation. A one-degree-of-freedom representation of the experiment-spacecraft system is used, and an ideal vibration actuator is assumed. A kinematic representation results, and the problem becomes one of finding the minimum acceleration trajectory within a pair of stochastic walls. The wall motion is characterized by an ergodic, stationary, zero-mean, Gaussian random process with known power spectral density. The geometry of the wall trajectories is defined in terms of their significant extrema and zero crossings. This geomemtry is used in defining a composite trajectory that has a mean square acceleratiaon lower than that on the optimal path satisfying the stochastic wall inequality constraints. The optimal control problem is solved on a return path yielding the mean square acceleration in terms of the distributions of significant maxima and first-passage time of the wall process. The methodology is applied to a microgravity isolation problem to find the lower bounds on root-mean-square acceleration given the disturbance power spectral density.

Knospe, C. R.↗
DOE OSTI2022

Efficient Probabilistic Computing with Stochastic Perovskite Nickelates

Probabilistic computing has emerged as a viable approach to solve hard optimization problems. Devices with inherent stochasticity can greatly simplify their implementation in electronic hardware. In this report we demonstrate intrinsic stochastic resistance switching controlled via electric fields in perovskite nickelates doped with hydrogen. The ability of hydrogen ions to reside in various metastable configurations in the lattice leads to a distribution of transport gaps. With experimentally characterized p-bits, a shared-synapse p-bit architecture demonstrates highly parallelized and energy-efficient solutions to optimization problems such as integer factorization and Boolean satisfiability. The results introduce perovskite nickelates as scalable potential candidates for probabilistic computing and showcase the potential of light-element dopants in next-generation correlated semiconductors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
NASA NTRS1972

Adaptive control of stochastic linear systems with unknown parameters

The problem of optimal control of linear discrete-time stochastic dynamical system with unknown and, possibly, stochastically varying parameters is considered on the basis of noisy measurements. It is desired to minimize the expected value of a quadratic cost functional. Since the simultaneous estimation of the state and plant parameters is a nonlinear filtering problem, the extended Kalman filter algorithm is used. Several qualitative and asymptotic properties of the open loop feedback optimal control and the enforced separation scheme are discussed. Simulation results via Monte Carlo method show that, in terms of the performance measure, for stable systems the open loop feedback optimal control system is slightly better than the enforced separation scheme, while for unstable systems the latter scheme is far better.

Ku, R. T.↗
DOE OSTI2020

Stochastic Analysis for Long Term Capital Structures, Systems, and Components Refurbishment and Replacement

As commercial Nuclear Power Plants (NPPs) pursue extended plant operation in the form of Second License Renewal (SLR), opportunities exist for these plants to provide capital investments to ensure long-term safe and economic performance. At the current time, several utilities have announced an intention to pursue extended operation for one or more of their NPPs via SLR . The goal of this research is to develop a risk-informed approach to evaluate and prioritize plant capital investments made in preparation for, and during the period of, extended plant operations to support decisions for NPP operations. Since the capital investments are influenced by various factors, such as markets, safety and regulatory, the decision-making process of NPP operations should take into account relevant factors for balancing risks, costs and profits. The traditional method of capital budgeting is based on the priority list of candidate projects using economic measures such as benefit-investment ratio, net present value (NPV) and internal rate of return. In the literatures, the problem of capital budgeting or the variant can be represented by an appropriate knapsack problem. The knapsack approach to capital budgeting takes as input as investment, along with the cost and profit of each project. The objective of capital budgeting is to find the combination of the binary decisions for every investment such that the overall profit is as large as possible. The output is a collection of projects to be carried out, and we refer this selected collection of projects as a project portfolio. One limitation of traditional optimization models for capital budgeting is that they do not account for risk/uncertainty in profit and cost streams associated with individual projects, they do not account for risk in resource availability in future years [1,2,3]. Projects can incur cost over-runs, especially when projects are large, performed infrequently, and when there is risk regarding technical viability, external contractors, and/or suppliers of requisite parts and materials. Occasionally, projects are performed ahead of schedule and with cost savings. Planned budgets for capital improvements can be cut and key personnel may be lost. Or, there may be surprise windfalls in budgets for maintenance activities due to decreased costs for “unplanned” maintenance. In these cases, how should we resolve capital budgeting when we have risk forecasts for costs, profits and budgets? One approach we proposed in this summary is to re-solve the optimization models based on assumed statistical distributions of given parameters. If these distributions were not available, a two-stage stochastic optimization approach can be used to provide priority lists to decision-makers to support better risk-informed decisions [4, 5]. In this summary, we will only focus on the first approach.

42 ENGINEERING↗
DOE OSTI2024

Towards optimal sensor placement for inverse problems in spaces of measures

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in the sensor configuration and robust with respect to the source, yet relatively easy to compute in practice, compared to a direct evaluation of the error by a large number of samples. In particular, we consider the identification of a measure consisting of an unknown linear combination of point sources from a finite number of measurements contaminated by Gaussian noise. The statistical framework for recovery relies on two main ingredients: first, a convex but non-smooth variational Tikhonov point estimator over the space of Radon measures and, second, a suitable mean-squared error based on its Hellinger–Kantorovich distance to the ground truth. To quantify the error, we employ a non-degenerate source condition as well as careful linearization arguments to derive a computable upper bound. This leads to asymptotically sharp error estimates in expectation that are explicit in the sensor configuration. Thus they can be used to estimate the expected reconstruction error for a given sensor configuration and guide the placement of sensors in sparse inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
NASA NTRS1992

Finite element structural analysis and optimization of space frames and trusses in a massively parallel environment

A set of massively parallel computational procedures are formulated to make finite element method based space frame and truss structural response analyses and stochastic method based structural optimization solution superefficient. Several example frame structural analysis and truss optimization problems are presented for demonstration purposes. All calculations are made on the massively parallel environment of CM-2 computer.

Shieh, Rong C.↗
NASA NTRS1979

Aircraft adaptive learning control

The optimal control theory of stochastic linear systems is discussed in terms of the advantages of distributed-control systems, and the control of randomly-sampled systems. An optimal solution to longitudinal control is derived and applied to the F-8 DFBW aircraft. A randomly-sampled linear process model with additive process and noise is developed.

Lee, P. S. T.↗
NASA NTRS2006

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗
NASA NTRS1972

Control system estimation and design for aerospace vehicles with time delay

The problems of estimation and control of discrete, linear, time-varying systems are considered. Previous solutions to these problems involved either approximate techniques, open-loop control solutions, or results which required excessive computation. The estimation problem is solved by two different methods, both of which yield the identical algorithm for determining the optimal filter. The partitioned results achieve a substantial reduction in computation time and storage requirements over the expanded solution, however. The results reduce to the Kalman filter when no delays are present in the system. The control problem is also solved by two different methods, both of which yield identical algorithms for determining the optimal control gains. The stochastic control is shown to be identical to the deterministic control, thus extending the separation principle to time delay systems. The results obtained reduce to the familiar optimal control solution when no time delays are present in the system.

Allgaier, G. R.↗
DOE OSTI2021

A Data-Driven Multi-Period Importance Sampling Strategy for Stochastic Economic Dispatch

Power systems with high penetrations of renewable energy (e.g., wind power) require sophisticated approaches to optimize system performance due to uncertainty in short-term system generation capacity. In this paper, we combine a data-driven analog scenario selection method with importance sampling to create a novel scenario construction approach for two-stage stochastic economic dispatch problems with a large number of wind farms on a network. The proposed method produces scenarios with realistic physics by finding high-fidelity analogs that can describe future states of the system. We show how to extend this method to multi-period operations and demonstrate the effectiveness of this technique by simulating economic dispatch operations on a synthetic test system over the course of a week.

data-driven forecasting↗
NASA NTRS1975

The effects of stability augmentation on the gust response of a STOL aircraft during a curved manual approach

The task of investigating the effect of SAS was formulated as two optimal control problems for stochastic systems: (1) to compute SAS gains with a rate model in the performance index algorithm; and (2) to calculate the pilot gains and system gust response using an optimal pilot model. Both problems were solved to yield reasonable low gains for the pilot and SAS, and the lateral directional mode poles and the longitudinal short period poles could be placed accurately by the model matching algorithm. Of the longitudinal (SAS) poles achieved, the vertical rms path error was least for the unaugmented poles. The lateral rms path error was an order of magnitude larger than the vertical error and showed a plus or minus 50 percent variation with SAS. It increased with dutch roll frequency and damping, and it decreased most significantly with increased roll stability. The variation in lateral error with bank angle for curved flight was also a significant function of the augmented poles.

Porter, M. B., Jr.↗
DOE OSTI2024

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗
NASA NTRS1987

Stochastic control of infinite dimensional systems in Hilbert space: A factorization perspective

A factorization perspective on problems of optimal causal estimation and optimal causal control of linear stochastic systems defined on an infinite-dimensional Hilbert space is presented. A separation principle is derived for the case in which the system input/output map is generated by an abstract evolution operator. The factorization formalism allows for an essentially algebraic approach to these problems.

Milman, Mark M.↗
DOE OSTI2022

Stochastic Strategic Participation of Active Distribution Networks With High-Penetration DERs in Wholesale Electricity Markets

With the increasing penetration of distributed energy resources (DERs), traditional distribution networks as load-serving entities in wholesale electricity markets, now evolve towards active distribution networks (ADNs) which can proactively participate in wholesale markets by optimally controlling the DERs in their networks. A stochastic bilevel optimization model is proposed in this paper for the strategic participation of ADNs and DERs to provide energy and grid services in wholesale electricity markets. The bilevel optimization model can capture the interactions between the ADN and the wholesale energy and ancillary service markets, considering the uncertainties of DERs in the ADN. In the upper-level model, the ADN makes optimal decisions on energy and reserve bidding considering the availability, uncertainties, and flexibility of DERs. The joint energy and reserve market-clearing of the independent system operator (ISO) is modeled as the lower-level problem. Using strong duality theory and Karush-Kuhn Tucker (KKT) conditions, the proposed bilevel optimization problem is reformulated as mathematical programming with equilibrium constraints (MPEC) problem and further converted into a computationally-solvable mixed-integer second-order-cone programming (MISOCP) model. The simulation results demonstrate the effectiveness of the model and the interactions between an ADN and wholesale electricity markets.

active distribution network↗