Search NASA⌕ Search

SEARCH · Search NASA

Results for “convex 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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2012

Lossless Convexification of Control Constraints for a Class of Nonlinear Optimal Control Problems

In this paper we consider a class of optimal control problems that have continuous-time nonlinear dynamics and nonconvex control constraints. We propose a convex relaxation of the nonconvex control constraints, and prove that the optimal solution to the relaxed problem is the globally optimal solution to the original problem with nonconvex control constraints. This lossless convexification enables a computationally simpler problem to be solved instead of the original problem. We demonstrate the approach in simulation with a planetary soft landing problem involving a nonlinear gravity field.

planetary soft landing↗
DOE OSTI2026

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗
DOE OSTI2018

HyperSpace: Distributed Bayesian Hyperparameter Optimization

As machine learning models continue to increase in complexity, so does the potential number of free model parameters commonly known as hyperparameters. While there has been considerable progress toward finding optimal configurations of these hyperparameters, many optimization procedures are treated as black boxes. We believe optimization methods should not only return a set of optimized hyperparameters, but also give insight into the effects of model hyperparameter settings. To this end, we present HyperSpace, a parallel implementation of Bayesian sequential model-based optimization. HyperSpace leverages high performance computing (HPC) resources to better understand unknown, potentially non-convex hyperparameter search spaces. We show that it is possible to learn the dependencies between model hyperparameters through the optimization process. By partitioning large search spaces and running many optimization procedures in parallel, we also show that it is possible to discover families of good hyperparameter settings over a variety of models including unsupervised clustering, regression, and classification tasks.

Computer Science↗
DOE OSTI2021

Optimal Power Flow in DC Networks with Robust Feasibility and Stability Guarantees

With high penetrations of renewable generation and variable loads, there is significant uncertainty associated with power flows in DC networks such that stability and operational constraint satisfaction are of concern. Most existing DC network optimal power flow (DN-OPF) formulations assume exact knowledge of loading conditions and do not provide stability guarantees. Here, in contrast, this paper studies a DN-OPF formulation which considers both stability and operational constraint satisfaction under uncertainty. The need to account for a range of uncertainty realizations in this paper's robust optimization formulation results in a challenging semi-infinite program (SIP). The proposed solution algorithm reformulates this SIP into a computationally tractable problem by constructing a tight convex inner approximation of the stability set using sufficient conditions for the existence of a feasible and stable power flow solution. Optimal generator set-points are obtained by optimizing over the proposed convex stability set. The validity and effectiveness of the propose algorithm is demonstrated through various DC networks adapted from IEEE test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗
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 OSTI2024

Exponential concentration in quantum kernel methods

Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model’s parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimized finite-build stellarator coils using automatic differentiation

A new stellarator coil design code is introduced that optimizes the position and winding pack orientation of finite-build coils. The new code, called flexible optimized curves in space using automatic differentiation (AD) and finite build (FOCUSADD), performs gradient-based optimization in a high-dimensional, non-convex space. The derivatives with respect to parameters of finite-build coils are easily and efficiently computed using AD. FOCUSADD parametrizes coil positions in free space using a Fourier series and uses a multi-filament approximation to the coil winding pack. The orientation of the winding pack is parametrized with a Fourier series and can be optimized as well. Optimized finite-build coils for a Wendelstein 7-X (W7-X)-like stellarator are found, and compared with filamentary coil results. The final positions of optimized finite-build W7-X-like coils are shifted, on average, by approximately 2.5 mm relative to optimized filamentary coils. These results suggest that finite-build effects should be accounted for in the optimization of stellarators with low coil tolerances.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1991

Integration of mechanism and control for large-angle slew maneuvers of flexible structures

A rolling contact noncircular gear system is applied to assist a desired controller in the slewing of a flexible space structure. The varying gear ratio in cooperation with the controller results in lower feedback gains at the controller, as well as considerably reducing flexural vibrations of the space structure. The noncircular gears consist of a pair of convex noncircular cylinders with specially designed profiles that are synthesized in conjunction with the optimal controller gains for minimizing the flexural vibrations of flexible structure during a slew maneuver. Convexity of the cylindrical profiles for this noncircular gear device must be ensured to maintain rolling contact between the two cylinders. Simulations of slewing control tasks for two kinds of flexible space structures, such as a planar flexible beam and the planar articulated flexible beams, are presented.

Chew, Meng-Sang↗
NASA NTRS1986

Optimal block cosine transform image coding for noisy channels

The two dimensional block transform coding scheme based on the discrete cosine transform was studied extensively for image coding applications. While this scheme has proven to be efficient in the absence of channel errors, its performance degrades rapidly over noisy channels. A method is presented for the joint source channel coding optimization of a scheme based on the 2-D block cosine transform when the output of the encoder is to be transmitted via a memoryless design of the quantizers used for encoding the transform coefficients. This algorithm produces a set of locally optimum quantizers and the corresponding binary code assignment for the assumed transform coefficient statistics. To determine the optimum bit assignment among the transform coefficients, an algorithm was used based on the steepest descent method, which under certain convexity conditions on the performance of the channel optimized quantizers, yields the optimal bit allocation. Comprehensive simulation results for the performance of this locally optimum system over noisy channels were obtained and appropriate comparisons against a reference system designed for no channel error were rendered.

Vaishampayan, V.↗
NASA NTRS1990

Optimal block cosine transform image coding for noisy channels

The two dimensional block transform coding scheme based on the discrete cosine transform was studied extensively for image coding applications. While this scheme has proven to be efficient in the absence of channel errors, its performance degrades rapidly over noisy channels. A method is presented for the joint source channel coding optimiaation of a scheme based on the 2-D block cosine transorm when the output of the encoder is to be transmitted via a memoryless design of the quantizers used for encoding the transform coefficients. This algorithm produces a set of locally optimum quantizers and the corresponding binary code assignment for the assumed transform coefficient statistics. To determine the optimum bit assignment among the transform coefficients, an algorithm was used based on the steepest descent method, which under certain convexity conditions on the performance of the channel optimized quantizers, yields the optimal bit allocation. Comprehensive simulation results for the performance of this locally optimum system over noise channels were obtained and appropriate comparisons against a reference system designed for no channel error were rendered.

Vaishampayan, Vinay A.↗
DOE OSTI2017

A Geometric Approach to Aggregate Flexibility Modeling of Thermostatically Controlled Loads

Coordinated aggregation of a large population of thermostatically controlled loads (TCLs) presents a great potential to provide various ancillary services to the grid. One of the key challenges in coordination and control of TCLs is developing a simple and portable model to accurately extract their aggregate flexibility. In this paper, we propose a novel geometric approach to model the aggregate flexibility of TCLs. We show that the set of admissible power profiles of an individual TCL is a polytope, and their aggregate flexibility is the Minkowski sum of the individual polytopes. In order to represent their aggregate flexibility in an intuitive way and achieve a tractable approximation, we develop optimization-based algorithms to approximate the polytopes by the homothets of a given convex set. As a special application, this set is chosen as a virtual battery model and the corresponding optimal approximation problems are solved efficiently by equivalent linear programs. Numerical results show that our algorithms yield significant improvement in characterizing the aggregate flexibility over existing modeling methods. Finally, we also conduct case studies to demonstrate the efficacy of our approaches by coordinating TCLs to track a frequency regulation signal from the Pennsylvania-New Jersey-Maryland (PJM) Interconnection.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1986

Existence of the time optimal control for robotic manipulators

Using Filipov's Theorem, it is shown that the conditions oif nonfinite escape of trajectories, reachability, and convexity of the dynamics over all admissible controls are needed for the existence of a time optimal solution for the robotic equation. With a lower bound for the finite-escape time established using a Liapunov approach, and an upper bound for the time to reach the target established using the exact linearization idea, a single inequality is found which is closely related to the coriolis and the centrifugal terms, the absence of which implies that the domain of existence of the optimal solution can be made arbitrarily large with a large torque constraint. As the work space is finite, this is essentially a global result in practical situations.

Wen, J.↗