The DOI matches its Crossref record.
Application of a Smoothing Technique to Decomposition in Convex Optimization
Open accessAbstract
Dual decomposition is a powerful technique for deriving decomposition schemes for convex optimization problems with separable structure. Although the augmented Lagrangian is computationally more stable than the ordinary Lagrangian, the ldquoprox-termrdquo destroys the separability of the given problem. In this technical note we use another approach to obtain a smooth Lagrangian, based on a smoothing technique developed by Nesterov, which preserves separability of the problem. With this approach we derive a new decomposition method, called ldquoproximal center algorithm,rdquo which from the viewpoint of efficiency estimates improves the bounds on the number of iterations of the classical dual gradient scheme by an order of magnitude.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Fast Distributed Gradient Methods
Jakovetic, D., Xavier, J., & Moura, J. M. F. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2298712 · Cited by 624
A Survey on Model-Based Distributed Control and Filtering for Industrial Cyber-Physical Systems
Ding, D., Han, Q.-L., Wang, Z., & Ge, X. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2905295 · Cited by 509
An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
Patrinos, P., & Bemporad, A. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2275667 · Cited by 287
Metadata
- Authors
- Necoara, I., & Suykens, J. A. K.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2008-12
- Volume
- 53
- Issue
- 11
- Pages
- 2674-2679
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2106821132
- Cited by
- 161
- References
- 0
- FWCI
- 10.93
- Type
- journal article
- Language
- en
- Open access
- green
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: Application of a Smoothing Technique to Decomposition in Convex Optimization. https://app.cochat.ai/papers/10.1109/tac.2008.2007159
- The paper
- Necoara, I., & Suykens, J. A. K. (2008). Application of a Smoothing Technique to Decomposition in Convex Optimization. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2008.2007159
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.