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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Realizable optimal control for a remotely piloted research vehicle

The design of a control system using the linear-quadratic regulator (LQR) control law theory for time invariant systems in conjunction with an incremental gradient procedure is presented. The incremental gradient technique reduces the full-state feedback controller design, generated by the LQR algorithm, to a realizable design. With a realizable controller, the feedback gains are based only on the available system outputs instead of being based on the full-state outputs. The design is for a remotely piloted research vehicle (RPRV) stability augmentation system. The design includes methods for accounting for noisy measurements, discrete controls with zero-order-hold outputs, and computational delay errors. Results from simulation studies of the response of the RPRV to a step in the elevator and frequency analysis techniques are included to illustrate these abnormalities and their influence on the controller design.

Dunn, H. J.↗
NASA NTRS1986

A numerical algorithm for optimal feedback gains in high dimensional LQR problems

A hybrid method for computing the feedback gains in linear quadratic regulator problems is proposed. The method, which combines the use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated so as to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantage of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed and numerical evidence of the efficacy of our ideas presented.

Banks, H. T.↗
NASA NTRS1987

Optimal cure cycle design of a resin-fiber composite laminate

A unified computed aided design method was studied for the cure cycle design that incorporates an optimal design technique with the analytical model of a composite cure process. The preliminary results of using this proposed method for optimal cure cycle design are reported and discussed. The cure process of interest is the compression molding of a polyester which is described by a diffusion reaction system. The finite element method is employed to convert the initial boundary value problem into a set of first order differential equations which are solved simultaneously by the DE program. The equations for thermal design sensitivities are derived by using the direct differentiation method and are solved by the DE program. A recursive quadratic programming algorithm with an active set strategy called a linearization method is used to optimally design the cure cycle, subjected to the given design performance requirements. The difficulty of casting the cure cycle design process into a proper mathematical form is recognized. Various optimal design problems are formulated to address theses aspects. The optimal solutions of these formulations are compared and discussed.

Hou, Jean W.↗
DOE OSTI2013

A global approach of the representativity concept: Application on a high-conversion light water reactor MOX lattice case

The development of new types of reactor and the increase in the safety specifications and requirements induce an enhancement in both nuclear data knowledge and a better understanding of the neutronic properties of the new systems. This enhancement is made possible using ad hoc critical mock-up experiments. The main difficulty is to design these experiments in order to obtain the most valuable information. Its quantification is usually made by using representativity and transposition concepts. These theories enable to extract some information about a quantity of interest (an integral parameter) on a configuration, but generally a posteriori. This paper presents a more global approach of this theory, with the idea of optimizing the representativity of a new experiment, and its transposition a priori, based on a multiparametric approach. Using a quadratic sum, we show the possibility to define a global representativity which permits to take into account several quantities of interest at the same time. The maximization of this factor gives information about all quantities of interest. An optimization method of this value in relation to technological parameters (over-clad diameter, atom concentration) is illustrated on a high-conversion light water reactor MOX lattice case. This example tackles the problematic of plutonium experiment for the plutonium aging and a solution through the optimization of both the over-clad and the plutonium content. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2023

Greedy permanent magnet optimization

Abstract A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression. However, binary, grid-aligned solutions are desired for realistic engineering designs. We now show that the binary permanent magnet problem can be formulated as a quadratic program with quadratic equality constraints, the binary, grid-aligned problem is equivalent to the quadratic knapsack problem with multiple knapsack constraints, and the single-orientation-only problem is equivalent to the unconstrained quadratic binary problem. We then provide a set of simple greedy algorithms for solving variants of permanent magnet optimization, and demonstrate their capabilities by designing magnets for stellarator plasmas. The algorithms can a-priori produce sparse, grid-aligned, binary solutions. Despite its simple design and greedy nature, we provide an algorithm that compares with or even outperforms the state-of-the-art algorithms while being substantially faster, more flexible, and easier to use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2016

Use of the NLP10x10 Sequential Quadratic Programming Algorithm To Solve Rotorcraft Hub Loads Minimisation Problems

Previous research and experimentation on the use of a non-linear programming constrained optimisation technique to define an optimal control vector for rotorcraft applications indicated that use of this methodology was feasible and desirable in many cases. In particular, use of non-linear programming methods that solve a sequence of related quadratic-programming sub-problems were used successfully to solve these problems. Accordingly, a licence for one of the latest versions of Professor Klaus Schittkowskis very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment with and analyse typical optimisation problems of the type encountered in various rotorcraft wind tunnel and flight tests. This research resulted in the development of the general NLPQLP Computation System that could be used to solve problems of the type encountered in various rotorcraft applications where there is a linear dependence of the measurement vector on the control vector, and where equality andor inequality constraints might be imposed. This development was accomplished on a mainframe computer not part of actual wind tunnel andor flight-test experiment, but in a format which was transferable to wind tunnel lap-top computers. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.The System was developed in support of the five-bladed SMART Rotor Active Flap Rotor Hub Loads analytical minimisation research. The design and development of the Computation System was tailored to address the particular requirements of the problem to minimise a performance metric function of measured hub load harmonic angular couple components by optimising the control vector harmonic flap angular couple components subject to constraints on the amplitudes of these control vector harmonic flap angular couple components. In addition, to facilitate real time wind tunnel experimentation, the ability to rapidly selectchange the particular hub load harmonic angular couple components andor the particular control vector harmonic angular couple components to be considered in the optimisation procedure was provided in the System. This capability allows the singling out of particular hub load frequencies andor particular flap angle frequencies to be analysed during testing operations. The System was used very successfully for the SMART Active Flap Rotor Hub minimisation problems considered in the study, the results of which were presented at the American Helicopter Society Fifth Decennial Aeromechanics Specialist Conference in January 2014. Excellent agreement between cases initiated with best guess starting estimates for the control vector elements and cases initiated with zero control vector starting element estimates resulted, indicating the robustness of the NLP10x10 algorithm.

Rotorcraft Hub Loads↗
DOE OSTI2026

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗
DOE OSTI2023

Interface models for three-dimensional Rayleigh–Taylor instability

We derive interface models for three-dimensional Rayleigh–Taylor instability (RTI), making use of a novel asymptotic expansion in the non-locality of the fluid flow. These interface models are derived for the purpose of studying universal features associated with RTI such as the Froude number in single-mode RTI, the predicted quadratic growth of the interface amplitude under multi-mode random perturbations, the optimal (viscous) mixing rates induced by the RTI and the self-similarity of horizontally averaged density profiles and the remarkable stabilization of the mixing layer growth rate which arises for the three-fluid two-interface heavy–light–heavy configuration, in which the addition of a third fluid bulk slows the growth of the mixing layer to a linear rate. Our interface models can capture the formation of small-scale structures induced by severe interface roll-up, reproduce experimental data in a number of different regimes and study the effects of multiple interface interactions even as the interface separation distance becomes exceedingly small. Compared with traditional numerical schemes used to study such phenomena, our models provide a computational speed-up of at least two orders of magnitude.

Mechanics↗
DOE OSTI2018

Quantum Annealing for Prime Factorization

We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses O (log 2 ( N )) binary variables (qubits) for finding the factors of an integer N. We present how to factorize 15, 143, 59989, and 376289 using 4, 12, 59, and 94 logical qubits, respectively. This method was tested using the D-Wave 2000Q for finding an embedding and determining the prime factors for a given composite number. The method is general and could be used to factor larger integers as the number of available qubits increases, or combined with other ad hoc methods to achieve better performances for specific numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Weak lensing of intensity mapping: The cosmic infrared background

Gravitational lensing deflects the paths of cosmic infrared background (CIB) photons, leaving a measurable imprint on CIB maps. The resulting statistical anisotropy can be utilized to reconstruct the matter distribution out to the redshifts of CIB sources. To this end, we generalize the cosmic microwave background (CMB) lensing quadratic estimator to any weakly non-Gaussian source field, by deriving the optimal lensing weights. We point out the additional noise and bias caused by the non-Gaussianity and the “self-lensing” of the source field. We propose methods to reduce, subtract, or model these non-Gaussianities. We demonstrate that CIB lensing should be detectable with Planck data and detectable at high significance for future CMB experiments like CCAT-Prime. The CIB thus constitutes a novel source image for lensing studies, providing constraints on the amplitude of structure at intermediate redshifts between galaxies and the CMB. CIB lensing measurements will also give valuable information on the star-formation history in the Universe, constraining CIB halo models beyond the CIB power spectrum. By laying out a detailed treatment of lens reconstruction from a weakly non-Gaussian source field, this report constitutes a stepping stone toward lens reconstruction from continuum or line intensity mapping data, such as the Lyman-alpha emission, absorption, and the 21 cm radiation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

First Constraints on the Epoch of Reionization Using the Non-Gaussianity of the Kinematic Sunyaev-Zel’dovich Effect from the South Pole Telescope and Herschel-SPIRE Observations

We report results from an analysis aimed at detecting the trispectrum of the kinematic Sunyaev-Zel’dovich (kSZ) effect by combining data from the South Pole Telescope (SPT) and Herschel-SPIRE experiments over a 100 deg 2 field. The SPT observations combine data from the previous and current surveys, namely SPTpol and SPT-3G, to achieve depths of 4.5, 3, and 16 μ K - arcmin in bands centered at 95, 150, and 220 GHz. For SPIRE, we include data from the 600 and 857 GHz bands. We reconstruct the velocity-induced large-scale correlation of the small-scale kSZ signal with a quadratic estimator that uses two cosmic microwave background (CMB) temperature maps, constructed by optimally combining data from all the frequency bands. We reject the null hypothesis of a zero trispectrum at 10.3 σ level. However, the measured trispectrum contains contributions from both the kSZ and other undesired components, such as CMB lensing and astrophysical foregrounds, with kSZ being sub-dominant. We use the agora simulations to estimate the expected signal from CMB lensing and astrophysical foregrounds. After accounting for the contributions from CMB lensing and foreground signals, we do not detect an excess kSZ-only trispectrum and use this nondetection to set constraints on reionization. By applying a prior based on observations of the Gunn-Peterson trough, we obtain an upper limit on the duration of reionization of Δ z re , 50 < 4.5 (95% confidence level). We find these constraints are fairly robust to foregrounds assumptions. This trispectrum measurement is independent of, but consistent with, Planck’s optical depth measurement. This result is the first constraint on the epoch of reionization using the non-Gaussian nature of the kSZ signal.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1973

Optimality of incompletely measurable active and passive attitude control systems

Passive attitude control systems and active systems with incomplete state measurements are only suboptimal systems in the sense of optimal control theory, since optimal systems require complete state measurements or state estimations. An optimal system, then, requires additional hardware (especially in the case of flexible spacecraft) which results in higher costs. Therefore, it is a real engineering problem to determine how much an optimal system exceeds the suboptimal system, or in other words, what is the suboptimal system's degree of optimality. The problem will be treated in three steps: (1) definition of the degree of optimality for linear, time-invariant systems; (2) a computation method using the quadratic cost functional; (3) application to a gravity-gradient stabilized three-body satellite and a spinning flexible satellite.

Schiehlen, W.↗
DOE OSTI2023

Quantum Search Approaches to Sampling-Based Motion Planning

In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Flexible space structure model reduction by modal cost analysis

It is noted that reduced models and reduced controllers for flexible space structures are obtained by retaining those modes which make the greatest contribution to quadratic control objectives. Attention is given to the relative importance of damping, frequency and mode shapes in the mode truncation decisions for the following control objectives: attitude control, vibration suppression and figure control. It is also shown that using Modal Cost Analysis (MCA) on the closed loop modes of the optimally controlled system allows the construction of reduced control policies which feedback only those closed loop coordinates which are most critical to the quadratic control performance criterion. In this manner, the modes which need to be controlled are deduced from truncations of the optimal controller.

Skelton, R. E.↗
NASA NTRSDate not supplied

A Convex Optimization Approach to Improving Suboptimal Hyperparameters of Sliced Normal Distributions

Sliced Normal (SN) distributions are a generalization of Gaussian distributions where the quadratic argument of the exponential is replaced with a sum of squares polynomial. SNs may be used to represent the distribution of a diverse set of random variables including multi-modal, non-symmetric, and skewed distributions. Unfortunately, the likelihood function of a SN includes a normalization constant and the inclusion of this normalization constant makes the likelihood a non-convex function of the hyperparameters which define the SN. In previous work, suboptimal fitting of the hyperparameters was performed by transforming the given data into a higher dimensional monomial basis and selecting the optimal hyperparameters of a Gaussian fit in this space. However, this approach did not account for the effect of lifting on the normalization constant. Indeed, it was observed that as the number of monomials is increased the likelihood of the Sliced Normal can decrease. In this paper, we increase the likelihood of Sliced Normals found using the previous method by developing a convex formulation which scales the covariance matrix of the Gaussian fit such that the likelihood of the Sliced Normal is maximized. The result is significant improvements of the log likelihood of fitted SN distributions, including a significant increase, especially for problems with 500+ monomials.

Convex optimization approach to improving suboptim↗
DOE OSTI2022

Qualitative trend analysis based on a mixed-integer representation

Shape constrained spline fitting is a useful method to impose prior knowledge onto flexible semi-parametric models during parameter estimation. Most typically, the function shape is imposed through order restrictions on the regression coefficients. The intended shape is considered known or selected based on heuristic rules. In this study, we present a method to estimate the optimal set of order restrictions to segment a univariate data series into episodes with distinct shapes. This is also known as the qualitative trend analysis (QTA) problem. The obtained solution uses a trade-off between lack-of-fit and model complexity. Further, our practical implementation takes inspiration from the generalized order restricted information criterion (GORIC) for inequality-constrained model selection. From this, one learns (a) that QTA can be formulated as a mixed-integer quadratic program (MIQP) and (b) that the newly proposed mixed order restricted information criterion (MORIC) enables optimal segmentation. This is illustrated through didactic case studies.

42 ENGINEERING↗
NASA NTRS1973

Real-time optimal guidance for orbital maneuvering.

A new formulation for soft-constraint trajectory optimization is presented as a real-time optimal feedback guidance method for multiburn orbital maneuvers. Control is always chosen to minimize burn time plus a quadratic penalty for end condition errors, weighted so that early in the mission (when controllability is greatest) terminal errors are held negligible. Eventually, as controllability diminishes, the method partially relaxes but effectively still compensates perturbations in whatever subspace remains controllable. Although the soft-constraint concept is well-known in optimal control, the present formulation is novel in addressing the loss of controllability inherent in multiple burn orbital maneuvers. Moreover the necessary conditions usually obtained from a Bolza formulation are modified in this case so that the fully hard constraint formulation is a numerically well behaved subcase. As a result convergence properties have been greatly improved.

Cohen, A. O.↗