Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computational study of the nonhierarchical decomposition algorithm

From MaRDI portal
Publication:1315449
Jump to:navigation, search

DOI10.1007/BF01299452zbMath0792.90072MaRDI QIDQ1315449

Layne T. Watson, Calvin J. Ribbens, Jayashree Shankar, Raphael T. Haftka

Publication date: 10 March 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

nonhierarchical decomposition


Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Quadratic programming (90C20) Parallel numerical computation (65Y05)


Related Items (4)

A local convergence analysis of bilevel decomposition algorithms ⋮ Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems ⋮ Novel collaborative optimization framework with a negotiation model for satellite system design ⋮ A classification of methods for distributed system optimization based on formulation structure


Uses Software

  • MINOS
  • QPSOL


Cites Work

  • On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
  • Unnamed Item


This page was built for publication: Computational study of the nonhierarchical decomposition algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1315449&oldid=13430077"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki