SEARCH · Search NASA
Results for “optimization problems”
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.
Investigation of Spatial Smoothing Techniques Applied to Design Variables in Structural Optimization Problems.
Abstract not provided.
Hyper-Differential Sensitivity Analysis: Managing High Dimensional Uncertainty in Large-Scale Optimization Problems.
Abstract not provided.
A transformation technique to obtain control angle solutions in calculus of variations optimization problems
Transformation of Lagrange multipliers and Euler equations to obtain control angle solutions by variational calculus
Necessary conditions for continuous parameter stochastic optimization problems.
Explore the source record for details and available documents.
A descent numerical method for optimization problems with nondifferentiable cost functionals
Explore the source record for details and available documents.
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.
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.
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.
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.
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.
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.
Tchebycheff-NBI Formulation for Multiobjective Optimization Problems.
Abstract Not Provided
Block-Oriented Modeling of Superstructure Optimization Problems.
Abstract Not Provided
Formulation of Chlorine and Decontamination Booster Station Optimization Problem.
Abstract not provided.
Combining Multi-Grid and Domain Decomposition as Preconditioners for a class of Multi-Level PDE- Constrained Optimization Problems.
Abstract not provided.
Tackling Large-scale Optimization Problems within a Python-based Modeling Environment (Pyomo).
Abstract not provided.
Tackling Large-scale Optimization Problems within a Python-based Modeling Environment (Pyomo).
Abstract not provided.