1 / 14

Optimization with surrogates

Optimization with surrogates. Zooming Construct surrogate, optimize objective, refine region and surrogate, repeat. Danger: Miss optima. Adaptive sampling Construct surrogate, add points by balancing exploration and exploitation, repeat. Most popular, Jones’s EGO

finn
Download Presentation

Optimization with surrogates

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Optimization with surrogates • Zooming • Construct surrogate, optimize objective, refine region and surrogate, repeat. • Danger: Miss optima. • Adaptive sampling • Construct surrogate, add points by balancing exploration and exploitation, repeat. • Most popular, Jones’s EGO • Easiest with one added sample at a time.

  2. Optimization cycle concept • Define region in design space • Evaluate objective and constraints at a set of points (Design of experiments) • Construct surrogates for expensive objective function and constraints • Perform optimization based on surrogates • Refine surrogate and go back to step 1 if convergence not achieved and another cycle is affordable

  3. Theoretical considerations for zooming • Process may not converge to true (even local) optimum • There are algorithms that are guaranteed to converge to a local optimum but they are limited (see publications by Natalia Alexandrov) • It is useful to reduce size of design space (every function is quadratic in a small enough region) • Choice between surrogates depends on density of sampling

  4. Design Space Refinement • Design space refinement (DSR): process of narrowing down search by excluding regions because • They obviously violate the constraints • Objective function values in region are poor • Benefits of DSR • Prevent costly analysis of infeasible designs • Improve surrogate model accuracy • Techniques • Design space reduction • Reasonable design space • Design space windowing Madsen et al. (2000) Rohani and Singh (2004)

  5. Radial Turbine Preliminary Aerodynamic Design Optimization Yolanda Mack University of Florida, Gainesville, FL Raphael Haftka, University of Florida, Gainesville, FL Lisa Griffin, Lauren Snellgrove, and Daniel Dorney, NASA/Marshall Space Flight Center, AL Frank Huber, Riverbend Design Services, Palm Beach Gardens, FL Wei Shyy, University of Michigan, Ann Arbor, MI 42nd AIAA/ASME/SAE/ASEE Joint Propulsion Conference & Exhibit 7-12-06

  6. Radial Turbine Optimization Overview • Perform optimization to improve efficiency of a compact radial turbine • Increase turbine efficiency while maintaining low turbine weight • Polynomial response surface approximations used to facilitate optimization • Three-stage optimization using 1-D Meanline code • Determination of feasible design space • Identify region of interest • Obtain high accuracy approximation for Pareto front identification

  7. Maximizeηts and MinimizeWrotor such that Optimization Problem • Objective Variables • Rotor weight • Total-to-static efficiency • Design Variables • Rotational Speed • Degree of reaction • Exit to inlet hub diameter • Isentropic ratio of blade to flow speed • Annulus area • Choked flow ratio • Constraints • Tip speed • Centrifugal stress measure • Inlet flow angle • Recirculation flow coefficient • Exit to inlet shroud radius

  8. Phase 1: Determine feasible domain • Design of Experiments: Face-centered CCD (77 points) • 7 cases failed • 60 violated constraints • Using RSAs, dependences determined for constraints • Variables omitted for which constraints are insensitive • Constraints set to specified limits • Corresponding bounds on design variables determined • Constraint boundary approximations developed to help determine feasible design space

  9. Infeasible Region Feasible Region Feasible Regions for Three Constraints • RSA evaluation determines two 1-D constraints • Ranges of design variables reduced to match 1-D constraint boundaries • All invalid values of a third constraint lie outside of new ranges • Thus, three of five constraints automatically satisfied by range reduction of two design variables

  10. Feasible Region Infeasible Region 0 < β1 < 40 React > 0.45 Infeasible Region Feasible Region Range limit Feasible Regions for Two Constraints • New 3-level full factorial design (729 points) • 498 / 729 were eliminated prior to Meanline analysis based on new variable constraints • 97% of remaining 231 points found feasible using Meanline code

  11. 1 – ηts Wrotor Use loss function to estimate accuracy • Five RSAs constructed for each objective using general loss function • Parameter p = 1,2,…,5 • Least square loss function (p = 2) • Pareto fronts differ by as much as 20% • Design space refinement is necessary

  12. Design Variable Range Reduction

  13. 1 – ηts Wrotor 1 – ηts Wrotor Phase 3: Construction of Final Pareto Front and RSA Validation • For p = 1,2,…,5 Pareto fronts differ by 5% - design space is adequately refined • Trade-off region provides best value in terms of maximizing efficiency and minimizing weight • Pareto front validation indicates high accuracy RSAs • Improvement of ~5% over baseline case at same weight

  14. Summary • Response surfaces based on output constraints successfully used to identify feasible design space • Design space reduction eliminated poorly performing areas while improving RSA and Pareto front accuracy • Using the Pareto front information, a best trade-off region was identified • At the same weight, the RSA optimization resulted in a 5% improvement in efficiency over the baseline case

More Related