Thevenin decomposition and large-scale optimization

DOI10.1007/BF02192638zbMath0866.90059MaRDI QIDQ2564172

Dimitri P. Bertsekas

Publication date: 7 January 1997

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

zbMATH Keywords

convex quadratic programminglinear equality constraintselectric circuit theoryminimum energy/network flow problemsensitivity resultThevenin theorem

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Deterministic network models in operations research (90B10)

Related Items

Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, A tensor product matrix approximation problem in quantum physics, PySP: modeling and solving stochastic programs in Python, Augmented penalty algorithms based on BFGS secant approximations and trust regions, One-class support vector ensembles for image segmentation and classification, Geometric applications of the split Bregman method: segmentation and surface reconstruction, Image restoration based on the hybrid total-variation-type model, Error forgetting of Bregman iteration, A primal-dual augmented Lagrangian, A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints, Variational approach to relaxed topological optimization: closed form solutions for structural problems in a sequential pseudo-time framework, High-order time integration applied to metal powder plasticity, A smoothing algorithm for finite min-max-min problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Recovering a probabilistic knowledge structure by constraining its parameter space, A dual iterative substructuring method with a penalty term, Generalized pattern search methods for a class of nonsmooth optimization problems with structure, A distributed approach to capacity allocation in logical networks, Inexact proximal point algorithms and descent methods in optimization, Optimization models for reaction networks: information divergence, quadratic programming and Kirchhoff's laws, A decomposition method for large scale MILPs, with performance guarantees and a power system application

Cites Work

• A hierarchical decomposition for large-scale optimal control problems with parallel processing structure
• Unnamed Item
• Unnamed Item