498,328 research outputs found
Structural optimization of rotor blades with integrated dynamics and aerodynamics
The problem of structural optimization of helicopter rotor blades with integrated dynamic and aerodynamic design considerations is addressed. Results of recent optimization work on rotor blades for minimum weight with constraints on multiple coupled natural flap-lag frequencies, blade autorotational inertia and centrifugal stress has been reviewed. A strategy has been defined for the ongoing activities in the integrated dynamic/aerodynamic optimization of rotor blades. As a first step, the integrated dynamic/airload optimization problem has been formulated. To calculate system sensitivity derivatives necessary for the optimization recently developed, Global Sensitivity Equations (GSE) are being investigated. A need for multiple objective functions for the integrated optimization problem has been demonstrated and various techniques for solving the multiple objective function optimization are being investigated. The method called the Global Criteria Approach has been applied to a test problem with the blade in vacuum and the blade weight and the centrifugal stress as the multiple objectives. The results indicate that the method is quite effective in solving optimization problems with conflicting objective functions
Time Blocks Decomposition of Multistage Stochastic Optimization Problems
Multistage stochastic optimization problems are, by essence, complex because
their solutions are indexed both by stages (time) and by uncertainties
(scenarios). Their large scale nature makes decomposition methods appealing.The
most common approaches are time decomposition --- and state-based resolution
methods, like stochastic dynamic programming, in stochastic optimal control ---
and scenario decomposition --- like progressive hedging in stochastic
programming. We present a method to decompose multistage stochastic
optimization problems by time blocks, which covers both stochastic programming
and stochastic dynamic programming. Once established a dynamic programming
equation with value functions defined on the history space (a history is a
sequence of uncertainties and controls), we provide conditions to reduce the
history using a compressed "state" variable. This reduction is done by time
blocks, that is, at stages that are not necessarily all the original unit
stages, and we prove areduced dynamic programming equation. Then, we apply the
reduction method by time blocks to \emph{two time-scales} stochastic
optimization problems and to a novel class of so-called
\emph{decision-hazard-decision} problems, arising in many practical situations,
like in stock management. The \emph{time blocks decomposition} scheme is as
follows: we use dynamic programming at slow time scale where the slow time
scale noises are supposed to be stagewise independent, and we produce slow time
scale Bellman functions; then, we use stochastic programming at short time
scale, within two consecutive slow time steps, with the final short time scale
cost given by the slow time scale Bellman functions, and without assuming
stagewise independence for the short time scale noises
A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
In a general Hilbert framework, we consider continuous gradient-like
dynamical systems for constrained multiobjective optimization involving
non-smooth convex objective functions. Our approach is in the line of a
previous work where was considered the case of convex di erentiable objective
functions. Based on the Yosida regularization of the subdi erential operators
involved in the system, we obtain the existence of strong global trajectories.
We prove a descent property for each objective function, and the convergence of
trajectories to weak Pareto minima. This approach provides a dynamical
endogenous weighting of the objective functions. Applications are given to
cooperative games, inverse problems, and numerical multiobjective optimization
Design of Optimum Ducts Using an Efficient 3-D Viscous Computational Flow Analysis
Design of fluid dynamically efficient ducts is addressed through the combination of an optimization analysis with a three-dimensional viscous fluid dynamic analysis code. For efficiency, a parabolic fluid dynamic analysis was used. Since each function evaluation in an optimization analysis is a full three-dimensional viscous flow analysis requiring 200,000 grid points, it is important to use both an efficient fluid dynamic analysis and an efficient optimization technique. Three optimization techniques are evaluated on a series of test functions. The Quasi-Newton (BFGS, eta = .9) technique was selected as the preferred technique. A series of basic duct design problems are performed. On a two-parameter optimization problem, the BFGS technique is demonstrated to require half as many function evaluations as a steepest descent technique
- …