The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Open accessAbstract
In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints, and also consider extensions to some structured, nonsmooth problems. The algorithm solves a sequence of (separable) strongly convex problems and maintains feasibility at each iteration. Convergence to a stationary solution of the original nonconvex optimization is established. Our framework is very general and flexible and unifies several existing successive convex approximation (SCA)-based algorithms. More importantly, and differently from current SCA approaches, it naturally leads to distributed and parallelizable implementations for a large class of nonconvex problems. This Part I is devoted to the description of the framework in its generality. In Part II, we customize our general methods to several (multiagent) optimization problems in communications, networking, and machine learning; the result is a new class of centralized and distributed algorithms that compare favorably to existing ad-hoc (centralized) schemes.
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
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
The method of moving asymptotes—a new method for structural optimization
Svanberg, K. (1987) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620240207 · Cited by 5,573
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Rockafellar, R. T., & Wets, R. J. B. (1998) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-02431-3 · Cited by 4,086
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Cited by
On the Total Energy Efficiency of Cell-Free Massive MIMO
Ngo, H. Q., Tran, L.-N., Duong, T. Q., Matthaiou, M., & Larsson, E. G. (2018) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2017.2770215 · Cited by 863
Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning
Jeong, S., Simeone, O., & Kang, J. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2706308 · Cited by 812
Federated learning over wireless networks Convergence analysis and resource allocation
Dinh, C. T., Tran, N. H., Nguyen, M. N. H., Hong, C. S., Bao, W., Zomaya, A. Y., & Gramoli, V. (2021) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2020.3035770 · Cited by 483
“4) FEDL Solution: Since we can obtain the stationary points of SUB3 using Successive Convex Approximation techniques such as NOVA [34], then we have:”
MethodDC programming and DCA: thirty years of developments
Le Thi, H. A., & Pham Dinh, T. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1235-y · Cited by 348
A survey on computation offloading modeling for edge computing
Lin, H., Zeadally, S., Chen, Z., Labiod, H., & Wang, L. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102781 · Cited by 305
Metadata
- Authors
- Scutari, G., Facchinei, F., & Lampariello, L.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2017-04-15
- Volume
- 65
- Issue
- 8
- Pages
- 1929-1944
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2295566694
- Cited by
- 314
- References
- 54
- FWCI
- 32.21
- 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: Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory. https://app.cochat.ai/papers/10.1109/tsp.2016.2637317
- The paper
- Scutari, G., Facchinei, F., & Lampariello, L. (2017). Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2016.2637317
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.