Variable-Number Sample-Path Optimization

نویسندگان

  • Geng Deng
  • Michael C. Ferris
چکیده

The sample-path method is one of the most important tools in simulation-based optimization. The basic idea of the method is to approximate the expected simulation output by the average of sample observations with a common random number sequence. In this paper, we describe a new variant of Powell’s UOBYQA (Unconstrained Optimization BY Quadratic Approximation) method, which integrates a Bayesian Variable-Number Sample-Path (VNSP) scheme to choose appropriate number of samples at each iteration. The statistically accurate scheme determines the number of simulation runs, and guarantees the global convergence of the algorithm. The VNSP scheme saves a significant amount of simulation operations compared to general purpose ‘fixed-number’ sample-path methods. We present numerical results based on the new algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Way to Select the Parameters of SVM Based on the Ant Optimization Algorithm

A large number of experimental data shows that Support Vector Machine (SVM) algorithm has obvious a large advantages in text classification, handwriting recognition, image classification, bioinformatics, and some other fields. To some degree, the optimization of SVM depends on its kernel function and Slack variable, the determinant of which is its parameters δ and c in the classification functi...

متن کامل

Variable-Sample Methods and Simulated Annealing for Discrete Stochastic Optimization

In this paper we discuss the application of a certain class of Monte Carlo methods to stochastic optimization problems. Particularly, we study variable-sample techniques, in which the objective function is replaced, at each iteration, by a sample average approximation. We first provide general results on the schedule of sample sizes, under which variable-sample methods yield consistent estimato...

متن کامل

A hybrid Particle Swarm Optimization - Variable Neighborhood Search algorithm for Constrained Shortest Path problems

In this paper, a well known NP-hard problem, the Constrained Shortest Path problem, is studied. As efficient metaheuristic approaches are required for its solution, a new hybridized version of Particle Swarm Optimization algorithm with Variable Neighborhood Search is proposed for solving this significant combinatorial optimization problem. Particle Swarm Optimization (PSO) is a population-based...

متن کامل

Stochastic Optimization with cvxpy EE364b Project Final Report

where x ∈ R is the optimization variable, ω ∈ R is a random variable, and the fi : R ×R → R, i = 0, . . . ,m are convex functions of x for each value of ω. In recent work, we implemented into cvxpy a (basic) framework for specifying and solving stochastic programs; we refer to this framework as cvxstoc. cvxstoc works by replacing the expectations in (1), which we assume are difficult to compute...

متن کامل

Design optimization of a robust sleeve antenna for hepatic microwave ablation.

We describe the application of a Bayesian variable-number sample-path (VNSP) optimization algorithm to yield a robust design for a floating sleeve antenna for hepatic microwave ablation. Finite element models are used to generate the electromagnetic (EM) field and thermal distribution in liver given a particular design. Dielectric properties of the tissue are assumed to vary within +/- 10% of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 117  شماره 

صفحات  -

تاریخ انتشار 2009