A superlinearly convergent method of feasible directions

Applied Mathematics and Computation

Volumn 116, Issue 3, 2000, Pages 231-244

  Kostreva, M M ^a   Chen, X ^a  

^a CLEMSON UNIVERSITY   (United States)

Author keywords

Engineering optimization; Linear convergence rate; Method of feasible directions (MFD); Nonlinear optimization; Sequential quadratic programming (SQP); Superlinear convergence rate

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ITERATIVE METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

LINEAR CONVERGENCE RATES; SEQUENTIAL QUADRATIC PROGRAMMING; SUPERLINEARLY CONVERGENT METHOD;

CONVERGENCE OF NUMERICAL METHODS;

EID: 0034544425     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(99)00176-9     Document Type: Article

References (26)

1. Belegundu A.D., Berke L., Patnaik S.N. An optimization algorithm based on the method of feasible directions. Structural Optimization. 9:1995;83-88.
2. Korycki J.A., Kostreva M.M. Norm-relaxed method of feasible directions: application in structural optimization. Structural Optimization. 11(3/4):1996;187-194.
3. Vanderplaats G.N. Numerical Optimization Techniques for Engineering Design. 1984;McGraw-Hill, New York.
4. Vanderplaats G.N. Efficient feasible directions algorithm for design synthesis. AIAA J. 22:1984;1633-1640.
5. Tits A.L., Nye W.T., Sangiovanni-Vincentelli A.L. Enhanced methods of feasible directions for engineering design problems. J. Optimization Theory Appl. 5(1):1986;475-504.
6. G.N. Vanderplaats, DOT/DOC Users Manual, Vanderplaats, Miura and Associates, 1993.
7. Zoutendijk G. Methods of Feasible Directions. 1960;Elsevier, Amsterdam.
8. Topkis D.M., Veinott A.F. On the convergence of some feasible direction algorithms for nonlinear programming. SIAM J. Control. 5:1967;268-279.
9. Pironneau O., Polak E. On the rate of convergence of certain methods of centers. Mathematical Programming. 2:1972;230-257.
10. Pironneau O., Polak E. Rate of convergence of a class of methods of feasible directions. SIAM J. Numer. Analysis. 10:1973;161-173.
11. Cawood M.E., Kostreva M.M. Norm-relaxed method of feasible directions for solving nonlinear programming problems. J. Optimization Theory Appl. 83(2):1994;311-320.
12. J.A. Korycki, Norm-relaxed method of feasible directions, Ph.D. dissertation, Department of Mathematical Sciences, Clemson University, August 1995.
13. Korycki J.A., Kostreva M.M. Convergence analysis of norm-relaxed method of feasible directions. J. Optimization Theory Appl. 91(2):1994;389-418.
14. Korycki J.A., Kostreva M.M. Self-tuning norm-relaxed method of feasible directions. J. Optimization Theory Appl. 92(2):1997;311-330.
15. M.M. Kostreva, X.B. Chen, J.A. Korycki, A norm-relaxed method of feasible directions for solving nonlinear programming problems, in: Proceedings of the Sixth AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Bellevue, WA, September 1996.
16. Chen X., Kostreva M.M. A generalization of the norm-relaxed method of feasible directions. Appl. Math. Computation. 102(2-3):1999;257-272.
17. X. Chen, M.M. Kostreva, Methods of feasible directions: a review, in: X. Yang, A. Mees, M. Fisher, L. Jennings (Eds.), Progress in Optimization II, Applied Optimization Series, vol. 39, Kluwer Academic Publishers, Dordrecht, 2000.
18. M.M. Kostreva, X. Chen, Asymptotic rate of convergence of SQP-type methods of feasible directions in: X. Yang, K.L. Teo, L. Caccetta (Eds.), Optimization Methods and Applications, Kluwer Academic Publishers, Dordrecht, to appear.
19. W. Hock, K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, vol. 187, Springer, Berlin, 1981.
20. M.J.D. Powell, A fast algorithm for nonlinearly constrained optimization calculations, in: G. A. Watson (Ed.), Lecture Notes in Mathematics, vol. 630, Springer, Berlin, 1977, pp. 144-157.
21. Panier E.R., Tits A.L. A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM J. Control Optimization. 25(4):1987;934-950.
22. Panier E.R., Tits A.L., Herskovits J.N. A QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM J. Control Optimization. 26(4):1988;788-811.
23. Panier E.R., Tits A.L. On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Math. Programming. 59:1993;261-276.
24. Chen X., Kostreva M.M. Global convergence analysis of the algorithms for finding feasible points in norm-relaxed MFD. J. Optimization Theory Appl. 100:1999;287-309.
25. Robinson S.M. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms. Math. Programming. 7:1974;1-16.
26. M.J.D. Powell, The convergence of variable metric methods for nonlinearly constrained optimization calculations, in: O.L. Mangasarian, R.R. Meyer, S.M. Robinson (Eds.), Nonlinear Programming, vol. 3, Academic Press, New York, 1978, pp. 27-63.