Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convex relaxation”

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.

66 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

On relaxations of the max k -cut problem formulations

Here, a tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗
DOE OSTI2023

Certifiably Correct Range-Aided SLAM

We present the first algorithm capable of efficiently computing certifiably optimal solutions to range-aided simultaneous localization and mapping (RA-SLAM) problems. Robotic navigation systems are increasingly incorporating point-to-point ranging sensors, leading state estimation which takes the form of RA-SLAM. However, the RA-SLAM problem is more difficult to solve than traditional pose-graph SLAM; ranging sensor models introduce additional non-convexity, unlike pose-pose or pose-landmark measurements, a single range measurement does not uniquely determine the relative transform between the involved sensors, and RA-SLAM inference is highly sensitive to initial estimates. Our approach relaxes the RA-SLAM problem to a semidefinite program (SDP), which we show how to solve efficiently using the Riemannian staircase methodology. The solution of this SDP provides a high-quality initialization for our original RA-SLAM problem, which is subsequently refined via local optimization, as well as a lower-bound on the RA-SLAM problem's optimal value. Our algorithm, named certifiably correct RA-SLAM (CORA), applies to problems comprised of arbitrary pose-pose, pose-landmark, and ranging measurements. Evaluation on simulated and real-world marine examples shows that our algorithm frequently produces certifiably optimal RA-SLAM solutions; moreover, even suboptimal estimates are typically within 1-2\% of the optimal value.

Papalia, Alan↗
DOE OSTI2021

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Validating Drag and Heating Coefficients for Hollow Reentry Objects in Continuum Flow Using a Mach 7 Ludwieg Tube

Drag and heating coefficient databases and models are crucial to destructive reentry simulation. The NASA Orbital Debris Program Office (ODPO) develops, maintains, and performs analysis with the Object Reentry Survival Analysis Tool (ORSAT), which comprises drag and heating models for free molecular, transitional, and continuum flow regimes. These models have, in the past, only included solid, convex, blunt shapes (such as boxes, spheres, and cylinders). Previous work led by ODPO includes the extension of these models to hollow cylinders and square boxes in free molecular and transitional flow using the Direct Simulation Monte Carlo (DSMC) method. Since 2019, the ODPO has continued its program of DSMC simulations and extended the project to include analyses with the NASA Data Parallel Line Relaxation (DPLR) program on hollow cylinders and boxes (with varying wall thickness-diameter ratio). In fall 2022, the ODPO began a collaboration with the University of Texas San Antonio (UTSA) to use the Mach 7 Ludwieg Tube facility to validate the model built using numerical simulations. This facility can replicate (at a scale of approximately 100:1) the conditions seen by reentering objects near typical demise altitudes. We present here the drag and heating coefficients derived from the continued DSMC simulations, the new DPLR simulations, and the 26-test series at UTSA.

Chris Ostrom↗
NASA NTRS2023

Validating Drag and Heating Coefficients for Hollow Reentry Objects in Continuum Flow Using a Mach 7 Ludwieg Tube

Drag and heating coefficient databases and models are crucial to destructive reentry simulation. The NASA Orbital Debris Program Office (ODPO) develops, maintains, and performs analysis with the Object Reentry Survival Analysis Tool (ORSAT), which comprises drag and heating models for free molecular, transitional, and continuum flow regimes. These models have, in the past, only included solid, convex, blunt shapes (such as boxes, spheres, and cylinders). Previous work led by ODPO includes the extension of these models to hollow cylinders and square boxes in free molecular and transitional flow using the Direct Simulation Monte Carlo (DSMC) method. Since 2019, the ODPO has continued its program of DSMC simulations and extended the project to include analyses with the NASA Data Parallel Line Relaxation (DPLR) program on hollow cylinders and boxes (with varying wall thickness-diameter ratio). In fall 2022, the ODPO began a collaboration with the University of Texas San Antonio (UTSA) to use the Mach 7 Ludwieg Tube facility to validate the model built using numerical simulations. This facility can replicate (at a scale of approximately 100:1) the conditions seen by reentering objects near typical demise altitudes. We present here the drag and heating coefficients derived from the continued DSMC simulations, the new DPLR simulations, and the 26-test series at UTSA.

Chris Ostrom↗
DOE OSTI2022

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗
NASA NTRS1993

A Reynolds stress model for near-wall turbulence

The paper formulates a tensorially consistent near-wall second-order closure model. Redistributive terms in the Reynolds stress equations are modeled by an elliptic relaxation equation in order to represent strongly nonhomogeneous effects produced by the presence of walls; this replaces the quasi-homogeneous algebraic models that are usually employed, and avoids the need for ad hoc damping functions. The model is solved for channel flow and boundary layers with zero and adverse pressure gradients. Good predictions of Reynolds stress components, mean flow, skin friction, and displacement thickness are obtained in various comparisons to experimental and direct numerical simulation data. The model is also applied to a boundary layer flowing along a wall with a 90-deg, constant-radius, convex bend.

Durbin, P. A.↗
NASA NTRS1989

Numerical optimization in Hilbert space using inexact function and gradient evaluations

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

Carter, Richard G.↗
DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗
DOE OSTI2022

Stochastic exciton-scattering theory of optical line shapes: Renormalized many-body contributions

Spectral line shapes provide a window into the local environment coupled to a quantum transition in the condensed phase. In this paper, we build upon a stochastic model to account for non-stationary background processes produced by broad-band pulsed laser stimulation, as distinguished from those for stationary phonon bath. In particular, we consider the contribution of pair-fluctuations arising from the full bosonic many-body Hamiltonian within a mean-field approximation, treating the coupling to the system as a stochastic noise term. Herein, using the Itô transformation, we consider two limiting cases for our model, which lead to a connection between the observed spectral fluctuations and the spectral density of the environment. In the first case, we consider a Brownian environment and show that this produces spectral dynamics that relax to form dressed excitonic states and recover an Anderson–Kubo-like form for the spectral correlations. In the second case, we assume that the spectrum is Anderson–Kubo like and invert to determine the corresponding background. Using the Jensen inequality, we obtain an upper limit for the spectral density for the background. The results presented here provide the technical tools for applying the stochastic model to a broad range of problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗