Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problem”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗
DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

A sequential Attacker-Defender game for distribution systems resilience enhancement against extreme weather events

Improving distribution system resilience against frequent extreme weather events is important for reliable power system operations. Especially when dealing with events such as hurricanes that have short-term predictions, proactive pre-event preparedness plays a vital role in system resilience performance. In this paper, we propose a novel approach to construct pre-event resource allocation plans for system operators to cope with upcoming threats through a sequential attacker-defender game framework. The sequential attacker-defender game is designed to model the interaction between the extreme weather and the system operator. In each round of the game, the attacker and the defender sequentially update their current strategies by accounting for the opponent’s action set. The attacker model is formulated as a bi-level problem to identify the severe outage scenarios, and the defender model is formulated as a two-stage optimization problem to determine the allocation of restoration resources including mobile responsive resources and repair crews. Two scale-reduction strategies are proposed to ensure the scalability of the game scheme. Finally, case studies on the IEEE 33-bus and a 7149-node practical utility system validate the effectiveness of the proposed sequential game and the efficiency of the scale-reduction strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
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 OSTI2024

Eco-driving Profile Optimization by Dynamic Programming for Battery Electric Vehicles

Although full automation has not yet been achieved, automated vehicles are a valid research area. Not only would automated vehicles provide ultimate driver convenience, but they would maximize energy efficiency by eliminating undesired human driving behaviors and optimally controlling the powertrain. From the perspective of control related to energy saving, speed profile optimization is important for improving system efficiency and satisfying passenger demands. This study employs Dynamic Programming (DP) to solve the constrained optimal problem for travel time, distance, and speed limit by exploring all possible control options. The solutions obtained by DP demonstrate consistent control patterns combining four control modes-acceleration, cruising, coasting, and braking, with cruising or coasting being selective depending on the boundary conditions. Further, this study introduces DP-based simulation results and attempts to provide comprehensive interpretations of the optimal policy by analyzing the essential factors that affect the control problem, including boundary conditions, road load, and powertrain characteristics. Based on these interpretations, the control concepts can be explained as the optimal policy selecting the best control option based on system efficiency and boundary conditions. The results of DP are compared with a human-like driver model to show that the optimal speed profiles can effectively reduce energy consumption.

Autonomous vehicles↗
DOE OSTI2024

Robust Data-Driven Predictive Run-to-Run Control for Automated Serial Sectioning

This letter presents a one-step predictive run-to-run controller (R2R-MPC) for the automation of mechanical serial sectioning (MSS), a destructive material analysis process. To address the inherent uncertainty and disturbances in the MSS process, a robust closed-loop approach is presented. Here, the robust R2R-MPC models the uncertainty of the MSS process using a linear differential inclusion. As an analytical model of the MSS process is unavailable, the differential inclusion is identified from historical data. The R2R-MPC is posed as an optimization problem that computes incremental changes to the control input which minimize the worst-case material removal errors. This optimization-based controller is combined with a run-to-run controller to provide integral action that rejects constant disturbances and tracks constant reference removal rates. To demonstrate the efficacy of our robust R2R-MPC, we present simulation results which compare the presented controller with a conventional non-robust R2R.

42 ENGINEERING↗
DOE OSTI2025

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗
DOE OSTI2026

Intrusive Uncertainty Quantification and Optimal Experiment Design in the Open-Source Pyomo Ecosystem

This contribution describes ParmEst and Pyomo.DoE, two pillars of the open-source Python-based Pyomo ecosystem for computational optimization with (partial differential) algebraic equation mathematical models. Specifically, ParmEst facilitates intrusive frequentist parameter estimation (PE) and uncertainty quantification (UQ) through built-in features, such as covariance matrix estimation, bootstrapping, and likelihood ratio tests. Complementary, Pyomo.DoE enables optimal experiment design by maximizing various metrics of the Fisher information matrix, such as A-optimality (trace), D-optimality (determinant), E-optimality (minimum eigenvalue), and ME-optimality (condition number). ParmEst and Pyomo.DoE can solve high-dimensional optimization problems by leveraging the model structure and exact derivative information. Finally, we will discuss future opportunities to integrate PE and UQ capabilities with optimization under uncertainty, including robust optimization with non-convex models via PyROS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Capacitated p -hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches

By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.

Capacitated p-hub approach↗
DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
DOE OSTI2025

Q-OPT:Quantum Optimization Toolkit

SF-2025-003 Quantum computing has the potential to solve classical optimization problems. To bring these algorithms into practical use, a comprehensive, high-performance and user-friendly toolkit is essential. The Q-OPT: Quantum Optimization Toolkit is a collection of software tools designed to support complete end-to-end framework for quantum optimization.

Hovland, Paul [Argonne National Laboratory (ANL), ↗
DOE OSTI2024

Learning to Branch with Interpretable Machine Learning Models

This presentation describes an algorithm for applying machine learning to branching to speed up the solution of integer optimization problems. These problems are challenging and solved multiple times a day by power systems operators. We show that our approach speeds up a widely used open-source optimization solver.

Bayramoglu, Selin↗
DOE OSTI2025

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗
DOE OSTI2025

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dynamic Modeling, Trajectory Optimization, and Linear Control of Cable-Driven Parallel Robots for Automated Panelized Building Retrofits

The construction industry faces a growing need for automation to reduce costs, improve accuracy and productivity, and address labor shortages. One area that stands to benefit significantly from automation is panelized prefabricated building envelope retrofits, which can improve a building’s energy efficiency in heating and cooling interior spaces. In this paper, we propose using cable-driven parallel robots (CDPRs), which can effectively lift and handle large objects, to install these panels. However, implementing CDPRs presents significant challenges because of their nonlinear dynamics, complex trajectory planning, and precise control requirements. To tackle these challenges, this work focuses on a new application of established control and trajectory optimization theories in a CDPR simulation of a building envelope retrofit under real-world conditions. We first model the dynamics of CDPRs, highlighting the critical role of damping in system behavior. Building on this dynamic model, we formulate a trajectory optimization problem to generate feasible and efficient motion plans for the robot under operational and environmental constraints. Given the high precision required in the construction industry, accurately tracking the optimized trajectory is essential. However, challenges such as partial observability and external vibrations complicate this task. To address these issues, a Linear Quadratic Gaussian control framework is applied, enabling the robot to track the optimized trajectories with precision. Simulation results show that the proposed controller enables precise end effector positioning with errors under 4 mm, even in the presence of external wind disturbances. Through comprehensive simulations, our approach allows for an in-depth exploration of the system’s nonlinear dynamics, trajectory optimization, and control strategies under controlled yet highly realistic conditions. The results demonstrate the feasibility of CDPRs for automating panel installation and provide insights into their practical deployment.

CDPR↗
DOE OSTI2026

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Conceptual Design of Integrated Energy Systems with Market Interaction Surrogate Models

Most integrated energy system (IES) optimization frameworks employ the price-taker approximation, which ignores important interactions with market and can result in overestimated economic values. In this work, we pro-pose a machine learning surrogate-assisted optimization framework to quantify the IES/market interactions and thus go beyond price taker. We use time series clustering to generate representative IES operation profiles for the IES optimization problem and use machine learning surrogate models to predict the IES/market interaction. We quantify the accuracy of the time series clustering and surrogate models in a case study to optimally retrofit a nuclear power plant with polymer electrolyte membrane electrolyzer to co-produce electricity and hydrogen.

Chen, Xinhe↗
DOE OSTI2024

Conceptual Design of Integrated Energy Systems with Market Interaction Surrogate Models

Most integrated energy system (IES) optimization frameworks employ the price-taker approximation, which ignores important interactions with the market and can result in overestimated economic values. In this work, we propose a machine learning surrogate-assisted optimization framework to quantify IES/market interactions and thus go beyond price-taker. We use time series clustering to generate representative IES operation profiles for the optimization problem and use machine learning surrogate models to predict the IES/market interaction. We quantify the accuracy of the time series clustering and surrogate models in a case study to optimally retrofit a nuclear power plant with a polymer electrolyte membrane electrolyzer to co-produce electricity and hydrogen.

Chen, Xinhe↗