A convergence theory for a class of anti-jamming strategies

DOI10.1007/BF00933531zbMath0332.90043OpenAlexW1986333278MaRDI QIDQ1228553

Robert R. Meyer

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933531

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for the convergence of monotonic mathematical programming algorithms
• A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions
• A Comparison of the Forcing Function and Point-to-Set Mapping Approaches to Convergence Analysis
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• The Validity of a Family of Optimization Methods

This page was built for publication: A convergence theory for a class of anti-jamming strategies