A superlinearly and quadratically convergent SQP type feasible method for constrained optimization

Applied Mathematics

Volumn 15, Issue 3, 2000, Pages 319-331

  Jian, Jinbao ^a   Zhang, Kecun ^b   Xue, Shengjia ^c  

^a GUANGXI UNIVERSITY   (China)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c JINAN UNIVERSITY   (China)

Author keywords

Constrained optimization; Convergence; Feasible method; Rate of convergence; SQP

Indexed keywords

EID: 84978999321     PISSN: 10051031     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11766-000-0057-9     Document Type: Article

References (15)

1. Panier, E. R., Tits, A. L. A superlinearly convergent feasible method for the solution of inequality constrained optimization problems, SIAM J. Control Optim., 1987, 25 (4): 934-950.
2. Jian, J. B., Tao, P. H., A two - step superlinearly convergent feasible direction method for nonlinear programming problems, In: Wang, Y. Q., ed., OR and Decision Making (Vol. 1),Chengdu University of Science and Technology Press, Chengdu, 1992,461-467.
3. Jian, J. B., A superlinearly convergent feasible direction algorithm for nonlinear optimization, J. of Math. (PRC), 1995,15(3):319-326.
4. Jian, J. B., Astrong subfeasible direction algorithm with superlinear convergence, J, of Systems Science and Systems Engineering, 1996,5(3):287-295.
5. Jian, J. B., A superlinearly convergent combined phase I-phase I subfeasible method, J, of Systems Science and Systems Engineering, 1994,3 (2). 104-111.
6. Jian, J. B., A subfeasible direction method combining SQP technique with generalized projection, Appl. Math. J. Chinese Univ. Ser. A, 1996,11(1):65-74.
7. Jian, J. B., A generalized subfeasible direction method for optimization problems using generalized projection, Guangxi Science (P R C), 1997,4 (4), 246-250.
8. Jian, J. B., Zhang, K. C., Strongly subfeasible direction method with strong convergence for inequality constrained optimization, J. of Xi’an Jiaotong University, 1999, 33 (8), 88-91.
9. Yuan, Y. X., Sun, W. Y., Optimization Theory and Methods, Science Press, Beijing, 1997.
10. Powell, M. J. D., The convergence of variable metric methods for nonlinearly constrained optimization calculations, In Mangasarian, O. L., Meyer, R. P., Robinson, S. M., eds.,Nonlinear Programming 3, Academic Press, New York, 1978,27-63.
11. Powell, M. J. D., Variable metric methods for constrained optimization calculations, In: Waston, G. A.,ed., Numerical Analysis, Dundee 1977,Springer-Verlag, Berlin, 1978,144-157.
12. Zhang, K. C., Yang, B. T, An effective numerical method for general geometric programming problems, J. of Computational Mathematics, 1994,16(2):158-169.
13. Shi, S. H., Yang, B. T, A SQP computational method of generalized geometric programming in mixed constraint conditions, Pure and Applied Mathematics, 1995,11 (2): 89-99.
14. Lucidi, S. New results on continuously differentiable penalty function, SIAM J. Optim. 1992,2: 558-574.
15. Facchinei, F. Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, J. of Optimization Theory and Applications, 1997,92(3): 543-579.