Efficient single-level solution of hierarchical problems in structural optimization
Explore the source record for details and available documents.
Thareja, Rajiv R.↗
SEARCH · Search NASA
Results for “solution optimization”
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.
An optimization program based on the method of feasible directions: Theory and users guide
The theory and user instructions for an optimization code based on the method of feasible directions are presented. The code was written for wide distribution and ease of attachment to other simulation software. Although the theory of the method of feasible direction was developed in the 1960's, many considerations are involved in its actual implementation as a computer code. Included in the code are a number of features to improve robustness in optimization. The search direction is obtained by solving a quadratic program using an interior method based on Karmarkar's algorithm. The theory is discussed, focusing on the important and often overlooked role played by the various parameters guiding the iterations within the program. Also discussed is a robust approach for handling infeasible starting points. The code was validated by solving a variety of structural optimization test problems that have known solutions obtained by other optimization codes. It has been observed that this code is accurate and robust: it has solved a variety of problems from different starting points. However, the code is inefficient in that it takes considerable CPU time as compared with certain other available codes. Further work is required to improve its efficiency while retaining its robustness.
Ashok D. Belegundu↗
Closed-form solutions for linear regulator design of mechanical systems including optimal weighting matrix selection
Vibration in modern structural and mechanical systems can be reduced in amplitude by increasing stiffness, redistributing stiffness and mass, and/or adding damping if design techniques are available to do so. Linear Quadratic Regulator (LQR) theory in modern multivariable control design, attacks the general dissipative elastic system design problem in a global formulation. The optimal design, however, allows electronic connections and phase relations which are not physically practical or possible in passive structural-mechanical devices. The restriction of LQR solutions (to the Algebraic Riccati Equation) to design spaces which can be implemented as passive structural members and/or dampers is addressed. A general closed-form solution to the optimal free-decay control problem is presented which is tailored for structural-mechanical system. The solution includes, as subsets, special cases such as the Rayleigh Dissipation Function and total energy. Weighting matrix selection is a constrained choice among several parameters to obtain desired physical relationships. The closed-form solution is also applicable to active control design for systems where perfect, collocated actuator-sensor pairs exist.
Hanks, Brantley R.↗
N-burn optimal analytic trajectories.
Derivation of N-burn analytic solutions for propellant-optimal transfer trajectories of a vehicle in a vacuum between arbitrary boundary conditions. Variational changes in the desired boundary conditions are expressed, in general, in terms of variational changes in the control vector and in the initial state vector. All coefficient matrices are computed recursively in terms of the analytic matrices established from the subarcs of the N-burn solution. The solution is applicable to shuttle ascent (exoatmospheric), rendezvous, and deorbit problems. Consideration is also given to state-variable and control-variable inequality constraints.
Jezewski, D. J.↗
Optimal two-impulse transfer between specified terminal states of Keplerian orbits
The integrals of motion for an inverse-square force field and a necessary condition for optimality are used in a transfer orbit co-ordinate system to formulate the solution of the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits. In this co-ordinate system, the equations reveal two asymptotes that are useful in analysing the solution. It is shown that there are only two real extremals (both minimums) which are separated by an asymptote. An approximate analytic solution is also obtained by ignoring a quadratic term whose coefficient is approximately zero for a large class of orbit transfer problems.
Jezewski, D. J.↗
Global optimization methods for engineering design
The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.
Arora, Jasbir S.↗
Elements of orbit-determination theory - Textbook
Text applies to solution of various optimization problems. Concepts are logically introduced and refinements and complexities for computerized numerical solutions are avoided. Specific topics and essential equivalence of several different approaches to various aspects of the problem are given.
Solloway, C. B.↗
Approximation of the optimal compensator for a large space structure
This paper considers the approximation of the optimal compensator for a Large Space Structure. The compensator is based upon a solution to the Linear Stochastic Quadratic Regulator problem. Colocation of sensors and actuators is assumed. A small gain analytical solution for the optimal compensator is obtained for a single input/single output system, i.e., certain terms in the compensator can be neglected for sufficiently small gain. The compensator is calculated in terms of the kernel to a Volterra integral operator using a Neumann series. The calculation of the compensator is based upon the C sub 0 semigroup for the infinite dimensional system. A finite dimensional approximation of the compensator is, therefore, obtained through analysis of the infinite dimensional compensator which is a compact operator.
Mackay, M. K.↗
A methodology for commonality analysis, with applications to selected space station systems
The application of commonality in a system represents an attempt to reduce costs by reducing the number of unique components. A formal method for conducting commonality analysis has not been established. In this dissertation, commonality analysis is characterized as a partitioning problem. The cost impacts of commonality are quantified in an objective function, and the solution is that partition which minimizes this objective function. Clustering techniques are used to approximate a solution, and sufficient conditions are developed which can be used to verify the optimality of the solution. This method for commonality analysis is general in scope. It may be applied to the various types of commonality analysis required in the conceptual, preliminary, and detail design phases of the system development cycle.
Thomas, Lawrence Dale↗
Software Tools to Support the Assessment of System Health
This presentation provides an overview of three software tools that were developed by the NASA Glenn Research Center to support the assessment of system health: the Propulsion Diagnostic Method Evaluation Strategy (ProDIMES), the Systematic Sensor Selection Strategy (S4), and the Extended Testability Analysis (ETA) tool. Originally developed to support specific NASA projects in aeronautics and space, these software tools are currently available to U.S. citizens through the NASA Glenn Software Catalog. The ProDiMES software tool was developed to support a uniform comparison of propulsion gas path diagnostic methods. Methods published in the open literature are typically applied to dissimilar platforms with different levels of complexity. They often address different diagnostic problems and use inconsistent metrics for evaluating performance. As a result, it is difficult to perform a one ]to ]one comparison of the various diagnostic methods. ProDIMES solves this problem by serving as a theme problem to aid in propulsion gas path diagnostic technology development and evaluation. The overall goal is to provide a tool that will serve as an industry standard, and will truly facilitate the development and evaluation of significant Engine Health Management (EHM) capabilities. ProDiMES has been developed under a collaborative project of The Technical Cooperation Program (TTCP) based on feedback provided by individuals within the aircraft engine health management community. The S4 software tool provides a framework that supports the optimal selection of sensors for health management assessments. S4 is structured to accommodate user ]defined applications, diagnostic systems, search techniques, and system requirements/constraints. One or more sensor suites that maximize this performance while meeting other user ]defined system requirements that are presumed to exist. S4 provides a systematic approach for evaluating combinations of sensors to determine the set or sets of sensors that optimally meet the performance goals and the constraints. It identifies optimal sensor suite solutions by utilizing a merit (i.e., cost) function with one of several available optimization approaches. As part of its analysis, S4 can expose fault conditions that are difficult to diagnose due to an incomplete diagnostic philosophy and/or a lack of sensors. S4 was originally developed and applied to liquid rocket engines. It was subsequently used to study the optimized selection of sensors for a simulation ]based aircraft engine diagnostic system. The ETA Tool is a software ]based analysis tool that augments the testability analysis and reporting capabilities of a commercial ]off ]the ]shelf (COTS) package. An initial diagnostic assessment is performed by the COTS software using a user ]developed, qualitative, directed ]graph model of the system being analyzed. The ETA Tool accesses system design information captured within the model and the associated testability analysis output to create a series of six reports for various system engineering needs. These reports are highlighted in the presentation. The ETA Tool was developed by NASA to support the verification of fault management requirements early in the Launch Vehicle process. Due to their early development during the design process, the TEAMS ]based diagnostic model and the ETA Tool were able to positively influence the system design by highlighting gaps in failure detection, fault isolation, and failure recovery.
Melcher, Kevin J.↗
Optimization problems governed by systems of PDEs with uncertainties
This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.
Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗
Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids
Mission proposals that land spacecraft on asteroids are becoming increasingly popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site with pinpoint precision. The problem under investigation is how to design a propellant optimal powered descent trajectory that can be quickly computed onboard the spacecraft, without interaction from the ground control. The propellant optimal control problem in this work is to determine the optimal finite thrust vector to land the spacecraft at a specified location, in the presence of a highly nonlinear gravity field, subject to various mission and operational constraints. The proposed solution uses convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process for a fixed final time problem. In addition, a second optimization method is wrapped around the convex optimization problem to determine the optimal flight time that yields the lowest propellant usage over all flight times. Gravity models designed for irregularly shaped asteroids are investigated. Success of the algorithm is demonstrated by designing powered descent trajectories for the elongated binary asteroid Castalia.
Pinson, Robin M.↗
An approach to the functional optimization of the CELSS Test Facility
An optimization of the CELSS Test Facility (CTF) subsystems and the entire CTF is necessary in order to meet strict limitations imposed on mass, volume, and power. Depending on the subsystem, other requirements must also be met. This paper shows the way to examine compatibility of requirements, to define an area of existing solutions (an operational envelope), and to find an optimal solution. The workability of the method is shown using problems of heat load on the Plant Growth Chamber, of optimization of the Vapor-Air Membrane Separation Device, and of finding a CTF configuration with minimum air pressure drop.
Yendler, Boris S.↗
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.↗
Bayesian optimization scheme for the design of a nanofibrous high power target
High Power Targetry (HPT) R&D is critical in the context of increasing beam intensity and energy for next generation accelerators. Many target concepts and novel materials are being developed and tested for their ability to withstand extreme beam environments; the HPT R&D Group at Fermilab is developing an electrospun nanofiber material for this purpose. The performance of these nanofiber targets is sensitive to their construction parameters, such as the packing density of the fibers. Lowering the density improves the survival of the target, but reduces the secondary particle yield. Optimizing the lifetime and production efficiency of the target poses an interesting design problem, and in this paper we study the applicability of Bayesian optimization to its solution. We first describe how to encode the nanofiber target design problem as the optimization of an objective function, and how to evaluate that function with computer simulations. We then explain the optimization loop setup. Thereafter, we present the optimal design parameters suggested by the algorithm, and close with discussions of limitations and future refinements.
43 PARTICLE ACCELERATORS↗
Bayesian Optimization Scheme for the Design of a Nanofibrous High Power Target
High Power Targetry (HPT) R\&D is critical in the context of increasing beam intensity and energy for next generation accelerators. Many target concepts and novel materials are being developed and tested for their ability to withstand extreme beam environments; the HPT R\&D Group at Fermilab is developing an electrospun nanofiber material for this purpose. The performance of these nanofiber targets is sensitive to their construction parameters, such as the packing density of the fibers. Lowering the density improves the survival of the target, but reduces the secondary particle yield. Optimizing the lifetime and production efficiency of the target poses an interesting design problem, and in this paper we study the applicability of Bayesian optimization to its solution. We first describe how to encode the nanofiber target design problem as the optimization of an objective function, and how to evaluate that function with computer simulations. We then explain the optimization loop setup. Thereafter, we present the optimal design parameters suggested by the algorithm, and close with discussions of limitations and future refinements.
43 PARTICLE ACCELERATORS↗
Optimal cooperative time-fixed impulsive rendezvous
A method has been developed for determining optimal, i.e., minimum fuel, trajectories for the fixed-time cooperative rendezvous of two spacecraft. The method presently assumes that the vehicles perform a total of three impulsive maneuvers with each vehicle being active, that is, making at least one maneuver. The cost of a feasible 'reference' trajectory is improved by an optimizer which uses an analytical gradient developed using primer vector theory and a new solution for the optimal terminal (rendezvous) maneuver. Results are presented for a large number of cases in which the initial orbits of both vehicles are circular but in which the initial positions of the vehicles and the allotted time for rendezvous are varied. In general, the cost of the cooperative rendezvous is less than that of rendezvous with one vehicle passive. Further improvement in cost may be obtained in the future when additional, i.e., midcourse, impulses are allowed and inserted as indicated for some cases by the primer vector histories which are generated by the program.
Mirfakhraie, Koorosh↗
Decomposing a renewable energy design and dispatch model
We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.
97 MATHEMATICS AND COMPUTING↗