A generalization of the norm-relaxed method of feasible directions

Applied Mathematics and Computation

Volumn 102, Issue 2-3, 1999, Pages 257-272

  Chen, X B ^a   Kostreva, M M ^a  

^a CLEMSON UNIVERSITY   (United States)

Author keywords

Directions finding subproblem (DFS); Global convergence; Method of feasible directions (MFD); Nonlinear programming (NLP); Structural optimization

Indexed keywords

EID: 0040143446     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(98)10025-5     Document Type: Article

References (25)

1. Belegundu A.D., Berke L., Patnaik S.N. An optimization algorithm based on the method of feasible directions. Struct. Optimiz. 9:1995;83-88.
2. G.N. Vanderplaats, Numerical Optimization Techniques for Engineering Design, McGraw-Hill, New York, 1984.
3. Vanderplaats G.N. Efficient feasible directions algorithm for design synthesis. AIAA J. 22:1984;1633-1640.
4. G.N. Vanderplaats, DOT/DOC Users Manual, Vanderplaats, Miura and Associates, 1993.
5. E. Polak, Computational Methods in Optimization, Academic Press, New York, 1971.
6. G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam, 1960.
7. P. Wolfe, On the convergence of gradient methods under constraints, IBM Research Report RC 1752, Yorktown Heights, New York, 1967.
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. Math. Program. 2:1972;230-257.
10. Pironneau O., Polak E. Rate of convergence of a class of methods of feasible directions. SIAM J. Num. Anal. 10:1973;161-173.
11. Chaney R.W. On the Pironneau-Polak method of centers. J. Optimiz. Theory Applications. 20:1976;269-295.
12. Chaney R.W. On the rate of convergence of some feasible direction algorithm. J. Optimiz. Theory Applications. 20:1976;297-313.
13. Wiest E.J., Polak E. A generalized quadratic programming-based phase I-phase II method for inequality constrained optimization. J. Appl. Math. and Optimiz. 26:1992;223-252.
14. Polak E., Trahan R., Mayne D.Q. Combined phase I-phase II methods of feasible directions. Math. Program. 17:1979;61-73.
15. Herskovits J.N. A two-stage feasible directions algorithm for nonlinear constrained optimization. Math. Program. 36:1986;19-38.
16. Cawood M.E., Kostreva M.M. Norm-relaxed method of feasible directions for solving nonlinear programming problems. J. Optimiz. Theory Applications. 83:1994;311-320.
17. J.A. Korycki, Norm-relaxed method of feasible directions, Ph.D. Dissertation, Department of Mathematical Sciences, Clemson University (1995).
18. Korycki J.A., Kostreva M.M. Convergence analysis of norm-relaxed method of feasible directions. J. Optimiz. Theory Applications. 91:1996;389-418.
19. Korycki J.A., Kostreva M.M. Norm-relaxed method of feasible directions: Application in structural optimization. Struct. Optimiz. 11:1996;187-194.
20. Korycki J.A., Kostreva M.M. Self-tuning norm-relaxed method of feasible directions. J. Optimiz. Theory Applications. 92:1997;311-330.
21. Kostreva M.M. Generalization of Murty's direct algorithm to linear and convex quadratic programming. J. Optimiz. Theory Applications. 62:1989;63-76.
22. M.M. Kostreva, X.B. Chen, J.A. Korycki, A norm-relaxed method of feasible directions for solving nonlinear programming problems, in: Proc. Sixth AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Bellevue, WA, September 1996.
23. M.S. Bazaraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, second edition, Wiley, 1993.
24. W. Hock, K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 187, Springer, Berlin, 1981.
25. K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 282, Springer, Berlin, 1987.