RESEARCH PAPERS: Design Automation Papers

Efficient Optimization of Computationally Expensive Objective Functions

[+] Author and Article Information
J. P. Karidis

IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 10598

S. R. Turns

Department of Mechanical Engineering, The Pennsylvania State University, University Park, PA, 16802

J. Mech., Trans., and Automation 108(3), 336-339 (Sep 01, 1986) (4 pages) doi:10.1115/1.3258736 History: Received November 11, 1985; Online November 19, 2009


An algorithm is presented for the efficient constrained or unconstrained minimization of computationally expensive objective functions. The method proceeds by creating and numerically optimizing a sequence of surrogate functions which are chosen to approximate the behavior of the unknown objective function in parameter-space. The Recursive Surrogate Optimization (RSO) technique is intended for design applications where the computational cost required to evaluate the objective function greatly exceeds both the cost of evaluating any domain constraints present and the cost associated with one iteration of a typical optimization routine. Efficient optimization is achieved by reducing the number of times that the objective function must be evaluated at the expense of additional complexity and computational cost associated with the optimization procedure itself. Comparisons of the RSO performance on eight widely used test problems to published performance data for other efficient techniques demonstrate the utility of the method.

Copyright © 1986 by ASME
Your Session has timed out. Please sign back in to continue.






Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In