Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sequential 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.

39 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1988

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1978

Discrete-time pilot model

Pilot behavior is considered as a discrete-time process where the decision making has a sequential nature. This model differs from both the quasilinear model which follows from classical control theory and from the optimal control model which considers the human operator as a Kalman estimator-predictor. An additional factor considered is that the pilot's objective may not be adequately formulated as a quadratic cost functional to be minimized, but rather as a more fuzzy measure of the closeness with which the aircraft follows a reference trajectory. All model parameters, in the digital program simulating the pilot's behavior, were successfully compared in terms of standard-deviation and performance with those of professional pilots in IFR configuration. The first practical application of the model was in the study of its performance degradation when the aircraft model static margin decreases.

Cavalli, D.↗