Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Linearized modeling and optimization of shared mooring systems

Shared mooring systems, where adjacent platforms are tethered directly to each other, can reduce anchor quantities and mooring line lengths in a floating array but also introduce new modeling and design challenges. This paper presents and demonstrates a first-order approach to modeling and designing shared mooring systems that simplifies these challenges. We formulate a general, linearized model for the force-displacement response of shared mooring systems, including inter-platform couplings. Using this linearization, we realize significant simplifications to the shared mooring system design problem and propose a corresponding design optimization approach. Finally, we demonstrate the complete approach on a variety of shared-mooring floating wind farm layouts with generic design assumptions and constraints. Some fundamental observations about shared mooring systems can be made from the results. Polygonal array layouts with perpendicular anchor positions appear to maximize shared mooring system efficiency. Also, arrays with greater levels of sharing tend to exhibit larger deviations in offsets between platforms. Overall, the results show how the linearized approach can be applied to efficiently evaluate and systematically optimize preliminary shared mooring system designs.

17 WIND ENERGY↗
DOE OSTI2021

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Direct computation of optimal control of forced linear system

It is known that the optimal control of a forced linear system may be reduced to that of tracking the system without forces. The solution of the tracking problem is available via the costate variables method. This procedure is computationally expensive for large order systems. It requires solution of matrix Riccati equation and two final value problems. An alternate approach is outlined for the direct computation of the optimal control. Instead of Riccati equation, a matrix Volterra integral must be solved. For this purpose two computational schemes are described, and an illustrative example is given. The results compare favorably with the classical solution. This alternative approach may be especially useful for the control of large space structure where large order models are required.

Utku, S.↗
DOE OSTI2021

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers

The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite, and they become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL T decompositions. Here, we benchmark five well known direct linear solver packages on CPU- and GPU-based hardware, using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases. For completeness of the comparison we include results for MA57, which is one of the most efficient and reliable CPU solvers for this class of problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗
NASA NTRS1977

Optimal filtering and filter stability of linear stochastic delay systems

Optimal filtering equations are obtained for very general linear stochastic delay systems. Stability of the optimal filter is studied in the case where there are no delays in the observations. Using the duality between linear filtering and control, asymptotic stability of the optimal filter is proved. Finally, the cascade of the optimal filter and the deterministic optimal quadratic control system is shown to be asymptotically stable as well.

Kwong, R. H.-S.↗
NASA NTRS1975

Constrained optimal controller for linear systems with state and control dependent disturbance

The problem is posed with the additional constraints that the dynamic controller uses only noise-corrupted outputs, and that its dimension is significantly lower than that of a Kalman filter. The unknown disturbance is viewed as an adversary which tries to maximize a performance criterion: a criterion that the controller gains attempt to minimize. The optimal controller gains are determined by solving a nonlinear matrix two-point boundary value problem.

Basuthakur, S.↗
DOE OSTI2023

Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems

This paper studies the trade-off between the degree of decentralization and the performance of a distributed controller in a linear-quadratic control setting. We study a system of interconnected agents over a graph and a distributed controller, called k-distributed control, which lets the agents make control decisions based on the state information within distance k on the underlying graph. This controller can tune its degree of decentralization using the parameter k and thus allows a characterization of the relationship between decentralization and performance. We show that under mild assumptions, including stabilizability, detectability, and a subexponentially growing graph condition, the performance difference between k-distributed control and centralized optimal control becomes exponentially small in k. Finally, this result reveals that distributed control can achieve near-optimal performance with a moderate degree of decentralization, and thus it is an effective controller architecture for large-scale networked systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗