๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Thevenin decomposition and large-scale optimization

โœ Scribed by D. P. Bertsekas

Publisher
Springer
Year
1996
Tongue
English
Weight
633 KB
Volume
89
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Iterative bundle-based decomposition for
Iterative bundle-based decomposition for large-scale nonseparable convex optimization
โœ Koohyun Park; Yong-Sik Shin ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 278 KB

There has been considerable research in solving large-scale separable convex optimization problems. In this paper we present an algorithm for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. The solution of the problem is approximated by solving a s

Large-scale system optimization
Large-scale system optimization
โœ G.M. Ostrovsky; Ye.M. Mikhailova; T.A. Berezhinsky ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 560 KB
Matrix scaling for large-scale system de
Matrix scaling for large-scale system decomposition
โœ John D. Finney; Bonnie S. Heck ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 777 KB

Many large-scale systems exhibit the structure of weakly connected components. In such cases, proper identification of weakly coupled subsystems will add insight into large-scale system behavior, and aid in related tasks such as the design of decentralized control. e-decomposition is a well-known e