Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 721 records · Page 40

Predictive momentum management for the Space Station

Space station control moment gyro momentum management is addressed by posing a deterministic optimization problem with a performance index that includes station external torque loading, gyro control torque demand, and excursions from desired reference attitudes. It is shown that a simple analytic desired attitude solution exists for all axes with pitch prescription decoupled, but roll and yaw coupled. Continuous gyro desaturation is shown to fit neatly into the scheme. Example results for pitch axis control of the NASA power tower Space Station are shown based on predictive attitude prescription. Control effector loading is shown to be reduced by this method when compared to more conventional momentum management techniques.

Hatis, P. D.↗

Optimal control of aeroassisted plane change maneuver using feedback expansions

A guidance law for an aeroassisted plane change maneuver is developed by an asymptotic expansion technique using a small parameter which essentially represents the ratio of the inertial forces to the atmospheric forces. This guidance law minimizes the energy loss while meeting terminal constraints on the altitude, flight path angle, and heading angle. By neglecting the inertial forces, the resulting optimization problem is integrable and can be determined in closed form. This zeroth-order solution is the first term in an asymptotic series solution of the Hamilton-Jacobi-Bellman equation. The remaining terms are determined from the solution of a first-order, linear partial differential equation whose solution requires only quadrature integration. Our initial results in using this guidance scheme are encouraging.

Mishne, D.↗

The ADS general-purpose optimization program

The mathematical statement of the general nonlinear optimization problem is given as follows: find the vector of design variables, X, that will minimize f(X) subject to G sub J (x) + or - 0 j=1,m H sub K hk(X) = 0 k=1,l X Lower I approx less than X sub I approx. less than X U over I i = 1,N. The vector of design variables, X, includes all those variables which may be changed by the ADS program in order to arrive at the optimum design. The objective function F(X) to be minimized may be weight, cost or some other performance measure. If the objective is to be maximized, this is accomplished by minimizing -F(X). The inequality constraints include limits on stress, deformation, aeroelastic response or controllability, as examples, and may be nonlinear implicit functions of the design variables, X. The equality constraints h sub k(X) represent conditions that must be satisfied precisely for the design to be acceptable. Equality constraints are not fully operational in version 1.0 of the ADS program, although they are available in the Augmented Lagrange Multiplier method. The side constraints given by the last equation are used to directly limit the region of search for the optimum. The ADS program will never consider a design which is not within these limits.

Vanderplaats, G. N.↗

Alternative methods for calculating sensitivity of optimized designs to problem parameters

Optimum sensitivity is defined as the derivative of the optimum design with respect to some problem parameter, P. The problem parameter is usually fixed during optimization, but may be changed later. Thus, optimum sensitivity is used to estimate the effect of changes in loads, materials or constraint bounds on the design without expensive re-optimization. Here, the general topic of optimum sensitivity is discussed, available methods identified, examples given, and the difficulties encountered in calculating this information in nonlinear constrained optimization are identified.

Vanderplaats, G. N.↗

Design sensitivity analysis and optimization of built-up structures

Developments during the course of the research in design sensitivity analysis and optimization of built-up structures, with both sizing and shape design variables, show clearly that a unified variational approach to design sensitivity analysis can yield derivatives of structural response with respect to design. Rigorous and practically computable results for structural components and built-up structures have been demonstrated and used to solve design optimization problems.

Choi, Kyung K.↗

Application of decomposition techniques to the preliminary design of a transport aircraft

A multifaceted decomposition of a nonlinear constrained optimization problem describing the preliminary design process for a transport aircraft has been made. Flight dynamics, flexible aircraft loads and deformations, and preliminary structural design subproblems appear prominently in the decomposition. The use of design process decomposition for scheduling design projects, a new system integration approach to configuration control, and the application of object-centered programming to a new generation of design tools are discussed.

Rogan, J. E.↗

Mean-field theory of spin-glasses with finite coordination number

The mean-field theory of dilute spin-glasses is studied in the limit where the average coordination number is finite. The zero-temperature phase diagram is calculated and the relationship between the spin-glass phase and the percolation transition is discussed. The present formalism is applicable also to graph optimization problems.

Kanter, I.↗

Practical implementation of an accurate method for multilevel design sensitivity analysis

Solution techniques for handling large scale engineering optimization problems are reviewed. Potentials for practical applications as well as their limited capabilities are discussed. A new solution algorithm for design sensitivity is proposed. The algorithm is based upon the multilevel substructuring concept to be coupled with the adjoint method of sensitivity analysis. There are no approximations involved in the present algorithm except the usual approximations introduced due to the discretization of the finite element model. Results from the six- and thirty-bar planar truss problems show that the proposed multilevel scheme for sensitivity analysis is more effective (in terms of computer incore memory and the total CPU time) than a conventional (one level) scheme even on small problems. The new algorithm is expected to perform better for larger problems and its applications on the new generation of computer hardwares with 'parallel processing' capability is very promising.

Nguyen, Duc T.↗

Advanced decision aiding techniques applicable to space

RADC has had an intensive program to show the feasibility of applying advanced technology to Air Force decision aiding situations. Some aspects of the program, such as Satellite Autonomy, are directly applicable to space systems. For example, RADC has shown the feasibility of decision aids that combine the advantages of laser disks and computer generated graphics; decision aids that interface object-oriented programs with expert systems; decision aids that solve path optimization problems; etc. Some of the key techniques that could be used in space applications are reviewed. Current applications are reviewed along with their advantages and disadvantages, and examples are given of possible space applications. The emphasis is to share RADC experience in decision aiding techniques.

Kruchten, Robert J.↗

Advances in dual algorithms and convex approximation methods

A new algorithm for solving the duals of separable convex optimization problems is presented. The algorithm is based on an active set strategy in conjunction with a variable metric method. This first order algorithm is more reliable than Newton's method used in DUAL-2 because it does not break down when the Hessian matrix becomes singular or nearly singular. A perturbation technique is introduced in order to remove the nondifferentiability of the dual function which arises when linear constraints are present in the approximate problem.

Smaoui, H.↗

Approximation techniques for domain identification in two-dimensional parabolic systems under boundary observations

The identification of the geometrical structure of the system boundary for a two-dimensional diffusion system is considered. The domain identification treated is converted into an optimization problem based on a fit-to-data criterion and theoretical convergence results for approximate identification techniques are discussed. Results of numerical experiments to demonstrate the efficiency of the theoretical ideas are reported.

Banks, H. T.↗

Optimizing advanced propeller designs by simultaneously updating flow variables and design parameters

A scheme is developed for solving constrained optimization problems in which the objective function and the constraint function are dependent on the solution of the nonlinear flow equations. The scheme updates the design parameter iterative solutions and the flow variable iterative solutions simultaneously. It is applied to an advanced propeller design problem with the Euler equations used as the flow governing equations. The scheme's accuracy, efficiency and sensitivity to the computational parameters are tested.

Rizk, Magdi H.↗

Aerodynamic optimization by simultaneously updating flow variables and design parameters with application to advanced propeller designs

A scheme is developed for solving constrained optimization problems in which the objective function and the constraint function are dependent on the solution of the nonlinear flow equations. The scheme updates the design parameter iterative solutions and the flow variable iterative solutions simultaneously. It is applied to an advanced propeller design problem with the Euler equations used as the flow governing equations. The scheme's accuracy, efficiency and sensitivity to the computational parameters are tested.

Rizk, Magdi H.↗

On the calculation of derivatives of eigenvalues and eigenvectors in the simultaneous design and control of structures

Independent Modal Space Control (IMSC) is a technique that is often used for the control of large order structural systems. The pertinent optimization problem in the simultaneous design and control of structures is a min - min problem that minimizes with respect to the structural design variables, the minimum value of the performance index with respect to the control forces obtained using the IMSC technique. The minimization process requires derivatives of eigenvalues and eigenvectors with respect to the design variables. These derivatives can be computed by a rather involved analytical procedure or a relatively simple finite difference procedure. The computer cost effectiveness of these two procedures for the derivative calculations is examined.

Mesquita, Luis↗

An approximation function for frequency constrained structural optimization

The purpose is to examine a function for approximating natural frequency constraints during structural optimization. The nonlinearity of frequencies has posed a barrier to constructing approximations for frequency constraints of high enough quality to facilitate efficient solutions. A new function to represent frequency constraints, called the Rayleigh Quotient Approximation (RQA), is presented. Its ability to represent the actual frequency constraint results in stable convergence with effectively no move limits. The objective of the optimization problem is to minimize structural weight subject to some minimum (or maximum) allowable frequency and perhaps subject to other constraints such as stress, displacement, and gage size, as well. A reason for constraining natural frequencies during design might be to avoid potential resonant frequencies due to machinery or actuators on the structure. Another reason might be to satisy requirements of an aircraft or spacecraft's control law. Whatever the structure supports may be sensitive to a frequency band that must be avoided. Any of these situations or others may require the designer to insure the satisfaction of frequency constraints. A further motivation for considering accurate approximations of natural frequencies is that they are fundamental to dynamic response constraints.

Canfield, R. A.↗

Structural optimization using synthetic functions

An efficient method for solving the structural optimization problem of defining member properties and responses in terms of design variables and calculated direct responses is proposed. The present approach provides the user with a simple means of interfacing design analysis models, as well as imposing constraints on functions which are not otherwise directly available. Results are presented for the examples of a three-bar truss, a 25-bar truss, the matching of calculated responses to measured responses, and the design of a rectangular beam.

Vanderplaats, G. N.↗

First and second order convex approximation strategies in structural optimization

In this paper, various methods based on convex approximation schemes are discussed that have demonstrated strong potential for efficient solution of structural optimization problems. First, the convex linearization method (Conlin) is briefly described, as well as one of its recent generalizations, the method of moving asymptotes (MMA). Both Conlin and MMA can be interpreted as first-order convex approximation methods that attempt to estimate the curvature of the problem functions on the basis of semiempirical rules. Attention is next directed toward methods that use diagonal second derivatives in order to provide a sound basis for building up high-quality explicit approximations of the behavior constraints. In particular, it is shown how second-order information can be effectively used without demanding a prohibitive computational cost. Various first-order and second-order approaches are compared by applying them to simple problems that have a closed form solution.

Fleury, C.↗

Numerical optimization in Hilbert space using inexact function and gradient evaluations

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

Carter, Richard G.↗