{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:06:12Z","timestamp":1775541972959,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642158216","type":"print"},{"value":"9783642158223","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15822-3_10","type":"book-chapter","created":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T11:21:34Z","timestamp":1281612094000},"page":"82-87","source":"Crossref","is-referenced-by-count":7,"title":["A Common Framework for the Convergence of the GSK, MDM and SMO Algorithms"],"prefix":"10.1007","author":[{"given":"Jorge","family":"L\u00f3pez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 R.","family":"Dorronsoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0304007","volume":"4","author":"E.G. Gilbert","year":"1966","unstructured":"Gilbert, E.G.: Minimizing the Quadratic Form on a Convex Set. SIAM J. Contr.\u00a04, 61\u201379 (1966)","journal-title":"SIAM J. Contr."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/0312003","volume":"12","author":"B.F. Mitchell","year":"1974","unstructured":"Mitchell, B.F., Dem\u2019yanov, V.F., Malozemov, V.N.: Finding the Point of a Polyhedron Closest to the Origin. SIAM J. Contr.\u00a012, 19\u201326 (1974)","journal-title":"SIAM J. Contr."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0031-3203(03)00060-8","volume":"36","author":"V. Franc","year":"2003","unstructured":"Franc, V., Hlav\u0103c, V.: An Iterative Algorithm Learning the Maximal Margin Classifier. Pattern Recognition\u00a036, 1985\u20131996 (2003)","journal-title":"Pattern Recognition"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/72.822516","volume":"11","author":"S.S. Keerthi","year":"2000","unstructured":"Keerthi, S.S., Shevade, S.K., Bhattacharyya, C., Murthy, K.R.K.: A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design. IEEE Transactions on Neural Networks\u00a011(1), 124\u2013136 (2000)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"C.-J. Lin","year":"2001","unstructured":"Lin, C.-J.: On the Convergence of the Decomposition Method for Support Vector Machines. IEEE Transactions on Neural Networks\u00a012(6), 1288\u20131298 (2001)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1007\/978-3-642-04274-4_93","volume-title":"Artificial Neural Networks \u2013 ICANN 2009","author":"J. L\u00f3pez","year":"2009","unstructured":"L\u00f3pez, J., Dorronsoro, J.R.: A Simple Proof of the Convergence of the SMO Algorithm for Linearly Separable Problems. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009, Part I. LNCS, vol.\u00a05768, pp. 904\u2013912. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks \u2013 ICANN 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15822-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:56Z","timestamp":1606185656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15822-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158216","9783642158223"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15822-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}