The DOI matches its Crossref record; 104 of the 104 references it cites were found in a registry or an index.
Playing with Duality: An overview of recent primal?dual approaches for solving large-scale optimization problems
Open accessAbstract
Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify its solution. However, deriving efficient strategies that jointly bring into play the primal and dual problems is a more recent idea that has generated many important new contributions in recent years. These novel developments are grounded in the recent advances in convex analysis, discrete optimization, parallel processing, and nonsmooth optimization with an emphasis on sparsity issues. In this article, we aim to present the principles of primal-dual approaches while providing an overview of the numerical methods that have been proposed in different contexts. Last but not least, primal-dual methods lead to algorithms that are easily parallelizable. Today, such parallel algorithms are becoming increasingly important for efficiently handling high-dimensional problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
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
(1988) · Cited by 16,582
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Nonrigid registration using free-form deformations: application to breast mr images
Rueckert, D., Sonoda, L. I., Hayes, C., Hill, D. L. G., Leach, M. O., & Hawkes, D. J. (1999) · IEEE Transactions on Medical Imaging · doi:10.1109/42.796284 · Cited by 5,265
Cited by
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundVisualizing big data with augmented and virtual reality: Challenges and research agenda
Olshannikova, E., Ometov, A., Koucheryavy, Y., & Olsson, T. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0031-2 · Cited by 315
“Ivo Dinov for his research scope listed another data’s multi-dimensional characteristics [30] such as data size, incompleteness, incongruency, complex representation, multiscale nature and heterogeneity of its sources [31, 32].”
BackgroundOn the convergence of approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., & Fletcher, A. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874830 · Cited by 279
Flexible mobility on-demand: an environmental scan
Liyanage, S., Dia, H., Abduljabbar, R., & Bagloee, S. (2019) · Sustainability · doi:10.3390/su11051262 · Cited by 111
EMG-Based Automatic Gesture Recognition Using Lipschitz-Regularized Neural Networks
Neacşu, A., Pesquet, J.-C., & Burileanu, C. (2024) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3635159 · Cited by 15
Self-citation
Metadata
- Authors
- Komodakis, N., & Pesquet, J.-C.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2015-11
- Volume
- 32
- Issue
- 6
- Pages
- 31-54
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W1922442141
- Cited by
- 419
- References
- 104
- FWCI
- 41.74
- 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
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.