Abstract
Optimizing the design of complex ground and flight vehicles involves multiple disciplines and multilayered computer codes stitched together from mostly incompativle disciplinary codes. The application of established, large-scale, optimization algorithms to the complete model is nearly impossible. Hierarchical decompositions are inappropriate for these types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategyfor nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two-dimensional quadratic programs. This paper demonstrates the failure of the algorithm for quadratic programs and suggests a number of possible modifications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C.L. Bloebaum, P. Hajela, and J. Sobieszczanski-Sobieski, “Non-hierarchic system decomposition in structural optimization,” inThird NASA/Air Force Symp. on Recent Advances in Multidisciplinary Analysis and Optimization, San Francisco, CA, 1990.
R. Fletcher,Practical Methods of Optimization, vol. 2, John Wiley and Sons: New York, 1980.
P.E. Gill, W. Murray, and M.A. Saunders, “QPSOL,” Dept. of Oper. Res., Stanford Univ.,Stanford, CA, 1984.
C.H. Jollissaint, N.V. Arvanitidis, and D.G. Luenberger, “Decomposition of real and reactive power flow: a method suited for on-line applications”IEEE Trans. Pow. App. Sys., vol. PAS-91-2 pp. 661–670, 1972.
G. Kreisselmeier and R. Steinhauser, “Systematic control design by optimizing a vector performance index,” inProc. IFAC Symp. on Computer Aided Design of Control Systems, Zurich, Switzerland, 1979, pp. 113–117.
B.A. Murtagh and M.A. Saunders, “MINOS 5.0 User's Guide,” Report SOL 83-20, Dept. of Operations Research, Stanford Univ., Stanford, CA, 1983.
J.E. Renaud and G.A. Gabriele, “Sequential global approximation in non-hierarchic system decomposition and optimization,”Adv. Design Automation, vol. 1, pp. 191–200, 1991.
J. Shankar, “Analysis of a nonhierarchical decomposition algorithm,” M.S. thesis, Dept. of Computer Science, Virginia Polytech. Inst. and State Univ., Blacksburg, VA, 1992.
J. Sobieszczanski-Sobieski, “Optimization by decomposition: A step from hierarchic to nonhierarchic systems,” inSecond NASA/Air Force Symp. on Recent Advances in Multidisciplinary Analysis and Optimization, Hampton, VA, 1988.
J. Sobieszczanski-Sobieski, “A linear decomposition method for large optimization problems,” NASA TM 83248, 1982.
P. Tseng, “On the rate of convergence of a partially asynchronous gradient projection algorithm,”SIAM J. Optim., vol. 1, pp. 603–619, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shankar, J., Haftka, R.T. & Watson, L.T. Computational study of a nonhierarchical decomposition algorithm. Comput Optim Applic 2, 273–293 (1993). https://doi.org/10.1007/BF01299452
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01299452