Abstract
A new trust-region and affine scaling algorithm for linearly constrained optimization is presented in this paper. Under no nondegenerate assumption, we prove that any limit point of the sequence generated by the new algorithm satisfies the first order necessary condition and there exists at least one limit point of the sequence which satisfies the second order necessary condition. Some preliminary numerical experiments are reported.
Similar content being viewed by others
References
Bonnans, J. F., Bouhtou, M., The trust region affine interior point algorithm for convex and nonconvex quadratic programming, RAIRO Recherche Operationnelle, 1995, 29: 195–217.
Bonnans, J. F., Pola, C., A trust region interior point algorithm for linearly constrained optimization, SIAM J. Opt., 1997, 7: 717–731.
Hock, W., Schittkowski, K., Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematics Systems, No. 187, Berlin: Springer-Verlag, 1981.
Gonzaga, C. C., An interior trust region method for linearly constrained optimization, COAL Newsletter, 1991, 19: 55–65.
Coleman, T. F., Li, Y., Combining trust region and affine scaling for linearly constrained nonconvex minimization, in Advances in Nonlinear Programming (ed. Yuan, Y.), Dordrecht: Kluwer Academic Publishers, 1998, 219–250.
Coleman, T. F., Li, Y., A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints, Math. Prog., 2000, 88: 1–31.
Schittkowski, K., More test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, No. 282, Berlin-Heidelberg: Springer-Verlag, 1987.
Author information
Authors and Affiliations
Corresponding authors
Additional information
The work was done while visiting Institute of Applied Mathematics, AMSS, CAS.
Rights and permissions
About this article
Cite this article
Zhongwen, C., Xiangsun, Z. A trust-region and affine scaling algorithm for linearly constrained optimization. Sci. China Ser. A-Math. 45, 1390–1397 (2002). https://doi.org/10.1007/BF02880033
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02880033