Abstract
In this paper, a recursive quadratic programming algorithm is proposed and studied. The line search functions used are Han’s nondifferentiable penalty functions with a second order penalty term. In order to avoid maratos effect, Fukushima’s mixed direction is used as the direction of line search. Finally, we prove the global convergence and the local second order convergence of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Han, S. P., A globally convergent method for nonlinear programming,J. of Optimization Theory and Application,22 (1977), 207–309.
Powell, M. J. D., A fast algorithm for nonlinearly constrained optimization calculations, inNumerial Analysis. Dundee, 1977, 144–157.
Fukushima, M., A successive quadratic programming algorithm with global and superlinear convergence properties,Mathematical Programming,35 (1986), 253–264.
Zhang Kecun, The Algorithm and Analysis of Engineering Optimization,Xi’an Jiaotong University Press, Xi’an, 1988.
Fletcher, R., Pratical Methods of Optimization, Vol.2: Constrained Optimization, John Wiley & Son, Chichester, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boting, Y., Kecun, Z. A recursive quadratic programming algorithm that uses a new nondifferentiable penalty functions. Appl. Math. 9, 95–103 (1994). https://doi.org/10.1007/BF02662030
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02662030