The DOI matches its Crossref record.
Optimization by decomposition and coordination: A unified approach
Abstract
In the general framework of inifinite-dimensional convex programming, two fundamental principles are demonstrated and used to derive several basic algorithms to solve a so-called "master" (constrained optimization) problem. These algorithms consist in solving an infinite sequence of "auxiliary" problems whose solutions converge to the master's optimal one. By making particular choices for the auxiliary problems, one can recover either classical algorithms (gradient, Newton-Raphson, Uzawa) or decomposition-coordination (two-level) algorithms. The advantages of the theory are that it clearly sets the connection between classical and two-level algorithms, It provides a framework for classifying the two-level algorithms, and it gives a systematic way of deriving new algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Distributed Optimal Power Flow Using ADMM
Erseghe, T. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2306495 · Cited by 531
A New Method for Unit Commitment at Electricite De France
Merlin, A., & Sandrin, P. (1983) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1983.318063 · Cited by 419
Metadata
- Authors
- Cohen, G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1978-04
- Volume
- 23
- Issue
- 2
- Pages
- 222-232
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2171305414
- Cited by
- 175
- References
- 0
- FWCI
- 4.43
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimization by decomposition and coordination: A unified approach. https://app.cochat.ai/papers/10.1109/tac.1978.1101718
- The paper
- Cohen, G. (1978). Optimization by decomposition and coordination: A unified approach. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1978.1101718
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.