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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Differentiable McCormick relaxations

McCormick's classical relaxation technique constructs closed-form convex and concave relaxations of compositions of simple intrinsic functions. These relaxations have several properties which make them useful for lower bounding problems in global optimization: they can be evaluated automatically, accurately, and computationally inexpensively, and they converge rapidly to the relaxed function as the underlying domain is reduced in size. They may also be adapted to yield relaxations of certain implicit functions and differential equation solutions. However, McCormick's relaxations may be nonsmooth, and this nonsmoothness can create theoretical and computational obstacles when relaxations are to be deployed. This article presents a continuously differentiable variant of McCormick's original relaxations in the multivariate McCormick framework of Tsoukalas and Mitsos. Gradients of the new differentiable relaxations may be computed efficiently using the standard forward or reverse modes of automatic differentiation. Furthermore, extensions to differentiable relaxations of implicit functions and solutions of parametric ordinary differential equations are discussed. A C++ implementation based on the library MC++ is described and applied to a case study in nonsmooth nonconvex optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Resistive Network Optimal Power Flow: Uniqueness and Algorithms

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

Tan, CW↗
DOE OSTI2020

Application of Koopman operator for model-based control of fracture propagation and proppant transport in hydraulic fracturing operation

This work explores the application of the recently developed Koopman operator approach for model identification and feedback control of a hydraulic fracturing process. Controlling fracture propagation and proppant transport with precision is a challenge due in large part to the difficulty of constructing approximate models that accurately capture the characteristic moving boundary and highly-coupled dynamics exhibited by the process. Koopman operator theory is particularly attractive here as it offers a way to explicitly construct linear representations for even highly nonlinear dynamics. The method is data-driven and relies on lifting the states to an infinite-dimensional space of functions called observables where the dynamics are governed by a linear Koopman operator. Here this work considers two problems: (a) fracture geometry control, and (b) proppant concentration control. In both cases, an approximate linear model of the corresponding dynamics is constructed and used to design a model predictive controller (MPC). The manuscript shows that in the case of highly nonlinear dynamics, as observed in the proppant concentration, use of canonical functions in the observable basis fails. In such cases, a priori system knowledge can be leveraged to choose the required basis. The numerical experiments demonstrate that the Koopman linear model shows excellent agreement with the real system and successfully achieves the desired target values maximizing the oil and gas productivity. Additionally, due to its linear structure, the Koopman models allow convex MPC formulations that avoid any issues associated with nonlinear optimization.

42 ENGINEERING↗
DOE OSTI2020

Robust Control of Wave Energy Converters Using Unstructured Uncertainty

In the design of ocean wave energy converters, proper control design is essential to the maximization of the power generation performance for the device. However, in realistic applications, this control design must be undertaken in the presence of model uncertainty. This paper considers the use of robust control theory to optimize the nominal performance for a wave energy converter in stochastic waves, subject to the constraint that the controller be stability-robust to unstructured uncertainties. We formulate the problem as a multi-objective optimal control problem, in which the primary objective is the maximization of power generation for the nominal system, and the competing objective is the norm of the uncertainty input/output channel. This optimal control problem is nonconvex, and we therefore propose an iterative algorithm that can be used to arrive at a local optimal solution. This iterative approach employs the concept of Iterative Convex Overbounding, in the context of the classical Method of Centers. Here, the methodology is demonstrated on a model of a single, buoy- type wave energy converter.

16 TIDAL AND WAVE POWER↗
DOE OSTI2024

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations

Here, we demonstrate that valid inequalities, or lifted nonlinear cuts (LNC), can be projected to tighten the Second Order Cone (SOC), Convex DistFlow (CDF), and Network Flow (NF) relaxations of the AC Optimal Power Flow (AC-OPF) problem. We conduct experiments on 38 cases from the PGLib-OPF library, showing that the LNC strengthen the SOC and CDF relaxations in 100% of the test cases, with average and maximum differences in the optimality gaps of 6.2% and 17.5% respectively. The NF relaxation is strengthened in 46.2% of test cases, with average and maximum differences in the optimality gaps of 1.3% and 17.3% respectively. We also study the trade-off between relaxation quality and solve time, demonstrating that the strengthened CDF relaxation outperforms the strengthened SOC formulation in terms of runtime and number of iterations needed, while the strengthened NF formulation is the most scalable with the lowest relaxation quality improvement due to these LNC.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2015

Weak Necessary and Sufficient Stochastic Maximum Principle for Markovian Regime-Switching Diffusion Models

In this paper we prove a weak necessary and sufficient maximum principle for Markovian regime switching stochastic optimal control problems. Instead of insisting on the maximum condition of the Hamiltonian, we show that 0 belongs to the sum of Clarke’s generalized gradient of the Hamiltonian and Clarke’s normal cone of the control constraint set at the optimal control. Under a joint concavity condition on the Hamiltonian and a convexity condition on the terminal objective function, the necessary condition becomes sufficient. We give four examples to demonstrate the weak stochastic maximum principle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Lanczos eigensolution method for high-performance computers

The theory, computational analysis, and applications are presented of a Lanczos algorithm on high performance computers. The computationally intensive steps of the algorithm are identified as: the matrix factorization, the forward/backward equation solution, and the matrix vector multiples. These computational steps are optimized to exploit the vector and parallel capabilities of high performance computers. The savings in computational time from applying optimization techniques such as: variable band and sparse data storage and access, loop unrolling, use of local memory, and compiler directives are presented. Two large scale structural analysis applications are described: the buckling of a composite blade stiffened panel with a cutout, and the vibration analysis of a high speed civil transport. The sequential computational time for the panel problem executed on a CONVEX computer of 181.6 seconds was decreased to 14.1 seconds with the optimized vector algorithm. The best computational time of 23 seconds for the transport problem with 17,000 degs of freedom was on the the Cray-YMP using an average of 3.63 processors.

Bostic, Susan W.↗
DOE OSTI2016

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

Here, this paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an interesting alternative to state-of-the-art semidefinite programming relaxations. Finally, three case studies in optimal power flow, optimal transmission switching and capacitor placement demonstrate the benefits of the new relaxations.

42 ENGINEERING↗
DOE OSTI2018

A Comparative Assessment of Economic Model Predictive Control Strategies for Fuel Economy Optimization of Heavy-Duty Trucks

This paper provides a comparative assessment of three control strategies that fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC) in an effort to minimize fuel consumption for a heavy-duty truck. The online MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. Three candidate economic MPC formulations are evaluated: a time-based formulation that directly penalizes predicted fuel consumption, a simplified time-based formulation that penalizes braking effort in place of fuel consumption, and a distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity based on DP. The performance of each approach is presented for three representative route profiles, using a medium-fidelity proprietary Volvo model of the heavy-duty truck’s longitudinal dynamics. Results demonstrate 4-7% fuel economy improvement across all three formulations, when compared to a baseline strategy. Furthermore, we present a detailed analysis of energy usage by “type” (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control approach.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗
DOE OSTI2022

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗
DOE OSTI2025

Data-Driven Compositional Optimization in Misspecified Regimes

With a manifold growth in the scale and intricacy of systems, the challenges of parametric misspecification become pronounced. These concerns are further exacerbated in compositional settings, which emerge in problems complicated by modeling risk and robustness. In “Data-Driven Compositional Optimization in Misspecified Regimes,” the authors consider the resolution of compositional stochastic optimization problems, plagued by parametric misspecification. In considering settings where such misspecification may be resolved via a parallel learning process, the authors develop schemes that can contend with diverse forms of risk, dynamics, and nonconvexity. They provide asymptotic and rate guarantees for unaccelerated and accelerated schemes for convex, strongly convex, and nonconvex problems in a two-level regime with extensions to the multilevel setting. Surprisingly, the nonasymptotic rate guarantees show no degradation from the rate statements obtained in a correctly specified regime and the schemes achieve optimal (or near-optimal) sample complexities for general T-level strongly convex and nonconvex compositional problems.

Business & Economics↗
DOE OSTI2019

Economic Optimal Control for Minimizing Fuel Consumption of Heavy-Duty Trucks in a Highway Environment

This paper provides a comparative assessment of three economic optimal control strategies, aimed at minimizing the fuel consumption of heavy-duty trucks in a highway environment, under a representative lead vehicle model informed by traffic data. These strategies fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC). We then show how two of the three strategies can be adapted to accommodate the presence of traffic and optimally navigate signalized intersections using infrastructure-to-vehicular (I2V) communication. The MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. The three candidate economic MPC formulations that are evaluated include: a nonlinear time-based formulation that directly penalizes predicted fuel consumption, a nonlinear time-based formulation that penalizes braking effort as a surrogate for fuel consumption, and a linear distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity profile obtained from DP. Using a medium-fidelity Simulink model, based on a Volvo truck's longitudinal and engine dynamics, we analyze the optimization's performance on four highway routes under various traffic scenarios. Results demonstrate 3.7-8.3% fuel economy improvement on highway routes without traffic and 6.5-10% on the same routes with traffic included. Furthermore, we present a detailed analysis of energy usage by "type" (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control strategy.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

Application of an Evolutionary Algorithm for Parameter Optimization in a Gully Erosion Model

Herein we demonstrate how to use model optimization to determine a set of best-fit parameters for a landform model simulating gully incision and headcut retreat. To achieve this result we employed the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), an iterative process in which samples are created based on a distribution of parameter values that evolve over time to better fit an objective function. CMA-ES efficiently finds optimal parameters, even with high-dimensional objective functions that are non-convex, multimodal, and non-separable. We ran model instances in parallel on a high-performance cluster, and from hundreds of model runs we obtained the best parameter choices. This method is far superior to brute-force search algorithms, and has great potential for many applications in earth science modeling. We found that parameters representing boundary conditions tended to converge toward an optimal single value, whereas parameters controlling geomorphic processes are defined by a range of optimal values.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E{sup 2} a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E{sup 3} case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Guaranteeing a Physically Realizable Battery Dispatch Without Charge-Discharge Complementarity Constraints

The non-convex complementarity constraints present a fundamental computational challenge in energy constrained optimization problems. In this work, we present a new, linear, and robust battery optimization formulation that sidesteps the need for battery complementarity constraints and integers and prove analytically that the formulation guarantees that all energy constraints are satisfied which ensures that the optimized battery dispatch is physically realizable. In addition, we bound the worst-case model mismatch and discuss conservativeness. In conclusion, simulation results further illustrate the effectiveness of this approach.

25 ENERGY STORAGE↗