{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:51:53Z","timestamp":1787496713742,"version":"build-2736575974"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T00:00:00Z","timestamp":1190160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2007,10,3]]},"DOI":"10.1007\/s10994-007-5022-x","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T12:22:28Z","timestamp":1190118148000},"page":"1-33","source":"Crossref","is-referenced-by-count":28,"title":["Surrogate maximization\/minimization algorithms and extensions"],"prefix":"10.1007","volume":"69","author":[{"given":"Zhihua","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James T.","family":"Kwok","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dit-Yan","family":"Yeung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,9,19]]},"reference":[{"key":"5022_CR1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1177\/096228029700600104","volume":"6","author":"M. P. Becker","year":"1997","unstructured":"Becker, M. P., Yang, I., & Lange, K. (1997). EM algorithms without missing data. Statistical Methods in Medical Research, 6, 38\u201354.","journal-title":"Statistical Methods in Medical Research"},{"issue":"4","key":"5022_CR2","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/BF00049423","volume":"40","author":"D. B\u00f6hning","year":"1988","unstructured":"B\u00f6hning, D., & Lindsay, B. G. (1988). Monotonicity of quadratic-approximation algorithms. Annals of the Institute of Statistical Mathematics, 40(4), 641\u2013663.","journal-title":"Annals of the Institute of Statistical Mathematics"},{"key":"5022_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2711-1","volume-title":"Modern multidimensional scaling","author":"I. Borg","year":"1997","unstructured":"Borg, I., & Groenen, P. (1997). Modern multidimensional scaling. New York: Springer."},{"key":"5022_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"issue":"2\u20133","key":"5022_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"47","author":"M. Collins","year":"2002","unstructured":"Collins, M., Schapire, R. E., & Singer, Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 47(2\u20133), 253\u2013285.","journal-title":"Machine Learning"},{"key":"5022_CR6","unstructured":"Craven, M., Dopasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., & Slattery, S. (1998). Learning to extract symbolic knowledge from the World Web Wide. In The fifteenth national conference on artificial intelligence."},{"issue":"5","key":"5022_CR7","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1214\/aoms\/1177692379","volume":"43","author":"J. N. Darroch","year":"1972","unstructured":"Darroch, J. N., & Ratcliff, D. (1972). Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43(5), 1470\u20131480.","journal-title":"The Annals of Mathematical Statistics"},{"key":"5022_CR8","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-642-46808-7_28","volume-title":"Information systems and data analysis","author":"J. Leeuw De","year":"1994","unstructured":"De Leeuw, J. (1994). Block relaxation algorithms in statistics. In H. H. Bock, W. Lenski, & M. M. Richter (Eds.), Information systems and data analysis (pp. 308\u2013325). Berlin: Springer."},{"issue":"4","key":"5022_CR9","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/34.588021","volume":"19","author":"S. Pietra Della","year":"1997","unstructured":"Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997). Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4), 380\u2013393.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5022_CR10","unstructured":"Della Pietra, S., Della Pietra, V., & Lafferty, J. (2001). Duality and auxiliary functions for Bregman distances (Technical Report CMU-CS-01-109), School of Computer Science, CMU."},{"issue":"1","key":"5022_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. P. Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B, 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society Series B"},{"issue":"1","key":"5022_CR12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/42.370409","volume":"14","author":"A. R. Pierro De","year":"1995","unstructured":"De Pierro, A. R. (1995). A modified expectation maximization algorithm for penalized likelihood estimation in emission tomography. IEEE Transactions on Medical Imaging, 14(1), 132\u2013137.","journal-title":"IEEE Transactions on Medical Imaging"},{"issue":"4","key":"5022_CR13","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1093\/biomet\/88.4.961","volume":"88","author":"D. Edwards","year":"2001","unstructured":"Edwards, D., & Lauritzen, S. L. (2001). The TM for maximising a conditional likelihood function. Biometrika, 88(4), 961\u2013972.","journal-title":"Biometrika"},{"key":"5022_CR14","volume-title":"Practical methods of optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R. (1987). Practical methods of optimization (2nd ed.). New York: Wiley.","edition":"2"},{"issue":"1","key":"5022_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"5022_CR16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J. H. Friedman","year":"2000","unstructured":"Friedman, J. H., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: a statistical view of boosting. Annals of Statistics, 28(2), 337\u2013374.","journal-title":"Annals of Statistics"},{"key":"5022_CR17","unstructured":"Jaakkola, T., & Jordan, M. (1997). A variational approach to Bayesian logistic regression models and their extensions. In The sixth international workshop on artificial intelligence and statistics."},{"key":"5022_CR18","unstructured":"Jebara, T., & Pentland, A. (1999). Maximum conditional likelihood via bound maximization and the CEM algorithm. In Advances in neural information processing systems (Vol.\u00a011)."},{"key":"5022_CR19","first-page":"143","volume-title":"The fourteenth international conference on machine learning","author":"T. Joachims","year":"1997","unstructured":"Joachims, T. (1997). A probabilistic analysis of the Rocchio algorithm with TFIDF for text categorization. In The fourteenth international conference on machine learning (pp. 143\u2013151). San Francisco: Kaufmann."},{"key":"5022_CR20","unstructured":"Kivinen, J., & Warmuth, M. K. (1997). Boosting as entropy projection. In The twelfth annual conference on computational learning theory (pp. 134\u2013144)."},{"key":"5022_CR21","doi-asserted-by":"crossref","unstructured":"Lafferty, J. (1999). Additive models, boosting and inference for generalized divergences. In The twelfth annual conference on computational learning theory (pp.\u00a0125\u2013133).","DOI":"10.1145\/307400.307422"},{"issue":"2","key":"5022_CR22","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1111\/j.2517-6161.1995.tb02037.x","volume":"57","author":"K. Lange","year":"1995","unstructured":"Lange, K. (1995). A gradient algorithm locally equivalent to the EM algorithm. Journal of the Royal Statistical Society Series B, 57(2), 425\u2013437.","journal-title":"Journal of the Royal Statistical Society Series B"},{"issue":"1","key":"5022_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"K. Lange","year":"2000","unstructured":"Lange, K., Hunter, D. R., & Yang, I. (2000). Optimization transfer using surrogate objective functions with discussion. Journal of Computational and Graphical Statistics, 9(1), 1\u201359.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"5022_CR24","unstructured":"Lebanon, G., & Lafferty, J. (2001). Boosting and maximum likelihood for exponential models (Technical Report CMU-CS-01-144), School of Computer Science, Carnegie Mellon University."},{"issue":"4","key":"5022_CR25","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1093\/biomet\/81.4.633","volume":"84","author":"C. Liu","year":"1994","unstructured":"Liu, C., & Rubin, D. B. (1994). The ECME algorithm: a simple extension of EM and ECM with faster monotone convergence. Bionmetrika, 84(4), 633\u2013648.","journal-title":"Bionmetrika"},{"issue":"1","key":"5022_CR26","first-page":"35","volume":"9","author":"X.-L. Meng","year":"2000","unstructured":"Meng, X.-L. (2000). Discussion on \u201coptimization transfer using surrogate objective functions\u201d. Journal of Computational and Graphical Statistics, 9(1), 35\u201343.","journal-title":"Journal of Computational and Graphical Statistics"},{"issue":"2","key":"5022_CR27","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1093\/biomet\/80.2.267","volume":"80","author":"X.-L. Meng","year":"1993","unstructured":"Meng, X.-L., & Rubin, D. B. (1993). Maximum likelihood estimation via the ECM algorithm: a general framework. Bionmetrika, 80(2), 267\u2013278.","journal-title":"Bionmetrika"},{"key":"5022_CR28","unstructured":"Minka, T. P. (2003). A comparison of numerical optimizers for logistic regression (Technical report). Available from http:\/\/www.stat.cmu.edu\/~minka\/papers\/logreg\/ ."},{"key":"5022_CR29","volume-title":"Solution of equations and systems of equations","author":"A. M. Ostrowski","year":"1960","unstructured":"Ostrowski, A. M. (1960). Solution of equations and systems of equations. New York: Academic Press."},{"key":"5022_CR30","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"T. Rockafellar","year":"1970","unstructured":"Rockafellar, T. (1970). Convex analysis. Princeton: Princeton University Press."},{"key":"5022_CR31","unstructured":"Salakhutdinov, R., & Roweis, S. (2003). Adaptive overrelazed bound optimization methods. In The 20th international conference on machine learning."},{"key":"5022_CR32","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5, 197\u2013227.","journal-title":"Machine Learning"},{"key":"5022_CR33","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. E. Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37, 297\u2013336.","journal-title":"Machine Learning"},{"key":"5022_CR34","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1214\/aos\/1176346060","volume":"11","author":"C. F. J. Wu","year":"1983","unstructured":"Wu, C. F. J. (1983). On the convergence properties of the EM algorithm. Annals of Statistics, 11, 95\u2013103.","journal-title":"Annals of Statistics"},{"key":"5022_CR35","unstructured":"Yuille, A., & Rangarajan, A. (2001). The convex-concave computational procedure (CCCP). In Advances in neural information processing systems (Vol.\u00a013)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5022-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-007-5022-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5022-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T21:23:38Z","timestamp":1737408218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-007-5022-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,19]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,10,3]]}},"alternative-id":["5022"],"URL":"https:\/\/doi.org\/10.1007\/s10994-007-5022-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,19]]}}}