The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
DC Programming: Overview
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Mathematical Programs with Equilibrium Constraints
Luo, Z.-Q., Pang, J.-S., & Ralph, D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511983658 · Cited by 1,963
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
Self-citationLecture Notes in Economics and Mathematical Systems
Weiner, R. (1985) · Journal of Policy Analysis and Management · doi:10.2307/3323470 · Cited by 1,292
Introduction to Global Optimization
Horst, R., Pardalos, P. M., & Thoai, N. V. (2000) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4615-0015-5 · Cited by 1,217
Self-citationHorst, R., & Tụy, H. (1996) · Springer eBooks · doi:10.1007/978-3-662-03199-5 · Cited by 642
Self-citationOn functions representable as a difference of convex functions
Hartman, P. E. (1959) · Pacific Journal of Mathematics · doi:10.2140/pjm.1959.9.707 · Cited by 250
D.C. Optimization: Theory, Methods and Algorithms
Tụy, H. (1995) · Nonconvex optimization and its applications · doi:10.1007/978-1-4615-2025-2_4 · Cited by 212
A Successive Underestimation Method for Concave Minimization Problems
Falk, J. E., & Hoffman, K. R. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.3.251 · Cited by 172
Fukushima, M., Luo, Z.-Q. T., & Pang, J. (1998) · Computational Optimization and Applications · doi:10.1023/a:1018359900133 · Cited by 152
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Fisher, A., Rudin, C., & Dominici, F. (2018) · arXiv · doi:10.48550/arxiv.1801.01489 · Cited by 1,165
An, L. T. H., & Tao, P. D. (2005) · Annals of Operations Research · doi:10.1007/s10479-004-5022-1 · Cited by 800
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
“Good overviews of the work that has been done in solving DC programs globally can be found in (Horst and Thoai, 1999; Horst et al, 1995), and the references therein.”
BackgroundKernel methods in system identification, machine learning and function estimation: A survey
Pillonetto, G., Dinuzzo, F., Chen, T., De Nicolao, G., & Ljung, L. (2014) · Automatica · doi:10.1016/j.automatica.2014.01.001 · Cited by 741
Xu, Z., Zhang, H., Wang, Y., Chang, X., & Liang, Y. (2010) · Science China Information Sciences · doi:10.1007/s11432-010-0090-0 · Cited by 424
Sparse estimation of a covariance matrix
Bien, J., & Tibshirani, R. J. (2011) · Biometrika · doi:10.1093/biomet/asr054 · Cited by 342
Handbook of Mathematical Methods in Imaging
(2011) · Springer eBooks · doi:10.1007/978-0-387-92920-0 · Cited by 334
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Malyuta, D., Reynolds, T. P., Szmuk, M., Lew, T., Bonalli, R., Pavone, M., & Açıkmeşe, B. (2022) · IEEE Control Systems · doi:10.1109/mcs.2022.3187542 · Cited by 259
A review of optimization methodologies in support vector machines
Shawe-Taylor, J., & Sun, S. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.06.026 · Cited by 256
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
A new multiple kernel-based regularization method for identification of delay linear dynamic systems
Chen, X., Mao, Z., & Jia, R. (2020) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2020.103971 · Cited by 5
Metadata
- Authors
- Horst, R., & Thoai, N. V.
- Venue
- Journal of Optimization Theory and Applications
- Published
- 1999-10
- Volume
- 103
- Issue
- 1
- Pages
- 1-43
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W81972919
- Cited by
- 672
- References
- 21
- FWCI
- 4.76
- 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
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.