{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:16:56Z","timestamp":1757618216378,"version":"3.44.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/13039\/501100001809","name":"FONDECYT","doi-asserted-by":"publisher","award":["1201403","1251860","1230694"],"award-info":[{"award-number":["1201403","1251860","1230694"]}],"id":[{"id":"10.13039\/13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/13039\/501100001809","name":"STIC AM SUD","doi-asserted-by":"publisher","award":["22-STIC-09","22-STIC-09","22-STIC-09"],"award-info":[{"award-number":["22-STIC-09","22-STIC-09","22-STIC-09"]}],"id":[{"id":"10.13039\/13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/13039\/501100001809","name":"Millennium Nucleus For Applied Control And Inverse Problems","doi-asserted-by":"publisher","award":["NCN19-161"],"award-info":[{"award-number":["NCN19-161"]}],"id":[{"id":"10.13039\/13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40314-025-03267-y","type":"journal-article","created":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T02:29:15Z","timestamp":1748658555000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FDIPA-SOC: A MATLAB Package for Nonlinear Second-Order Cone Programs"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0786-2418","authenticated-orcid":false,"given":"Alfredo","family":"Canelas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2937-6039","authenticated-orcid":false,"given":"Miguel","family":"Carrasco","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9138-5302","authenticated-orcid":false,"given":"Julio","family":"L\u00f3pez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1769-0055","authenticated-orcid":false,"given":"Esteban","family":"Paduro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,31]]},"reference":[{"issue":"2\u20133","key":"3267_CR1","first-page":"255","volume":"17","author":"J Alcal\u00e1-Fdez","year":"2011","unstructured":"Alcal\u00e1-Fdez J, Fern\u00e1ndez A, Luengo J, Derrac J, Garc\u00eda S, S\u00e1nchez L, Herrera F (2011) Keel data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework. J Mult-Valued Log Soft Comput 17(2\u20133):255\u2013287","journal-title":"J Mult-Valued Log Soft Comput"},{"issue":"1, Ser. B","key":"3267_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh F, Goldfarb D (2003) Second-order cone programming. Math progr 95(1, Ser. B):3\u201351","journal-title":"Math progr"},{"issue":"6","key":"3267_CR3","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1080\/10556780903483356","volume":"25","author":"F Alvarez","year":"2010","unstructured":"Alvarez F, L\u00f3pez J, Ram\u00edrez CH (2010) Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines. Optim Methods Softw 25(6):859\u2013881","journal-title":"Optim Methods Softw"},{"issue":"2","key":"3267_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"ED Andersen","year":"2003","unstructured":"Andersen ED, Roos C, Terlaky T (2003) On implementing a primal-dual interior-point method for conic quadratic optimization. Math progr 95(2):249\u2013277","journal-title":"Math progr"},{"key":"3267_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-023-02338-6","volume":"200","author":"R Andreani","year":"2023","unstructured":"Andreani R, Fukuda EH, Haeser G, Santos DO, Secchin LD (2023) Optimality conditions for nonlinear second-order cone programming and symmetric cone programming. J Optim Theory Appl 200:1\u201333","journal-title":"J Optim Theory Appl"},{"key":"3267_CR6","volume-title":"Practical Optimization: Algorithms and Engineering Applications","author":"A Antoniou","year":"2007","unstructured":"Antoniou A, Lu W-S (2007) Practical Optimization: Algorithms and Engineering Applications, 1st edn. Springer, Canada","edition":"1"},{"key":"3267_CR7","unstructured":"Bache K, Lichman M (2013) UCI Machine Learning Repository. Avaliable at http:\/\/archive.ics.uci.edu\/ml"},{"issue":"3","key":"3267_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2001) Algorithm 813: SPG\u2013Software for Convex-Constrained Optimization. ACM Transactions on Mathematical Software 27(3):340\u2013349. https:\/\/doi.org\/10.1145\/502800.502803","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"6","key":"3267_CR9","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1080\/10556788.2018.1506452","volume":"34","author":"A Canelas","year":"2019","unstructured":"Canelas A, Carrasco M, L\u00f3pez J (2019) A feasible direction algorithm for nonlinear second-order cone programs. Optim Methods Soft 34(6):1322\u20131341","journal-title":"Optim Methods Soft"},{"key":"3267_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-4077-2","volume-title":"SOC Functions and Their Applications","author":"J-S Chen","year":"2019","unstructured":"Chen J-S (2019) SOC Functions and Their Applications. Springer Optimization and Its Applications. Springer, Taiwan"},{"key":"3267_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022627411411","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20:273\u2013297","journal-title":"Mach Learn"},{"key":"3267_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13278-0_14","volume-title":"Advances in Neural Networks - ISNN 2010","author":"L Fang","year":"2010","unstructured":"Fang L, He G, Feng Z, Wang Y (2010) A large-update primal-dual interior-point method for second-order cone programming. In: Zhang L, Lu B-L, Kwok J (eds) Advances in Neural Networks - ISNN 2010. Springer, Berlin, Heidelberg, pp 102\u2013109"},{"key":"3267_CR13","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones Oxford Mathematical Monographs","author":"J Faraut","year":"1994","unstructured":"Faraut J, Kor\u00e1nyi A (1994) Analysis on Symmetric Cones Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, p 382"},{"issue":"3","key":"3267_CR14","first-page":"427","volume":"31","author":"J Felipe","year":"2005","unstructured":"Felipe J, Adams FG (2005) A theory of production the estimation of the cobb-douglas function: a retrospective view. East Econ J 31(3):427\u2013445","journal-title":"East Econ J"},{"issue":"2","key":"3267_CR15","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1137\/S1052623400380365","volume":"12","author":"M Fukushima","year":"2002","unstructured":"Fukushima M, Luo ZQ, Tseng P (2002) Smoothing functions for second-order-cone complementarity problems. SIAM J Optim 12(2):436\u2013460","journal-title":"SIAM J Optim"},{"key":"3267_CR16","unstructured":"Grant M, Boyd S (2014) CVX: Matlab Software for Disciplined Convex Programming, version 2.2. http:\/\/cvxr.com\/cvx"},{"issue":"2","key":"3267_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/S1052623403421516","volume":"15","author":"S Hayashi","year":"2005","unstructured":"Hayashi S, Yamashita N, Fukushima M (2005) A combined smoothing and regularization method for monotone second-order cone complementarity problems. SIAM J Optim 15(2):593\u2013615","journal-title":"SIAM J Optim"},{"issue":"1","key":"3267_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1021752227797","volume":"99","author":"J Herskovits","year":"1998","unstructured":"Herskovits J (1998) Feasible direction interior-point technique for nonlinear optimization. J Optim Theory Appl 99(1):121\u2013146","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"3267_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/060657662","volume":"20","author":"C Kanzow","year":"2009","unstructured":"Kanzow C, Ferenczi I, Fukushima M (2009) On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity. SIAM J Optim 20(1):297\u2013320","journal-title":"SIAM J Optim"},{"issue":"2","key":"3267_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11590-006-0009-2","volume":"1","author":"H Kato","year":"2007","unstructured":"Kato H, Fukushima M (2007) An SQP-type algorithm for nonlinear second-order cone programs. Optim Lett 1(2):129\u2013144","journal-title":"Optim Lett"},{"key":"3267_CR21","first-page":"555","volume":"3","author":"G Lanckriet","year":"2003","unstructured":"Lanckriet G, Ghaoui LE, Bhattacharyya C, Jordan M (2003) A robust minimax approach to classification. J Mach Learn Res 3:555\u2013582","journal-title":"J Mach Learn Res"},{"issue":"1\u20133","key":"3267_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo MS, Vandenberghe L, Boyd S, Lebret H (1998) Applications of second-order cone programming. Linear Algebra Appl 284(1\u20133):193\u2013228","journal-title":"Linear Algebra Appl"},{"key":"3267_CR23","first-page":"491","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2003","unstructured":"Luenberger DG (2003) Linear and Nonlinear Programming, 2nd edn. Kluwer Academic Publishers, Boston, MA, p 491","edition":"2"},{"key":"3267_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.knosys.2019.04.016","volume":"177","author":"S Maldonado","year":"2019","unstructured":"Maldonado S, Carrasco M, L\u00f3pez J (2019) Regularized minimax probability machine. Knowl-Based Syst 177:127\u2013135","journal-title":"Knowl-Based Syst"},{"key":"3267_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.108701","volume":"128","author":"S Maldonado","year":"2022","unstructured":"Maldonado S, L\u00f3pez J, Carrasco M (2022) The cobb-douglas learning machine. Pattern Recognit 128:108701","journal-title":"Pattern Recognit"},{"key":"3267_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ins.2013.10.017","volume":"268","author":"X Miao","year":"2014","unstructured":"Miao X, Chen JS, Ko CH (2014) A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints. Inf Scien 268:255\u2013270","journal-title":"Inf Scien"},{"issue":"1, Ser. A","key":"3267_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00011378","volume":"88","author":"RDC Monteiro","year":"2000","unstructured":"Monteiro RDC, Tsuchiya T (2000) Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Math progr 88(1, Ser. A):61\u201383","journal-title":"Math progr"},{"key":"3267_CR28","doi-asserted-by":"crossref","unstructured":"Nath JS, Bhattacharyya C (2007) Maximum margin classifiers with specified false positive and false negative error rates. In: Proceedings of the Seventh SIAM International Conference on Data Mining, Minneapolis, Minnesota, pp. 26\u201328","DOI":"10.1137\/1.9781611972771.4"},{"key":"3267_CR29","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics, Philadelphia, PA, p 405"},{"issue":"3","key":"3267_CR30","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue B, Chu E, Parikh N, Boyd S (2016) Conic optimization via operator splitting and homogeneous self-dual embedding. J Optim Theory Appl 169(3):1042\u20131068","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"3267_CR31","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1137\/070685683","volume":"19","author":"S Pan","year":"2008","unstructured":"Pan S, Chen JS (2008) A class of interior proximal-like algorithms for convex second-order cone programming. SIAM J Optim 19(2):883\u2013910","journal-title":"SIAM J Optim"},{"key":"3267_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10957-008-9380-8","volume":"138","author":"S Pan","year":"2008","unstructured":"Pan S, Chen JS (2008) Proximal-like algorithm using the quasi d-function for convex second-order cone programming. J Optim Theory Appl 138:95\u2013113","journal-title":"J Optim Theory Appl"},{"issue":"1\u20134","key":"3267_CR33","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw 11(1\u20134):625\u2013653","journal-title":"Optim Methods Softw"},{"issue":"1\u20134","key":"3267_CR34","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10556789908805750","volume":"11","author":"T Tsuchiya","year":"1999","unstructured":"Tsuchiya T (1999) A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Optim Methods Softw 11(1\u20134):141\u2013182","journal-title":"Optim Methods Softw"},{"key":"3267_CR35","volume-title":"Statistical Learning Theory","author":"V Vapnik","year":"1998","unstructured":"Vapnik V (1998) Statistical Learning Theory. John Wiley and Sons, NY, USA"},{"issue":"3","key":"3267_CR36","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1080\/10556780902752447","volume":"24","author":"H Yamashita","year":"2009","unstructured":"Yamashita H, Yabe H (2009) A primal-dual interior point method for nonlinear optimization over second-order cones. Optim Methods Softw 24(3):407\u2013426","journal-title":"Optim Methods Softw"},{"issue":"1","key":"3267_CR37","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10440-020-00334-w","volume":"170","author":"Q Zhao","year":"2020","unstructured":"Zhao Q, Chen Z (2020) A line search penalty-free method for nonlinear second-order cone programming. Acta Appl Math 170(1):291\u2013317","journal-title":"Acta Appl Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03267-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03267-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03267-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T16:31:11Z","timestamp":1757176271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03267-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,31]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3267"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03267-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,5,31]]},"assertion":[{"value":"14 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have influenced the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}],"article-number":"305"}}