Recursive Algorithms for Trailing Stop: Stochastic Approximation Approach

Yin, G.; Zhang, Q.; Zhuang, C.
July 2010
Journal of Optimization Theory & Applications;Jul2010, Vol. 146 Issue 1, p209
Academic Journal
Trailing stops are often used in stock trading to limit the maximum of a possible loss and to lock in a profit. This work develops stochastic approximation algorithms to estimate the optimal trailing stop percentage. A stochastic optimization approach is proposed to recursively estimate the desired trailing stop percentage. A modification using projection is developed to ensure that the approximation sequence constructed stays in a reasonable range. Convergence of the algorithm is obtained. Moreover, interval estimates are constructed. Simulation examples are presented to compare our algorithm with Monte Carlo methods. Finally, we use real market data to demonstrate the algorithms.


Related Articles

  • Bayesian object identification. Rue, Håvard; Hurn, Merrilee A. // Biometrika;Sep1999, Vol. 86 Issue 3, p649 

    This paper addresses the task of locating and identifying an unknown number of objects of different types in an image. Baddeley & Van Lieshout (1993) advocate marked point processes as object priors, whereas Grenander & Miller (1994) use deformable template models. In this paper elements of both...

  • On sample size control in sample average approximations for solving smooth stochastic programs. Royset, Johannes // Computational Optimization & Applications;Jun2013, Vol. 55 Issue 2, p265 

    We consider smooth stochastic programs and develop a discrete-time optimal-control problem for adaptively selecting sample sizes in a class of algorithms based on variable sample average approximations (VSAA). The control problem aims to minimize the expected computational cost to obtain a...

  • Chapter 1: Introduction. Kumar, Rakesh; Sartori, John // Foundations & Trends in Electronic Design Automation;2011, Vol. 5 Issue 3, p155 

    An introduction to the journal is presented in which the guest editors discuss stochastic computing.

  • Stochastic scheduling on parallel machines to minimize discounted holding costs. Cai, Xiaoqiang; Wu, Xianyi; Zhou, Xian // Journal of Scheduling;Aug2009, Vol. 12 Issue 4, p375 

    We study stochastic scheduling on m parallel identical machines with random processing times. The cost involved in the problem is discounted to the present value and the objective is to minimize the expected discounted holding cost, which covers in a unified framework many performance measures...

  • Uncertainty quantification of reservoir performance predictions using a stochastic optimization algorithm. Gaoming Li; Reynolds, Albert C. // Computational Geosciences;Jun2011, Vol. 15 Issue 3, p451 

    The simultaneous perturbation stochastic approximation (SPSA) algorithm is modified to obtain a stochastic Gaussian search direction (SGSD) algorithm for automatic history matching. The search direction in the SGSD algorithm is obtained by simultaneously perturbing the reservoir model with...

  • On the Convergence Rate for Stochastic Approximation in the Nonsmooth Setting. Lim, Eunji // Mathematics of Operations Research;Aug2011, Vol. 36 Issue 3, p527 

    We consider a stochastic approximation (SA) method for finding the minimizer of a function f, which is convex but nondifferentiable at the minimizer. Due to the nondifferentiability at the minimizer, f is allowed to increase at a positive rate in a neighborhood of the minimizer. From this...

  • Algorithm for stochastic approximation with trial input perturbation in the nonstationary problem of optimization. Vakhitov, A. T.; Granichin, O. N.; Gurevich, L. S. // Automation & Remote Control;Nov2009, Vol. 70 Issue 11, p1827 

    Consideration was given to the randomized stochastic approximation algorithm with simultaneous trial input perturbation and two measurements used to optimize the unconstrained nonstationary functional. The upper boundary of the mean-square residual was established under conditions of single...

  • Solving SDGE Models: A New Algorithm for the Sylvester Equation. KamenÍk, OndŘej // Computational Economics;Feb2005, Vol. 25 Issue 1/2, p167 

    This paper presents a new numerical algorithm for solving the Sylvester equation involved in higher-order perturbation methods developed for solving stochastic dynamic general equilibrium models. The new algorithm surpasses other methods used so far (including the very popular doubling...

  • Neural Modeling of Multivariable Nonlinear Stochastic System. Variable Learning Rate Case. Errachdi, Ayachi; Saad, Ihsen; Benrejeb, Mohamed // Intelligent Control & Automation (2153-0653);Aug2011, Vol. 2 Issue 3, p167 

    The objective of this paper is to develop a variable learning rate for neural modeling of multivariable nonlinear stochastic system. The corresponding parameter is obtained by gradient descent method optimization. The effectiveness of the suggested algorithm applied to the identification of...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics