Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problem”

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 NTRS1994

Automation of reverse engineering process in aircraft modeling and related optimization problems

During the year of 1994, the engineering problems in aircraft modeling were studied. The initial concern was to obtain a surface model with desirable geometric characteristics. Much of the effort during the first half of the year was to find an efficient way of solving a computationally difficult optimization model. Since the smoothing technique in the proposal 'Surface Modeling and Optimization Studies of Aerodynamic Configurations' requires solutions of a sequence of large-scale quadratic programming problems, it is important to design algorithms that can solve each quadratic program in a few interactions. This research led to three papers by Dr. W. Li, which were submitted to SIAM Journal on Optimization and Mathematical Programming. Two of these papers have been accepted for publication. Even though significant progress has been made during this phase of research and computation times was reduced from 30 min. to 2 min. for a sample problem, it was not good enough for on-line processing of digitized data points. After discussion with Dr. Robert E. Smith Jr., it was decided not to enforce shape constraints in order in order to simplify the model. As a consequence, P. Dierckx's nonparametric spline fitting approach was adopted, where one has only one control parameter for the fitting process - the error tolerance. At the same time the surface modeling software developed by Imageware was tested. Research indicated a substantially improved fitting of digitalized data points can be achieved if a proper parameterization of the spline surface is chosen. A winning strategy is to incorporate Dierckx's surface fitting with a natural parameterization for aircraft parts. The report consists of 4 chapters. Chapter 1 provides an overview of reverse engineering related to aircraft modeling and some preliminary findings of the effort in the second half of the year. Chapters 2-4 are the research results by Dr. W. Li on penalty functions and conjugate gradient methods for quadratic programming problems.

Li, W.↗
NASA NTRS1986

Singular perturbation analysis of AOTV related trajectory optimization problems

The problem of aeroassisted orbital plane change is discussed. This maneuver requires the use of three impulses - one to deorbit, one to reorbit and one to recircularize at the new orbit. The orbit plane change is effected entirely in the atmosphere through the use of lift and bank angle control. For circular orbits of nearly equal radii, it can be shown that the fuel consumption is minimized by minimizing the energy loss in the atmospheric portion of the trajectory. The research explores the use of singular perturbation theory to develop an optimal guidance law for the atmospheric portion.

Calise, Anthony J.↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗
NASA NTRS1973

Further discrete variable results for a panel flutter optimization problem

Numerical solutions are presented for the problem of minimum weight design of a thin one-dimensional, simply supported, solid panel in compression, with one side exposed to a parallel high supersonic air flow. The flutter speed is held fixed and a minimum thickness constraint is imposed.

Pierson, B. L.↗
NASA NTRS1975

Applications of matrix derivatives to optimization problems in statistical pattern recognition

A necessary condition for a real valued Frechet differentiable function of a vector variable have an extremum at a vector x sub 0 is that the Frechet derivative vanishes at x sub 0. A relationship between Frechet differentials and matrix derivatives was established that obtains a necessary condition on the matrix derivative at an extrema. These results are applied to various scalar functions of matrix variables which occur in statistical pattern recognition.

Morrell, J. S.↗
NASA NTRS1976

The Davidon-Fletcher-Powell penalty function method: A generalized iterative technique for solving parameter optimization problems

The Fletcher-Powell version of the Davidon variable metric unconstrained minimization technique is described. Equations that have been used successfully with the Davidon-Fletcher-Powell penalty function technique for solving constrained minimization problems and the advantages and disadvantages of using them are discussed. The experience gained in the behavior of the method while iterating is also related.

Johnson, I. L., Jr.↗
NASA NTRS1976

Elliptic integral solutions to a class of space flight optimization problems

This paper is initially concerned with the minimum-time, exoatmospheric flight of a rocket with constant thrust acceleration magnitude, as in the cases of nuclear and solar electric propulsion. Gravitational acceleration is assumed to be a constant scalar multiple of the radius vector, plus a correction term which is a given function of time. The solution to the state equations is obtained in terms of elliptic integrals. A method is presented for the solution of the two-point boundary-condition problem associated with orbital transfer. At most, the latter method requires iteration upon final time, angle of injection, and two other parameters which are bounded. An example problem is provided which involves a rocket with very low thrust and a spiraling trajectory of many revolutions, but an altitude change of only several hundred miles above the earth. Finally, the original elliptic integral solution is extended to a larger class of low and intermediate thrust problems with constant thrust magnitude, mass decreasing with time, and an inverse square gravitational force.

Andrus, J. F.↗
NASA NTRS1980

Practical solutions to the aircraft minimum fuel, fixed-range, fixed time-of-arrival trajectory optimization problem

A practical scheme is presented for generating fixed range, minimum fuel vertical flight profiles that also satisfy time-of-arrival constraints. The resulting algorithm is suitable for incorporation into an on-board flight management system. Example results show that such a capability can save up to 6% of fuel burned in flights subject to delays because of terminal area congestion.

Sorensen, J. A.↗
NASA NTRS2002

Bell-Curve Genetic Algorithm for Mixed Continuous and Discrete Optimization Problems

In this manuscript we have examined an extension of BCB that encompasses a mix of continuous and quasi-discrete, as well as truly-discrete applications. FVe began by testing two refinements to the discrete version of BCB. The testing of midpoint versus fitness (Tables 1 and 2) proved inconclusive. The testing of discrete normal tails versus standard mutation showed was conclusive and demonstrated that the discrete normal tails are better. Next, we implemented these refinements in a combined continuous and discrete BCB and compared the performance of two discrete distance on the hub problem. Here we found when "order does matter" it pays to take it into account.

Kincaid, Rex K.↗