Optimization of nonhierarchically decomposed problems

DOI10.1016/J.CAM.2012.12.005zbMATH Open1262.90091OpenAlexW1972789364MaRDI QIDQ1947580FDOQ1947580

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

Recommendations

• scientific article
• 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

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)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)