Optimization of nonhierarchically decomposed problems

  • Authors:
  • P. Guarneri;J. T. Leverenz;M. M. Wiecek;G. Fadel

  • Affiliations:
  • Department of Mechanical Engineering, Clemson University, Clemson, SC, 29634, United States;Department of Mathematical Sciences, Clemson University, Clemson, SC, 29634, United States;Department of Mathematical Sciences, Clemson University, Clemson, SC, 29634, United States;Department of Mechanical Engineering, Clemson University, Clemson, SC, 29634, United States

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2013

Quantified Score

Hi-index 7.29

Visualization

Abstract

The increasing computational power available to practitioners leads to challenging applications of optimization approaches to large scale systems. To address such problems, decomposition of the original or ''all-in-one'' (AiO) problem into smaller and simpler subproblems is the approach taken by engineers. Analytical target cascading (ATC), a hierarchical decomposition and coordination approach, is extended to model and coordinate problems with nonhierarchical interactions among the subproblems. Convergence results for ATC based on Lagrangian duality theory are extended for the new approach. Under certain conditions, the optimal solution of the AiO problem can be achieved by independently solving the nonhierarchically interacting subproblems. A mathematical example with several subproblems interacting in a network is included and new applications in engineering design are highlighted.