Optimization algorithms and point-to-set-maps
- Cite this article as:
- Huard, P. Mathematical Programming (1975) 8: 308. doi:10.1007/BF01580449
- 103 Downloads
Two general nonlinear optimization algorithms generating a sequence of feasible solutions are described. The justifications for their convergence are based on the concept of point-to-set mapping continuity. These two algorithms cover many conventional feasible solution methods. The convergence results unify these apparently diverse approaches.