The DOI matches its Crossref record; 155 of the 155 references it cites were found in a registry or an index.
DC programming and DCA: thirty years of developments
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Domain-Adversarial Training of Neural Networks
Ganin, Y., Ustinova, E., Ajakan, H., Germain, P., Larochelle, H., Laviolette, F., Marchand, M., & Lempitsky, V. (2017) · Advances in Computer Vision and Pattern Recognition · doi:10.1007/978-3-319-58347-1_10 · Cited by 8,318
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Attouch, H., Bolte, J., & Svaiter, B. F. (2013) · Mathematical Programming · doi:10.1007/s10107-011-0484-9 · Cited by 1,414
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Iteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248
Iterative solution of nonlinear equations
Murphy, R. D. (1994) · Journal of Computers in Mathematics and Science Teaching · Cited by 1,192
Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151
Feature Selection via Concave Minimization and Support Vector Machines
Bradley, P. S., & Mangasarian, O. L. (1998) · Cited by 984
One-step sparse estimates in nonconcave penalized likelihood modelsPreprint
Zou, H., & Li, R. (2008) · Cited by 919
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
An, L. T. H., & Tao, P. D. (2005) · Annals of Operations Research · doi:10.1007/s10479-004-5022-1 · Cited by 800
Chambolle, A., De Vore, R. A., Lee, N.-Y., & Lucier, B. J. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661182 · Cited by 751
Multiple-Criteria Decision Making
Yu, P.-L. (1985) · doi:10.1007/978-1-4684-8395-6 · Cited by 692
Use of the zero norm with linear models and kernel methods
Weston, J., Elisseeff, A., Schölkopf, B., & Tipping, M. (2003) · MPG.PuRe (Max Planck Society) · doi:10.5555/944919.944982 · Cited by 688
One-step sparse estimates in nonconcave penalized likelihood models
Zou, H., & Li, R. (2008) · The Annals of Statistics · doi:10.1214/009053607000000802 · Cited by 683
Handbook of Test Problems in Local and Global Optimization
Floudas, C. A., Pardalos, P. M., Adjiman, C. S., Esposito, W. R., Gümüş, Z. H., Harding, S. T., Klepeis, J. L., Meyer, C. A., & Schweiger, C. A. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-3040-1 · Cited by 636
Learning structural SVMs with latent variables
Yu, C.-N. J., & Joachims, T. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553523 · Cited by 610
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
Dinh, T. P., & Thi, H. A. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623494274313 · Cited by 569
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Attouch, H., & Bolte, J. (2007) · Mathematical Programming · doi:10.1007/s10107-007-0133-5 · Cited by 568
On-line Learning and Stochastic Approximations
Bottou, L. (1999) · On-Line Learning in Neural Networks · doi:10.1017/cbo9780511569920.003 · Cited by 564
Convex analysis approach to d.c. programming: Theory, Algorithm and Applications
Dinh, T. P., & Thi, H. A. L. (1997) · HAL · Cited by 515
Minimization of $\ell_{1-2}$ for Compressed Sensing
Yin, P., Lou, Y., He, Q., & Xin, J. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140952363 · Cited by 473
LOQO:an interior point code for quadratic programming
Vanderbei, R. J. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805759 · Cited by 471
Collobert, R., Sinz, F. H., Weston, J., & Bottou, L. (2006) · doi:10.5555/1248547.1248609 · Cited by 466
Hong, M., Razaviyayn, M., Luo, Z.-Q., & Pang, J.-S. (2016) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2481563 · Cited by 447
Recent Developments in Statistics
J., J. E. (1978) · Technometrics · doi:10.1080/00401706.1978.10489661 · Cited by 428
Multi-instance multi-label learning
Zhou, Z.-H., Zhang, M.-L., Huang, S.-J., & Li, Y.-F. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2011.10.002 · Cited by 423
Brève communication. Régularisation d'inéquations variationnelles par approximations successives
Martinet, B. (1970) · Revue française d'informatique et de recherche opérationnelle. Série rouge · doi:10.1051/m2an/197004r301541 · Cited by 422
Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers
Zheng, G., Krikidis, I., Li, J., Petropulu, A. P., & Ottersten, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2269049 · Cited by 384
Robust Truncated Hinge Loss Support Vector Machines
Wu, Y., & Liu, Y. (2007) · Journal of the American Statistical Association · doi:10.1198/016214507000000617 · Cited by 375
VARIABLE SELECTION IN QUANTILE REGRESSION
Wu, Y., & Liu, Y. (2021) · Carolina Digital Repository (University of North Carolina at Chapel Hill) · doi:10.17615/gccn-qy67 · Cited by 358
Successive Convex Approximation: Analysis and Applications
Razaviyayn, M. (2014) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 356
Trading convexity for scalability
Collobert, R., Sinz, F., Weston, J., & Bottou, L. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143870 · Cited by 353
Sparse estimation of a covariance matrix
Bien, J., & Tibshirani, R. J. (2011) · Biometrika · doi:10.1093/biomet/asr054 · Cited by 342
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
Applications of Convex Analysis to Multidimensional Scaling
de Leeuw, J. (2000) · eScholarship (California Digital Library) · Cited by 326
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Scutari, G., Facchinei, F., & Lampariello, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637317 · Cited by 314
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
Incremental proximal methods for large scale convex optimization
Bertsekas, D. P. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0472-0 · Cited by 303
Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms
Thi, H. A. L., & Dinh, T. P. (1997) · Journal of Global Optimization · doi:10.1023/a:1008288411710 · Cited by 292
Gong, P., Zhang, C., Lu, Z., Huang, J. Z., & Ye, J. (2013) · PubMed · doi:10.48550/arxiv.1303.4434 · Cited by 272
Proximal Newton-Type Methods for Minimizing Composite Functions
Lee, J. D., Sun, Y., & Saunders, M. A. (2014) · SIAM Journal on Optimization · doi:10.1137/130921428 · Cited by 268
On-Line Learning in Neural Networks
MTW, & Saad, D. (2000) · Journal of the American Statistical Association · doi:10.2307/2669811 · Cited by 260
On 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
Combined SVM-Based Feature Selection and Classification
Neumann, J., Schnörr, C., & Steidl, G. (2005) · Machine Learning · doi:10.1007/s10994-005-1505-9 · Cited by 248
A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
Lou, Y., Zeng, T., Osher, S., & Xin, J. (2015) · SIAM Journal on Imaging Sciences · doi:10.1137/14098435x · Cited by 235
Calibrating nonconvex penalized regression in ultra-high dimension
Wang, L., Kim, Y., & Li, R. (2013) · The Annals of Statistics · doi:10.1214/13-aos1159 · Cited by 221
DC approximation approaches for sparse optimizationPreprint
Thi, H. A. L., Ana, H., Dinh, T. P., Le, H. M., & Vo, X. T. (2016) · Cited by 209
Exact penalty and error bounds in DC programming
Thi, H. A. L., Dinh, T. P., & Ngai, H. V. (2011) · Journal of Global Optimization · doi:10.1007/s10898-011-9765-3 · Cited by 205
Shen, X., Tseng, G. C., Zhang, X., & Wong, W. H. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503000000639 · Cited by 187
Power allocation in OFDM based NOMA systems: A DC programming approach
Parida, P., & Das, S. S. (2014) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2014.7063568 · Cited by 178
Lou, Y., Yin, P., He, Q., & Xin, J. (2015) · Journal of Scientific Computing · doi:10.1007/s10915-014-9930-1 · Cited by 171
Esser, E., Lou, Y., & Xin, J. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/13090540x · Cited by 165
Joint Beamforming Optimization and Power Control for Full-Duplex MIMO Two-Way Relay Channel
Zheng, G. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2376885 · Cited by 165
Recent Advances in DC Programming and DCA
Pham Dinh, T., & Le Thi, H. A. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54455-2_1 · Cited by 160
Self-citationCALIBRATING NONCONVEX PENALIZED REGRESSION IN ULTRA-HIGH DIMENSION
Wang, L., Kim, Y., & Li, R. (2012) · Cited by 160
Algorithms for Solving a Class of Nonconvex Optimization Problems. Methods of Subgradients
Dinh, T. P., & Souad, E. B. (1986) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)72402-2 · Cited by 152
Feature grouping and selection over an undirected graph
Yang, S., Yuan, L., Lai, Y., Shen, X., Wonka, P., & Ye, J. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339675 · Cited by 150
Liu, Y., & Shen, X. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000781 · Cited by 145
Maximum Margin Clustering Made Practical
Zhang, K., Tsang, I. W.-H., & Kwok, J. T.-Y. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2010620 · Cited by 130
Personalized Dose Finding Using Outcome Weighted Learning
Chen, G., Zeng, D., & Kosorok, M. R. (2016) · Journal of the American Statistical Association · doi:10.1080/01621459.2016.1148611 · Cited by 130
DC Programming and DCA for General DC Programs
Thi, H. A. L., Huynh, V. N., & Dinh, T. P. (2014) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-06569-4_2 · Cited by 123
Mode Switching for Energy-Efficient Device-to-Device Communications in Cellular Networks
Feng, D., Yu, G., Xiong, C., Yuan-Wu, Y., Li, G. Y., Feng, G., & Li, S. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2463280 · Cited by 123
Razaviyayn, M., Sanjabi, M., & Luo, Z.-Q. T. (2016) · Mathematical Programming · doi:10.1007/s10107-016-1021-7 · Cited by 118
Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
Ahn, M., Pang, J., & Xin, J. X. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084754 · Cited by 117
A DC-programming algorithm for kernel selection
Argyriou, A., Hauser, R., Micchelli, C. A., et al. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143850 · Cited by 114
A DC programming approach for feature selection in support vector machines learning
Thi, H. A. L., Le, H. M., Nguyen, V. V., & Dinh, T. P. (2008) · Advances in Data Analysis and Classification · doi:10.1007/s11634-008-0030-7 · Cited by 112
Duality in D.C. (Difference of Convex functions) Optimization. Subgradient Methods
Dinh, T. P., & Souad, E. B. (1988) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9297-1_18 · Cited by 112
Multicategory ψ-Learning and Support Vector Machine: Computational Tools
Liu, Y., Shen, X., & Doss, H. (2005) · Journal of Computational and Graphical Statistics · doi:10.1198/106186005x37238 · Cited by 111
Machine Learning via Polyhedral Concave Minimization
Mangasarian, O. L. (1996) · Physica-Verlag eBooks · doi:10.1007/978-3-642-99789-1_13 · Cited by 110
Proximal Point Methods and Nonconvex Optimization
Kaplan, A., & Tichatschke, R. (1998) · Journal of Global Optimization · doi:10.1023/a:1008321423879 · Cited by 108
Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
Thi, H. A. L., & Dinh, T. P. (2003) · SIAM Journal on Optimization · doi:10.1137/s1052623498342794 · Cited by 108
Variable Selection for Support Vector Machines in Moderately High Dimensions
Zhang, X., Wu, Y., Wang, L., & Li, R. (2015) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/rssb.12100 · Cited by 108
Constructing optimal sparse portfolios using regularization methods
Fastrich, B., Paterlini, S., & Winker, P. (2014) · Computational Management Science · doi:10.1007/s10287-014-0227-5 · Cited by 107
Cluster Analysis: Unsupervised Learning via Supervised Learning with a Non-convex Penalty.
Pan, W., Shen, X., & Liu, B. (2013) · PubMed · Cited by 104
Arora, J. S. (2007) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812779670_0001 · Cited by 101
Scutari, G., Facchinei, F., Lampariello, L., Sardellitti, S., & Song, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637314 · Cited by 99
Ramp loss linear programming support vector machine
Huang, X., Shi, L., & Suykens, J. A. K. (2014) · Journal of Machine Learning Research · doi:10.5555/2627435.2670321 · Cited by 98
Robust principal component analysis via capped norms
Sun, Q., Xiang, S., & Ye, J. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487604 · Cited by 96
Nonconvex Regularizations for Feature Selection in Ranking With Sparse SVM
Laporte, L., Flamary, R., Canu, S., Dejean, S., & Mothe, J. (2013) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2286696 · Cited by 94
Sparse eigen methods by D.C. programming
Sriperumbudur, B. K., Torres, D. A., & Lanckriet, G. R. G. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273601 · Cited by 92
Thi, H. A. L., Le, H. M., & Dinh, T. P. (2014) · Machine Learning · doi:10.1007/s10994-014-5455-y · Cited by 91
Leveraging the margin more carefully
Krause, N., & Singer, Y. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015344 · Cited by 86
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
Thi, H. A. L., Dinh, T. P., & Mưu, L. D. (1996) · Operations Research Letters · doi:10.1016/0167-6377(96)00022-3 · Cited by 85
Smola, A. J., Song, L., & Teo, C. H. (2009) · ANU Open Research (Australian National University) · Cited by 78
Linear Time Maximum Margin Clustering
Wang, F., Zhao, B. L., & Zhang, C. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2036998 · Cited by 77
On transductive support vector machines
Wang, J., Shen, X., & Pan, W. (2007) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/443/08551 · Cited by 77
Simultaneous Grouping Pursuit and Feature Selection Over an Undirected Graph
Zhu, Y., Shen, X., & Pan, W. (2013) · Journal of the American Statistical Association · doi:10.1080/01621459.2013.770704 · Cited by 72
Thi, H. A. L., Vo, X. T., & Dinh, T. P. (2014) · Neural Networks · doi:10.1016/j.neunet.2014.06.011 · Cited by 61
Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
Lou, Y., Osher, S., & Xin, J. X. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-18161-5_15 · Cited by 60
Energy Efficient Secure Communication Over Decode-and-Forward Relay Channels
Wang, D., Bai, B. B., Chen, W., & Han, Z. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2014.2387342 · Cited by 59
New and efficient DCA based algorithms for minimum sum-of-squares clustering
Thi, H. A. L., Le, H. M., & Dinh, T. P. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.07.012 · Cited by 58
Advances in Convex Analysis and Global Optimization
Hadjisavvas, N., & Pardalos, P. M. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0279-7 · Cited by 58
Ramp loss nonparallel support vector machine for pattern classification
Liu, D., Shi, Y., & Tian, Y. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.05.008 · Cited by 57
Enhanced protein fold recognition through a novel data integration approach
Ying, Y., Huang, K., & Campbell, C. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-267 · Cited by 55
Large Margin Semi-supervised Learning
Wang, J., & Shen, X. (2007) · doi:10.5555/1314498.1314561 · Cited by 55
Dinh, T. P., Canh, N. N., & Thi, H. A. L. (2010) · Journal of Global Optimization · doi:10.1007/s10898-009-9507-y · Cited by 54
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem
Thi, H. A. L., Mahdi Moeini, A., Dinh, T. P., & Júdice, J. J. (2010) · Computational Optimization and Applications · doi:10.1007/s10589-010-9388-5 · Cited by 53
Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data
Thi, H. A. L., Huynh, V. N., & Dinh, T. P. (2018) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-018-1345-y · Cited by 53
Point Source Super-resolution Via Non-convex $$L_1$$ Based Methods
Lou, Y., Yin, P., & Xin, J. X. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-016-0169-x · Cited by 52
On Efficient Large Margin Semisupervised Learning: Method and Theory.
Wang, J., Shen, X., & Pan, W. (2009) · PubMed · doi:10.5555/1577069.1577094 · Cited by 46
From Local to Global Optimization
Migdalas, A., Pardalos, P. M., & Värbrand, P. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-5284-7 · Cited by 45
Dictionary Learning for Fast Classification Based on Soft-thresholding
Fawzi, A., Davies, M. E., & Frossard, P. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-014-0784-7 · Cited by 45
Ramp loss least squares support vector machine
Liu, D., Shi, Y., Tian, Y., & Huang, X. (2016) · Journal of Computational Science · doi:10.1016/j.jocs.2016.02.001 · Cited by 45
Network‐Based Penalized Regression With Application to Genomic Data
Kim, S. K., Pan, W., & Shen, X. (2013) · Biometrics · doi:10.1111/biom.12035 · Cited by 42
Thi, H. A. L., Dinh, T. P., & Mưu, L. D. (1998) · Journal of Combinatorial Optimization · doi:10.1023/a:1009777410170 · Cited by 40
DC Proximal Newton for Nonconvex Optimization Problems
Rakotomamonjy, A., Flamary, R., & Gasso, G. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2418224 · Cited by 39
Thi, H. A. L., Dinh, T. P., & Thoai, N. V. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00301-0 · Cited by 39
Simultaneous supervised clustering and feature selection over a graph
Shen, X., Huang, H., & Pan, W. (2012) · Biometrika · doi:10.1093/biomet/ass038 · Cited by 39
Thi, H. A. L. (2003) · Journal of Global Optimization · doi:10.1023/a:1026016804633 · Cited by 35
Robust Support Vector Regression with Generalized Loss Function and Applications
Wang, K., Zhu, W., & Zhong, P. (2013) · Neural Processing Letters · doi:10.1007/s11063-013-9336-3 · Cited by 34
Dinh, T. P., Thi, H. A. L., & Akoa, F. B. (2008) · Optimization methods & software · doi:10.1080/10556780802263990 · Cited by 34
DC programming approach for portfolio optimization under step increasing transaction costs
Thi, H. A. L., Mahdi Moeini, A., & Dinh, T. P. (2009) · Optimization · doi:10.1080/02331930902741721 · Cited by 34
Variational Multiplicative Noise Removal by DC Programming
Li, Z., Lou, Y., & Zeng, T. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-016-0175-z · Cited by 31
Robust investment strategies with discrete asset choice constraints using DC programming
Gülpınar, N., Thi, H. A. L., & Mahdi Moeini, A. (2010) · Optimization · doi:10.1080/02331930903500274 · Cited by 29
A continuous approach for the concave cost supply problem via DC programming and DCA
Thi, H. A. L., & Dinh, T. P. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.03.024 · Cited by 27
DC programming techniques for solving a class of nonlinear bilevel programs
Thi, H. A. L., Dinh, T. P., Canh, N. N., & Thoai, N. V. (2008) · Journal of Global Optimization · doi:10.1007/s10898-008-9325-7 · Cited by 27
Batch and online learning algorithms for nonconvex neyman-pearson classification
Gasso, G., Pappaioannou, A., Spivak, M., & Bottou, L. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961200 · Cited by 26
Combining DC-programming and steepest-descent to solve the single-vehicle inventory routing problem
Zhong, Y., & Aghezzaf, E. (2011) · Computers & Industrial Engineering · doi:10.1016/j.cie.2011.02.006 · Cited by 24
A DC Programming Approach for Finding Communities in Networks
Thi, H. A. L., Nguyen, M. C., & Dinh, T. P. (2014) · Neural Computation · doi:10.1162/neco_a_00673 · Cited by 23
A sparse logistic regression framework by difference of convex functions programming
Yang, L., & Qian, Y. (2016) · Applied Intelligence · doi:10.1007/s10489-016-0758-2 · Cited by 23
Pang, J., & Tao, M. (2018) · SIAM Journal on Optimization · doi:10.1137/17m1110249 · Cited by 23
D.C. Programming Approach to the Multidimensional Scaling Problem
Thi, H. A. L., & Dinh, T. P. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-5284-7_11 · Cited by 22
A DC Programming Approach for Sparse Eigenvalue Problem
Thiao, M., Dinh, T. P., & Thi, H. A. L. (2010) · Cited by 21
Optimal Fronthaul Quantization for Cloud Radio Positioning
Jeong, S., Simeone, O., Haimovich, A. M., & Kang, J. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2431491 · Cited by 17
Efficient approaches for ℓ 2-ℓ 0 regularization and applications to feature selection in SVM
Thi, H. A. L., Dinh, T. P., & Thiao, M. (2016) · Applied Intelligence · doi:10.1007/s10489-016-0778-y · Cited by 17
Large-scale nonconvex stochastic optimization by Doubly Stochastic Successive Convex approximation
Mokhtari, A., Koppel, A., Scutari, G., & Ribeiro, A. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7953048 · Cited by 16
Thi, H. A. L., & Dinh, T. P. (2000) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3218-4_18 · Cited by 15
Convex-concave procedure for weighted sum-rate maximization in a MIMO interference network
You, S., Chen, L., & Liu, Y. (2014) · Globecom · doi:10.1109/glocom.2014.7037443 · Cited by 14
Ellipsoidal Multiple Instance Learning
Krummenacher, G., Ong, C. S., & Buhmann, J. M. (2013) · International Conference on Machine Learning · Cited by 14
Akoa, F. B. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2003299 · Cited by 14
DC Approximation Approach for ℓ0-minimization in Compressed Sensing
Nguyen, T. B. T., Thi, H. A. L., Le, H. M., & Vo, X. T. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-17996-4_4 · Cited by 9
A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography
Le, H. M., Thi, H. A. L., Dinh, T. P., & Bouvry, P. (2009) · Journal of Global Optimization · doi:10.1007/s10898-009-9481-4 · Cited by 8
Online DC Optimization for Online Binary Linear Classification
Ho, V. T., Thi, H. A. L., & Chien, B. D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49390-8_64 · Cited by 8
Discrete Tomography by Continuous Multilabeling Subject to Projection Constraints
Zisler, M., Petra, S., Schnörr, C., & Schnörr, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45886-1_21 · Cited by 7
Learning with sparsity and uncertainty by Difference of Convex functions optimization
Vo, X. T. (2015) · theses.fr (ABES) · doi:10.70675/f0108d4ezd598z4716z8007zae297eab2c17 · Cited by 7
DC Programming and DCA for Large-Scale Two-Dimensional Packing Problems
Ndiaye, B. M., Thi, H. A. L., Dinh, T. P., & Niu, Y.-S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28490-8_34 · Cited by 6
A doubly sparse approach for group variable selection
Kwon, S., Ahn, J., Jang, W., Lee, S., & Kim, Y. (2016) · Annals of the Institute of Statistical Mathematics · doi:10.1007/s10463-016-0571-z · Cited by 4
Signal and image approximation with level-set constraints
Schnörr, C. (2007) · Computing · doi:10.1007/s00607-007-0246-y · Cited by 3
Linear Feature Transform and Enhancement of Classification on Deep Neural Network
Yin, P., Xin, J. X., & Qi, Y. (2018) · Journal of Scientific Computing · doi:10.1007/s10915-018-0666-1 · Cited by 3
Advanced machine learning techniques based on DC programming and DCA
Ho, V. T. (2017) · theses.fr (ABES) · doi:10.70675/29714118zcf60z4e45za6bfzfe9403cbf302 · Cited by 1
Cited by
Data Shuffling in Wireless Distributed Computing via Low-Rank Optimization
Yang, K., Shi, Y., & Ding, Z. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2912139 · Cited by 43
“Due to the nonconvex DC objective function, the majorization-minimization (MM) algorithm [11], [12] can be adopted to iteratively solve a convex subproblem by linearizing ||| X ||| k as Tr ( ∂ ||| X t ||| H k X ) , i.e., by solving minimize in the ( t + 1) -th iteration.”
BackgroundMethod
Metadata
- Authors
- Le Thi, H. A., & Pham Dinh, T.
- Venue
- Mathematical Programming
- Published
- 2018-01-24
- Volume
- 169
- Issue
- 1
- Pages
- 5-68
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2784638391
- Cited by
- 348
- References
- 155
- FWCI
- 29.71
- 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.