Skip to main content
Log in

Stochastic algorithms with armijo stepsizes for minimization of functions

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Stochastic algorithms for optimization problems, where function evaluations are done by Monte Carlo simulations, are presented. At each iteratex i, they draw a predetermined numbern(i) of sample points from an underlying probability space; based on these sample points, they compute a feasible-descent direction, an Armijo stepsize, and the next iteratex i+1. For an appropriate optimality function σ, corresponding to an optimality condition, it is shown that, ifn(i) → ∞, then σ(x i) → 0, whereJ is a set of integers whose upper density is zero. First, convergence is shown for a general algorithm prototype: then, a steepest-descent algorithm for unconstrained problems and a feasible-direction algorithm for problems with inequality constraints are developed. A numerical example is supplied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Armijo, L.,Minimization of Functions Having Continuous Partial Derivatives, Pacific Journal of Mathematics, Vol. 16, pp. 1–3, 1966.

    Google Scholar 

  2. Polak, E.,Computational Methods of Optimization: A Unified Approach, Academic Press, New York, New York, 1971.

    Google Scholar 

  3. Zangwill, W. I.,Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.

    Google Scholar 

  4. Wardi, Y.,A Stochastic Algorithm Using One Point per Simulation and Diminishing Stepsizes, Journal of Optimization Theory and Applications, Vol. 61, pp. 473–485, 1989.

    Google Scholar 

  5. Maheshwari, S., andMukai, H.,An Optimization Algorithm Driven by Probabilistic Simulation, Proceedings of the Conference on Decision and Control, Athens, Greece, pp. 1703–1705, 1986.

  6. Wardi, Y.,A Stochastic Steepest-Descent Algorithm, Journal of Optimization Theory and Applications, Vol. 59, pp. 307–323, 1988.

    Google Scholar 

  7. Kushner, H. J.,Stochastic Approximation Algorithms for the Local Optimization of Functions with Nonunique Stationary Points, IEEE Transactions on Automatic Control, Vol. AC-17, pp. 646–654, 1972.

    Google Scholar 

  8. Kushner, H. J.,Stochastic Approximation Algorithms for Constrained Optimization Problems, Annals of Statistics, Vol. 2, pp. 713–723, 1974.

    Google Scholar 

  9. Keifer, J., andWolfowitz, J.,Stochastic Estimation of the Maximum of a Regression Function, Annals of Mathematical Statistics, Vol. 23, pp. 462–466, 1952.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by E. Polak

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wardi, Y. Stochastic algorithms with armijo stepsizes for minimization of functions. J Optim Theory Appl 64, 399–417 (1990). https://doi.org/10.1007/BF00939456

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00939456

Key Words

Navigation