Skip to main content
Log in

A convergence theory for a class of anti-jamming strategies

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

Abstract

A convergence theory for a class of anti-jamming strategies for nonlinear programming algorithms is presented. This theory generalizes previous results in this area by Zoutendijk, Topkis and Veinott, Mangasarian, and others; it is applicable to algorithms in which the anti-jamming parameter is fixed at some positive value as well as to algorithms in which it tends to zero. In addition, under relatively weak hypotheses, convergence of the entire sequence of iterates is proved.

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. Zoutendijk, G.,Methods of Feasible Directions, Elsevier Publishing Company, Amsterdam, Holland, 1960.

    Google Scholar 

  2. Klessig, R.,A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions, SIAM Journal on Control, Vol. 12, pp. 598–608, 1974.

    Google Scholar 

  3. Mangasarian, O. L.,Dual, Feasible Direction Algorithms, Techniques of Optimization, Edited by A. V. Balakrishnan, Academic Press, New York, New York, 1969.

    Google Scholar 

  4. Polak, E.,Computational Methods in Optimization, Academic Press, New York, New York, 1971.

    Google Scholar 

  5. Topkis, D. M., andVeinott, A. F.,On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming, SIAM Journal on Control, Vol. 5, pp. 268–279, 1967.

    Google Scholar 

  6. Zangwill, W. I.,Nonlinear Programming, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.

    Google Scholar 

  7. Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.

    Google Scholar 

  8. Meyer, R. R.,The Validity of a Family of Optimization Methods, SIAM Journal on Control, Vol. 8, pp. 41–54, 1970.

    Google Scholar 

  9. Ostrowski, A. M.,Solution of Equations and Systems of Equations, Academic Press, New York, New York, 1966.

    Google Scholar 

  10. Goldstein, A. A.,Constructive Real Analysis, Harper and Row Publishers, New York, New York, 1967.

    Google Scholar 

  11. Meyer, R. R.,Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms, Journal of Computer and System Sciences, Vol. 12, pp. 108–121, 1976.

    Google Scholar 

  12. Meyer, R. R.,A Comparison of the Forcing Function and Point-to-Set Mapping Approaches to Convergence Analysis, SIAM Journal on Control and Optimization (to appear).

  13. Wolfe, P.,On the Convergence of Gradient Methods under Constraint, IBM—Yorktown Heights, New York, Research Paper No. RC-1752, 1967.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by O. L. Mangasarian

This research was sponsored by the United States Army under Contract No. DA-31-124-ARO-D-462.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meyer, R.R. A convergence theory for a class of anti-jamming strategies. J Optim Theory Appl 21, 277–297 (1977). https://doi.org/10.1007/BF00933531

Download citation

  • Issue Date:

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

Key Words

Navigation