Gradient-based Pareto front approximation applied to turbomachinery shape optimization
نویسندگان
چکیده
منابع مشابه
Constructing a Pareto front approximation for decision making
An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a finite set of Pareto optimal outcomes to the problem. The approach is based on the concept of inherent nondominance. Rules for checking the inherent nondominance of complexes ar...
متن کاملAdjoint shape optimization applied to electromagnetic design.
We present an adjoint-based optimization for electromagnetic design. It embeds commercial Maxwell solvers within a steepest-descent inverse-design optimization algorithm. The adjoint approach calculates shape derivatives at all points in space, but requires only two "forward" simulations. Geometrical shape parameterization is by the level set method. Our adjoint design optimization is applied t...
متن کاملCFD Based Wing Shape Optimization Through Gradient-Based Method
1. Abstract This paper deals with the optimization of shape of aerodynamic profiles. The objective is to reduce the drag coefficient on a given airfoil while preserving the lift coefficient within acceptable ranges. A set of control points defining the geometry are passed and parameterized as a B-Spline curve. These points are modified automatically by means of CFD analysis. A given shape is de...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کاملPAINT: Pareto front interpolation for nonlinear multiobjective optimization
A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering with Computers
سال: 2019
ISSN: 0177-0667,1435-5663
DOI: 10.1007/s00366-019-00832-y