Search NASA⌕ Search

SEARCH · Search NASA

Results for “quadratic programming”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

An all-at-once reduced Hessian SQP scheme for aerodynamic design optimization

This paper introduces a computational scheme for solving a class of aerodynamic design problems that can be posed as nonlinear equality constrained optimizations. The scheme treats the flow and design variables as independent variables, and solves the constrained optimization problem via reduced Hessian successive quadratic programming. It updates the design and flow variables simultaneously at each iteration and allows flow variables to be infeasible before convergence. The solution of an adjoint flow equation is never needed. In addition, a range space basis is chosen so that in a certain sense the 'cross term' ignored in reduced Hessian SQP methods is minimized. Numerical results for a nozzle design using the quasi-one-dimensional Euler equations show that this scheme is computationally efficient and robust. The computational cost of a typical nozzle design is only a fraction more than that of the corresponding analysis flow calculation. Superlinear convergence is also observed, which agrees with the theoretical properties of this scheme. All optimal solutions are obtained by starting far away from the final solution.

Feng, Dan↗
NASA NTRS1995

Aerodynamic design optimization via reduced Hessian SQP with solution refining

An all-at-once reduced Hessian Successive Quadratic Programming (SQP) scheme has been shown to be efficient for solving aerodynamic design optimization problems with a moderate number of design variables. This paper extends this scheme to allow solution refining. In particular, we introduce a reduced Hessian refining technique that is critical for making a smooth transition of the Hessian information from coarse grids to fine grids. Test results on a nozzle design using quasi-one-dimensional Euler equations show that through solution refining the efficiency and the robustness of the all-at-once reduced Hessian SQP scheme are significantly improved.

Feng, Dan↗
NASA NTRS1996

Design Optimization for a Maglev System Employing Flux Eliminating Coils

Flux eliminating coils have received no little attention over the past thirty years as an alternative for realizing lift in a MAGLEV system. When the magnets on board the vehicle are displaced from the equilibrium or null flux point of these coils, they induce current in those coils which act to restore the coil to its null flux or centerline position. The question being addressed in this paper is that of how to choose the best coil for a given system. What appears at first glance to be an innocent question is in fact one that is actually quite involved, encompassing both the global economics and physics of the system. The real key in analyzing that question is to derive an optimization index or functional which represents the cost of the system subject to constraints, the primary constraint being that the vehicle lift itself at a certain threshold speed. Outlined in this paper is one scenario for realizing a total system design which uses sequential quadratic programming techniques.

Davey, Kent R.↗
NASA NTRS1999

Reconfigurable Flight Control Designs With Application to the X-33 Vehicle

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the right body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗
NASA NTRS1999

Optimized System Identification

In system identification, one usually cares most about finding a model whose outputs are as close as possible to the true system outputs when the same input is applied to both. However, most system identification algorithms do not minimize this output error. Often they minimize model equation error instead, as in typical least-squares fits using a finite-difference model, and it is seen here that this distinction is significant. Here, we develop a set of system identification algorithms that minimize output error for multi-input/multi-output and multi-input/single-output systems. This is done with sequential quadratic programming iterations on the nonlinear least-squares problems, with an eigendecomposition to handle indefinite second partials. This optimization minimizes a nonlinear function of many variables, and hence can converge to local minima. To handle this problem, we start the iterations from the OKID (Observer/Kalman Identification) algorithm result. Not only has OKID proved very effective in practice, it minimizes an output error of an observer which has the property that as the data set gets large, it converges to minimizing the criterion of interest here. Hence, it is a particularly good starting point for the nonlinear iterations here. Examples show that the methods developed here eliminate the bias that is often observed using any system identification methods of either over-estimating or under-estimating the damping of vibration modes in lightly damped structures.

Juang, Jer-Nan↗
NASA NTRS1997

Frozen-Flux Modelling for Epochs 1915 and 1980

The frozen-flux hypothesis for the Earth's liquid core assumes that convective terms dominate diffusive terms in the induction equation governing the behaviour of the magnetic field at the surface of the core. While highly plausible on the basis of estimates of physical parameters, the hypothesis has been questioned. To study this hypothesis, we improve the method which tests the consistency of magnetic observations with the hypothesis by constructing simple, flux-conserving core-field models fitting the data at pairs of epochs. We introduce a new approach that fixes the patch configurations at each of the two epochs before inversion, so that each configuration is consistent with its respective data set but possesses the same patch topology. We expand upon the inversion algorithm, using quadratic programming to maintain the proper flux sign within patches; the modelling calculations are also extended to include data types that depend non-linearly on the model. Every test of a hypothesis depends on the characterization of the observational uncertainties; we undertake a thorough review of this question. For main-field models, the primary source of uncertainty comes from the crustal field. We base our analysis on statistical models of the crustal magnetization, adjusted to bring it into better conformity with our data set. The noise model permits us to take into account the correlations between the measurements and requires that a different weighting be given to horizontal and vertical components. It also indicates that the observations should be fit more closely than has been the practice heretofore. We apply the revised method to Magsat data from 1980 and survey and observatory data from 1915.5, two data sets believed to be particularly difficult to reconcile with the frozen-flux hypothesis. We compute a pair of simple, flux-conserving models that fit the averaged data from each epoch. We therefore conclude that present knowledge of the geomagnetic fields of 1980 and 1915.5 is consistent with the frozen-flux hypothesis.

OBrien, Michael S.↗
NASA NTRS2001

Two Reconfigurable Flight-Control Design Methods: Robust Servomechanism and Control Allocation

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the fight body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗
NASA NTRS1999

Data Reduction Methods Applied to the Fastrac Engine

The Fastrac rocket engine is currently being developed for the X-34 technology demonstrator vehicle. The engine performance model must be calibrated to support accurate performance prediction. Data reduction is the process of estimating hardware characteristics from available test data, and is essential for effective performance model calibration and prediction. A new data reduction procedure was developed, implemented, and tested using data from Fastrac engine tests. The procedure selects hardware and test measurements to use in the reduction process based on examination of the model influence matrix condition number. Predicted hardware characteristics are recovered from the solution of a quadratic programming problem. Computational tests indicate that the new procedure provides a significant improvement in test data reduction capability. Enhancements include improved test data utilization and time history data reduction capability. The new method is generically applicable to other systems.

Santi, L. Michael↗
NASA NTRS2002

Preliminary Optimal Orbit Design for the Laser Interferometer Space Antenna (LISA)

In this paper we present a preliminary optimal orbit analysis for the Laser Interferometer Space Antenna (LISA). LISA is a NASA/ESA mission to study gravitational waves and test predictions of general relativity. The nominal formation consists of three spacecraft in heliocentric orbits at 1 AU and trailing the Earth by twenty degrees. This configuration was chosen as a trade off to reduce the noise sources that will affect the instrument and to reduce the fuel to achieve the final orbit. We present equations for the nominal orbit design and discuss several different measures of performance for the LISA formation. All of the measures directly relate the formation dynamics to science performance. Also, constraints on the formation dynamics due to spacecraft and instrument limitations are discussed. Using the nominal solution as an initial guess, the formation is optimized using Sequential Quadratic Programming to maximize the performance while satisfying a set of nonlinear constraints. Results are presented for each of the performance measures.

Hughes, Steven P.↗
NASA NTRS2003

Kalman Filtering with Inequality Constraints for Turbofan Engine Health Estimation

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops two analytic methods of incorporating state variable inequality constraints in the Kalman filter. The first method is a general technique of using hard constraints to enforce inequalities on the state variable estimates. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The second method uses soft constraints to estimate state variables that are known to vary slowly with time. (Soft constraints are constraints that are required to be approximately satisfied rather than exactly satisfied.) The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results. The use of the algorithm is demonstrated on a linearized simulation of a turbofan engine to estimate health parameters. The turbofan engine model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.

Simon, Dan↗
NASA NTRS2002

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

Hughes, Steven P.↗
NASA NTRS2003

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present, a comparison of trajectory optimization approaches for the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP). Quasi- Newton and Nelder-Meade Simplex. Several cost function parameterizations are considered for the direct approach. We choose one direct approach that appears to be the most flexible. Both the direct and indirect methods are applied to a variety of test cases which are chosen to demonstrate the performance of each method in different flight regimes. The first test case is a simple circular-to-circular coplanar rendezvous. The second test case is an elliptic-to-elliptic line of apsides rotation. The final test case is an orbit phasing maneuver sequence in a highly elliptic orbit. For each test case we present a comparison of the performance of all methods we consider in this paper.

Hughes, Steven P.↗
NASA NTRS2003

Aircraft Turbofan Engine Health Estimation Using Constrained Kalman Filtering

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops an analytic method of incorporating state variable inequality constraints in the Kalman filter. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results obtained from application to a turbofan engine model. This model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.

Simon, Dan↗
NASA NTRS2003

Orbit Design for Phase I and II of the Magnetospheric Multiscale Mission (MMS)

The Magnetospheric Multiscale Mission (MMS) is a NASA mission intended to make fundamental advancements in our understanding of the Earth's Magnetosphere. There are three processes that MMS is intended to study including magnetic recon- nection, charged particle acceleration, and turbulence. There are four phases of the MMS mission and each phase is designed to study a particular region of the Earth's magnetosphere. The mission is composed of a formation of four spacecraft that are nominally in a regular tetrahedron formation. In this work, we present optimal orbit designs for Phase I and II. This entails designing optimal reference orbits so that the spacecraft dwell-time in the region of interest is a maximum. This is non-trivial because the Earth's magnetosphere is dynamic and its shape and position are not constant in inertial space. Optimal orbit design for MMS also entails designing the formation so that the relative motion of the four spacecraft yields the greatest science return. We develop performance metrics that are related to the science return, and use Sequential Quadratic Programming (SQP) to determine optimal relative motion solutions. We also ensure that practical constraints such as maximum eclipse time and minimum inter-spacecraft separation distances are not violated.

Hughes, Steve P.↗
NASA NTRS2003

Formation Tetrahedron Design for Phase I of the Magnetospheric Multiscale Mission

The Magnetospheric Multiscale Mission (MMS) is a NASA mission intended to make fundamental advancements in our understanding of the Earth's Magnetosphere. There are three processes that MMS will study including magnetic reconnection, charged particle acceleration, and turbulence. There are four phases in the nominal mission and this work addresses some of the outstanding issues in phase I. The nominal phase I orbit is 1.2 x 12 R(sub e) highly elliptic orbit with four spacecraft nominally forming a regular tetrahedron. In this paper we investigate the relative dynamics of the four MMS spacecraft about an assumed reference orbit. There are several tetrahedron dimensions required in Phase I of the mission and in this work we design optimal tetrahedrons for the 10 km baseline. The performance metric used in the optimization process is directly related to the science return, and is based on an extension of previous work performed by Glassmeier. The optimizer we use is a commercially available Sequential Quadratic Programming (SQP) routine. Multiple optimal solutions are found, and we characterize how the performance of the formation varies between different regions of the reference orbit.

Hughes, Steven P.↗
NASA NTRS2004

Orbit Design for Phase I and II of the Magnetospheric Multiscale Mission

The Magnetospheric Multiscale Mission (MMS) is a NASA mission intended to make fundamental advancements in our understanding of the Earth s magnetosphere. There are three processes that MMS is intended to study including magnetic reconnection, charged particle acceleration, and turbulence. There are four phases of the MMS mission and each phase is designed to study a particular region of the Earth's magnetosphere. The mission is composed of a formation of four spacecraft that are nominally in a regular tetrahedron formation. In this work, we present optimal orbit designs for Phase I and II. This entails designing reference orbits such that the spacecraft dwell-time in the region of interest is a maximum. This is non-trivial because the Earth's magnetosphere is dynamic and its shape and position are not constant in inertial space. Optimal orbit design for MMS also entails designing the formation so that the relative motion of the four spacecraft yields the greatest science return. We develop performance metrics that are directly related to the science return, and use Sequential Quadratic Programming (SQP) to determine optimal relative motion solutions. While designing for optimal science return, we also consider practical constraints such as maximum eclipse time and minimum inter-spacecraft separation distances. Data are presented that illustrates how long we can ensure that the formation remains in the relevant region of the Earth's magnetosphere. We also draw general conclusions about where in the orbit acceptable tetrahedron configurations can be provided and for how long.

Hughes, Steve P.↗
NASA NTRS1999

Modeling of polychromatic attenuation using computed tomography reconstructed images

This paper presents a procedure for estimating an accurate model of the CT imaging process including spectral effects. As raw projection data are typically unavailable to the end-user, we adopt a post-processing approach that utilizes the reconstructed images themselves. This approach includes errors from x-ray scatter and the nonidealities of the built-in soft tissue correction into the beam characteristics, which is crucial to beam hardening correction algorithms that are designed to be applied directly to CT reconstructed images. We formulate this approach as a quadratic programming problem and propose two different methods, dimension reduction and regularization, to overcome ill conditioning in the model. For the regularization method we use a statistical procedure, Cross Validation, to select the regularization parameter. We have constructed step-wedge phantoms to estimate the effective beam spectrum of a GE CT-I scanner. Using the derived spectrum, we computed the attenuation ratios for the wedge phantoms and found that the worst case modeling error is less than 3% of the corresponding attenuation ratio. We have also built two test (hybrid) phantoms to evaluate the effective spectrum. Based on these test phantoms, we have shown that the effective beam spectrum provides an accurate model for the CT imaging process. Last, we used a simple beam hardening correction experiment to demonstrate the effectiveness of the estimated beam profile for removing beam hardening artifacts. We hope that this estimation procedure will encourage more independent research on beam hardening corrections and will lead to the development of application-specific beam hardening correction algorithms.

NASA Discipline Musculoskeletal↗
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↗