Optimization of nonhierarchically decomposed problems

DOI10.1016/J.CAM.2012.12.005MaRDI QIDQ1947580zbMATH OpenOpenAlexFDO

Authors J. T. Leverenz, Margaret M. Wiecek, Georges M. Fadel, Paolo Guarneri

Publication date 22 April 2013

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2012.12.005

zbMATH Keywords

networkcomplex systemsubgradient optimizationanalytical target cascadingMDO

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Large-scale problems in mathematical programming (90C06)

Recommendations

• scientific article; zbMATH DE number 5846648
• Computational study of the nonhierarchical decomposition algorithm
• Convergence criteria for hierarchical overlapping coordination of linearly constrained convex design problems
• Sequentially Decomposed Programming
• Biobjective optimization for analytical target cascading: optimality vs. achievability

Cited in

(6)

• DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
• scientific article; zbMATH DE number 5846648 (Why is no real title available?)
• scientific article; zbMATH DE number 1225243 (Why is no real title available?)
• Efficient multi-level design optimization using analytical target cascading and sequential quadratic programming
• Biobjective optimization for analytical target cascading: optimality vs. achievability
• Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality

This page was built for publication: Optimization of nonhierarchically decomposed problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947580)