Search NASA⌕ Search

SEARCH · Search NASA

Results for “quadratic 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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Resonance compensation at the CERN PS booster aided by Bayesian optimization and BOBYQA

The CERN Proton Synchrotron Booster (PSB) operation involves the crossing of multiple resonance lines in the tune diagram. Loss maps from dynamic tune scans are a helpful way to visualize and quantify the strength of such resonances. Sextupole and octupole correctors can be used in order to partially or fully compensate multiple resonance lines, i.e., third and fourth order lines. The following work explores the application of advanced optimization algorithms such as Bayesian Optimization and Bound Optimization By Quadratic Approximation (BOBYQA) in order to compensate these resonance lines with available correctors.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Asymptotic Behavior of Memristive Circuits

The interest in memristors has risen due to their possible application both as memory units and as computational devices in combination with CMOS. This is in part due to their nonlinear dynamics, and a strong dependence on the circuit topology. We provide evidence that also purely memristive circuits can be employed for computational purposes. In the present paper we show that a polynomial Lyapunov function in the memory parameters exists for the case of DC controlled memristors. Such a Lyapunov function can be asymptotically approximated with binary variables, and mapped to quadratic combinatorial optimization problems. This also shows a direct parallel between memristive circuits and the Hopfield-Little model. In the case of Erdos-Renyi random circuits, we show numerically that the distribution of the matrix elements of the projectors can be roughly approximated with a Gaussian distribution, and that it scales with the inverse square root of the number of elements. This provides an approximated but direct connection with the physics of disordered system and, in particular, of mean field spin glasses. Using this and the fact that the interaction is controlled by a projector operator on the loop space of the circuit. We estimate the number of stationary points of the approximate Lyapunov function and provide a scaling formula as an upper bound in terms of the circuit topology only.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Attitude control of a spinning Skylab.

Active attitude control of a spinning Skylab is analyzed to determine a simple control law that will provide a satisfactory response, considering the dynamics of attached flexible appendages. A simplified model of the complex Skylab vehicle is selected to make it analytically tractable. The vehicle is modeled as a single rigid-core body with two attached flexible massless booms having masses on their tips. The equations of motion describing the attitude dynamics of the model are presented as a linear matrix-differential equation. The states of the vehicle are small perturbations about its steady-state spin. An analysis is performed to determine the domain of stability. Next, attitude dynamics are analyzed; both frequency domain (parameter plane) and time domain (an optimal linear quadratic loss program) techniques are compared. An analysis of the nonlinear effect of control torque saturation of Skylab's control moment gyroscopes is discussed. The results of the analysis compare favorably with a large-scale digital simulation of the Skylab.

Seltzer, S. M.↗
NASA NTRS1976

An application of modern control theory to an elastic spacecraft

Results are presented to illustrate the application of established procedures of linear, quadratic, Gaussian optimal estimation and control to a spacecraft with dynamically significant elastic appendages. Interpretations are provided in both time domain and frequency domain, and conclusions are drawn for a wide class of problems of flexible spacecraft attitude control.

Larson, V.↗
NASA NTRS1985

Chandrasekhar equations for infinite dimensional systems

The existence of Chandrasekhar equations for linear time-invariant systems defined on Hilbert spaces is investigated. An important consequence is that the solution to the evolutional Riccati equation is strongly differentiable in time, and that a strong solution of the Riccati differential equation can be defined. A discussion of the linear-quadratic optimal-control problem for hereditary differential systems is also included.

Ito, K.↗
NASA NTRS1988

Structural tailoring and feedback control synthesis - An interdisciplinary approach

Structural tailoring provides an attractive method to optimize the performance of actively controlled space structures. However, the simultaneous optimization of control gains and structural properties often becomes prohibitively expensive for large systems and physical insight is often lost in the resulting control law. This paper presents a method for optimization of the closed loop structural system using only structural tailoring. Optimal Linear Quadratic Regulator (LQR) control theory is used with weighting matrices chosen based on physical considerations. The LQR control law depends only on two scalar gains and the structural properties. Hence, the closed loop-performance can be expressed in terms of the structural parameters. Results are given for a beam and a truss-beam to show the simplicity of the method and the importance of structural tailoring to increase dynamic performance and to reduce the control effort.

Belvin, W. Keith↗
NASA NTRS1989

Application of precomputed control laws in a reconfigurable aircraft flight control system

A self-repairing flight control system concept in which the control law is reconfigured after actuator and/or control surface damage to preserve stability and pilot command tracking is described. A key feature of the controller is reconfigurable multivariable feedback. The feedback gains are designed off-line and scheduled as a function of the aircraft control impairment status so that reconfiguration is performed simply by updating the gain schedule after detection of an impairment. A novel aspect of the gain schedule design procedure is that the schedule is calculated using a linear quadratic optimization-based simultaneous stabilization algorithm in which the scheduled gain is constrained to stabilize a collection of plant models representing the aircraft in various control failure modes. A description and numerical evaluation of a controller design for a model of a statically unstable high-performance aircraft are given.

Moerder, Daniel D.↗
NASA NTRS2008

Multiplexed Predictive Control of a Large Commercial Turbofan Engine

Model predictive control is a strategy well-suited to handle the highly complex, nonlinear, uncertain, and constrained dynamics involved in aircraft engine control problems. However, it has thus far been infeasible to implement model predictive control in engine control applications, because of the combination of model complexity and the time allotted for the control update calculation. In this paper, a multiplexed implementation is proposed that dramatically reduces the computational burden of the quadratic programming optimization that must be solved online as part of the model-predictive-control algorithm. Actuator updates are calculated sequentially and cyclically in a multiplexed implementation, as opposed to the simultaneous optimization taking place in conventional model predictive control. Theoretical aspects are discussed based on a nominal model, and actual computational savings are demonstrated using a realistic commercial engine model.

Richter, hanz↗
NASA NTRS2019

Control and Simulation of a Deployable Entry Vehicle with Aerodynamic Control Surfaces

In this paper, we investigate the static stability of a deployable entry vehicle called the Lifting Nano-ADEPT and design a control system to follow bank angle, angle-of-attack, and sideslip guidance commands. The control design, based on linear quadratic regulator optimal techniques, utilizes aerodynamic control surfaces to track angle-of-attack, sideslip angle, and bank angle commands. We demonstrate, using a nonlinear simulation environment, that the controller is able to accurately track step commands that may come from a guidance algorithm.

Margolis, Benjamin W. L.↗
NASA NTRS1989

Linear quadratic tracking problems in Hilbert space - Application to optimal active noise suppression

A unified treatment of the linear quadratic tracking (LQT) problem, in which a control system's dynamics are modeled by a linear evolution equation with a nonhomogeneous component that is linearly dependent on the control function u, is presented; the treatment proceeds from the theoretical formulation to a numerical approximation framework. Attention is given to two categories of LQT problems in an infinite time interval: the finite energy and the finite average energy. The behavior of the optimal solution for finite time-interval problems as the length of the interval tends to infinity is discussed. Also presented are the formulations and properties of LQT problems in a finite time interval.

Banks, H. T.↗
NASA NTRS1988

Linear-Quadratic Controller For Aiming A Large Antenna

Independent control and estimator gains selected for optimal performance. Report describes use of techniques of linear-quadratic optimal control to design digital controller aiming large antenna. Based on closed-loop concept including mathematical model of plant and independently-selectable mathematical model estimates state of system.

Nickerson, Jackson A.↗
NASA NTRS1983

Optimal design of a passive vibration absorber for a truss beam

The selection of the design parameters of passive vibration absorbers attached to a long cantilevered beam is studied. This study was motivated by the need for conducting parametric analysis of dynamics and control for Space-Shuttle-attached long beams. An optimization scheme using a quadratic cost function is introduced yielding the optimal sizing of the tip vibration absorber. Analytical solutions for an optimal absorber are presented for the case of one beam vibrational mode coupled with the absorber dynamics, and results are extended to cover the multiple mode case. An algorithm is developed to make an initial estimate of optimal tuning parameters which minimize the quadratic error cost function. Examples are given to illustrate the design concept.

Juang, J.-N.↗
DOE OSTI2020

Tucker-1 Boolean Tensor Factorization with Quantum Annealers

Quantum annealers are an emerging computational architecture that have the potential to address some challenging computational issues that will be left unresolved as we approach the end of the Moore's Law era of computing. D-Wave quantum annealers are designed to solve a challenging set of problems - quadratic unconstrained binary optimization problems. This makes them a natural fit for solving problems with binary or Boolean variables. Here, we explore the use of a quantum annealer to solve Boolean tensor factorization. The goal of Boolean tensor factorization is to represent a high-dimensional tensor filled with Boolean values as a product of Boolean matrices and a Boolean core tensor. We show that a particular Boolean tensor factorization problem (called Tucker-1 factorization) can be decomposed into a sequence of quadratic unconstrained binary optimization problems that can be solved with a D-Wave 2000Q quantum annealer. While quantum annealers specifically and quantum computers in general are at a fairly early stage in their development, they are currently capable of solving these Boolean tensor factorization problems. Importantly, our results show that for fairly small tensors, we are frequently able to obtain an accurate (sometimes exact) factorization using quantum annealing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data-driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high-performance functional materials. Surrogate-based active learning, continually improving its surrogate model by iteratively including high-quality data points, has emerged as a cost-effective data-driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM-based active learning.

active learning↗
DOE OSTI2022

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Degeneracy engineering for classical and quantum annealing: A case study of sparse linear regression in collider physics

Classical and quantum annealing are computing paradigms that have been proposed to solve a wide range of optimization problems. In this paper, we aim to enhance the performance of annealing algorithms by introducing the technique of degeneracy engineering, through which the relative degeneracy of the ground state is increased by modifying a subset of terms in the objective Hamiltonian. We illustrate this novel approach by applying it to the example of ℓ 0 -norm regularization for sparse linear regression, which is, in general, an NP-hard optimization problem. Specifically, we show how to cast ℓ 0 -norm regularization as a quadratic unconstrained binary optimization (QUBO) problem, suitable for implementation on annealing platforms. As a case study, we apply this QUBO formulation to energy flow polynomials in high-energy collider physics, finding that degeneracy engineering substantially improves the annealing performance. Furthermore, our results motivate the application of degeneracy engineering to a variety of regularized optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗