{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:56Z","timestamp":1740122756577,"version":"3.37.3"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10589-019-00151-4","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T17:10:07Z","timestamp":1572973807000},"page":"321-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs"],"prefix":"10.1007","volume":"75","author":[{"given":"Enrico","family":"Bettiol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"L\u00e9tocart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8978-6027","authenticated-orcid":false,"given":"Francesco","family":"Rinaldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emiliano","family":"Traversi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"key":"151_CR1","unstructured":"Beasley, J.E.: Portfolio optimization data. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files\/ (2016)"},{"key":"151_CR2","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"issue":"1","key":"151_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/090772204","volume":"21","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P., Yu, H.: A unifying polyhedral approximation framework for convex optimization. SIAM J. Optim. 21(1), 333\u2013360 (2011)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"151_CR4","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"151_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"151_CR6","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1287\/ijoc.2017.0789","volume":"30","author":"C Buchheim","year":"2018","unstructured":"Buchheim, C., Traversi, E.: Quadratic combinatorial optimization using separable underestimators. INFORMS J. Comput. 30(3), 424\u2013437 (2018)","journal-title":"INFORMS J. Comput."},{"key":"151_CR7","unstructured":"Cesarone, F., Tardella, F.: Portfolio datasets. http:\/\/host.uniroma3.it\/docenti\/cesarone\/datasetsw3_tardella.html (2010)"},{"issue":"1","key":"151_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"1","key":"151_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63\u201386 (1998)","journal-title":"J. Heuristics"},{"issue":"4","key":"151_CR10","first-page":"63","volume":"6","author":"KL Clarkson","year":"2010","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms (TALG) 6(4), 63 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"151_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat, L.: Fast projection onto the simplex and the l1-ball. Math. Program. 158(1), 575\u2013585 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"151_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10589-019-00082-0","volume":"73","author":"A Cristofari","year":"2019","unstructured":"Cristofari, A.: An almost cyclic 2-coordinate descent method for singly linearly constrained problems. Comput. Optim. Appl. 73(2), 411\u2013452 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"151_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10957-016-1024-9","volume":"172","author":"A Cristofari","year":"2017","unstructured":"Cristofari, A., De Santis, M., Lucidi, S., Rinaldi, F.: A two-stage active-set algorithm for bound-constrained optimization. J. Optim. Theory Appl. 172(2), 369\u2013401 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"151_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10589-014-9681-9","volume":"60","author":"FE Curtis","year":"2015","unstructured":"Curtis, F.E., Han, Z., Robinson, D.P.: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization. Comput. Optim. Appl. 60(2), 311\u2013341 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"151_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10589-012-9506-7","volume":"53","author":"M De Santis","year":"2012","unstructured":"De Santis, M., Di Pillo, G., Lucidi, S.: An active set feasible method for large-scale minimization problems with bound constraints. Comput. Optim. Appl. 53(2), 395\u2013423 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"151_CR16","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","author":"C Demetrescu","year":"2009","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S.: The Shortest Path Problem: Ninth DIMACS Implementation Challenge, vol. 74. American Mathematical Soc., Providence (2009)"},{"key":"151_CR17","volume-title":"Column Generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation, vol. 5. Springer, Berlin (2006)"},{"issue":"5","key":"151_CR18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0167-6377(88)90041-7","volume":"7","author":"M Djerdjour","year":"1988","unstructured":"Djerdjour, M., Mathur, K., Salkin, H.: A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem. Oper. Res. Lett. 7(5), 253\u2013258 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"151_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"151_CR20","unstructured":"Drake, J.: Benchmark instances for the multidimensional knapsack problem (2015)"},{"issue":"1","key":"151_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01580439","volume":"8","author":"J Elzinga","year":"1975","unstructured":"Elzinga, J., Moore, T.G.: A central cutting plane algorithm for the convex programming problem. Math. Program. 8(1), 134\u2013145 (1975)","journal-title":"Math. Program."},{"issue":"4","key":"151_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12532-014-0071-1","volume":"6","author":"HJ Ferreau","year":"2014","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpoases: a parametric active-set algorithm for quadratic programming. Math. Program. Comput. 6(4), 327\u2013363 (2014)","journal-title":"Math. Program. Comput."},{"key":"151_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2018","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N., Vigerske, S., Wiegele, A.: Qplib: a library of quadratic programming instances. Math. Program. Comput. 11, 237\u2013265 (2018)","journal-title":"Math. Program. Comput."},{"key":"151_CR24","doi-asserted-by":"crossref","unstructured":"Glover, F., Kochenberger, G.: Critical event tabu search for multidimensional knapsack problems. In: Meta-Heuristics, pp. 407\u2013427. Springer (1996)","DOI":"10.1007\/978-1-4613-1361-8_25"},{"key":"151_CR25","doi-asserted-by":"crossref","unstructured":"Glover, F., Kochenberger, G., Alidaee, B., Amini, M.: Solving quadratic knapsack problems by reformulation and tabu search: single constraint case. In: Combinatorial and Global Optimization, pp. 111\u2013121. World Scientific (2002)","DOI":"10.1142\/9789812778215_0008"},{"issue":"1","key":"151_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02614381","volume":"76","author":"JL Goffin","year":"1997","unstructured":"Goffin, J.L., Gondzio, J., Sarkissian, R., Vial, J.P.: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76(1), 131\u2013154 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"151_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF00939559","volume":"65","author":"JL Goffin","year":"1990","unstructured":"Goffin, J.L., Vial, J.P.: Cutting planes and column generation techniques with the projective algorithm. J. Optim. Theory Appl. 65(3), 409\u2013429 (1990)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"151_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01580602","volume":"60","author":"JL Goffin","year":"1993","unstructured":"Goffin, J.L., Vial, J.P.: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Math. Program. 60(1), 81\u201392 (1993)","journal-title":"Math. Program."},{"issue":"3","key":"151_CR29","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"151_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10107-014-0779-8","volume":"152","author":"J Gondzio","year":"2015","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P.: A new warmstarting strategy for the primal-dual column generation method. Math. Program. 152(1\u20132), 113\u2013146 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"151_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ejor.2012.07.024","volume":"224","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: New developments in the primal-dual column generation technique. Eur. J. Oper. Res. 224(1), 41\u201351 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"151_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12532-015-0090-6","volume":"8","author":"J Gondzio","year":"2016","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: Large-scale optimization with the primal\u2013dual column generation method. Math. Program. Comput. 8(1), 47\u201382 (2016)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"151_CR33","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.49.6.879.10015","volume":"49","author":"J Gondzio","year":"2001","unstructured":"Gondzio, J., Kouwenberg, R.: High-performance computing for asset-liability management. Oper. Res. 49(6), 879\u2013891 (2001)","journal-title":"Oper. Res."},{"issue":"1","key":"151_CR34","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/0377-2217(96)00169-5","volume":"94","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J., du Merle, O., Sarkissian, R., Vial, J.P.: Accpm\u2014a library for convex optimization based on an analytic center cutting plane method. Eur. J. Oper. Res. 94(1), 206\u2013211 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"151_CR35","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/S0377-2217(96)00182-8","volume":"101","author":"J Gondzio","year":"1997","unstructured":"Gondzio, J., Sarkissian, R., Vial, J.P.: Using an interior point method for the master problem in a decomposition approach. Eur. J. Oper. Res. 101(3), 577\u2013587 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"151_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1008748810765","volume":"14","author":"J Gondzio","year":"1999","unstructured":"Gondzio, J., Vial, J.P., et al.: Warm start and -subgradients in a cutting plane scheme for block-angular linear programs. Comput. Optim. Appl. 14, 17\u201336 (1999)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"151_CR37","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"151_CR38","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60(3), 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"151_CR39","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/BF01385810","volume":"59","author":"L Grippo","year":"1991","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A class of nonmonotone stabilization methods in unconstrained optimization. Numer. Math. 59(1), 779\u2013805 (1991)","journal-title":"Numer. Math."},{"issue":"2","key":"151_CR40","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006)","journal-title":"SIAM J. Optim."},{"key":"151_CR41","doi-asserted-by":"crossref","unstructured":"Hearn, D.W., Lawphongpanich, S., Ventura, J.A.: Restricted simplicial decomposition: computation and extensions. In: Computation Mathematical Programming, pp. 99\u2013118 (1987)","DOI":"10.1007\/BFb0121181"},{"issue":"1","key":"151_CR42","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"CA Holloway","year":"1974","unstructured":"Holloway, C.A.: An extension of the Frank and Wolfe method of feasible directions. Math. Program. 6(1), 14\u201327 (1974)","journal-title":"Math. Program."},{"key":"151_CR43","unstructured":"IBM: Cplex (version 12.6.3). https:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/ (2015)"},{"key":"151_CR44","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization, vol. 1133. Springer, Berlin (2006)"},{"key":"151_CR45","first-page":"1244","volume":"160","author":"AY Levin","year":"1965","unstructured":"Levin, A.Y.: On an algorithm for the minimization of convex functions. Sov. Math. Dokl. 160, 1244\u20131247 (1965)","journal-title":"Sov. Math. Dokl."},{"issue":"1","key":"151_CR46","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1), 77\u201391 (1952)","journal-title":"J. Finance"},{"issue":"1","key":"151_CR47","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00938486","volume":"50","author":"C Michelot","year":"1986","unstructured":"Michelot, C.: A finite algorithm for finding the projection of a point onto the canonical simplex of $${\\mathbb{R}}^n$$. J. Optim. Theory Appl. 50(1), 195\u2013200 (1986)","journal-title":"J. Optim. Theory Appl."},{"issue":"8","key":"151_CR48","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1016\/j.cor.2013.02.028","volume":"40","author":"P Munari","year":"2013","unstructured":"Munari, P., Gondzio, J.: Using the primal\u2013dual interior point algorithm within the branch-price-and-cut method. Comput. Oper. Res. 40(8), 2026\u20132036 (2013)","journal-title":"Comput. Oper. Res."},{"key":"151_CR49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"issue":"3","key":"151_CR50","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/321281.321291","volume":"12","author":"DJ Newman","year":"1965","unstructured":"Newman, D.J.: Location of the maximum on unimodal surfaces. J. ACM (JACM) 12(3), 395\u2013398 (1965)","journal-title":"J. ACM (JACM)"},{"key":"151_CR51","unstructured":"Nocedal, J., Wright, S.J.: Conjugate gradient methods. In: Numerical Optimization, pp. 101\u2013134 (2006)"},{"key":"151_CR52","volume-title":"Sequential Quadratic Programming","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Sequential Quadratic Programming. Springer, Berlin (2006)"},{"key":"151_CR53","volume-title":"Convex Optimization in Signal Processing and Communications","author":"DP Palomar","year":"2010","unstructured":"Palomar, D.P., Eldar, Y.C.: Convex Optimization in Signal Processing and Communications. Cambridge University Press, Cambridge (2010)"},{"key":"151_CR54","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M Patriksson","year":"2015","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. Courier Dover Publications, Mineola (2015)"},{"issue":"2","key":"151_CR55","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.ejor.2018.01.054","volume":"268","author":"B Rostami","year":"2018","unstructured":"Rostami, B., Chassein, A., Hopf, M., Frey, D., Buchheim, C., Malucelli, F., Goerigk, M.: The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268(2), 473\u2013485 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"151_CR56","doi-asserted-by":"crossref","unstructured":"Rostami, B., Malucelli, F., Frey, D., Buchheim, C.: On the quadratic shortest path problem. In: International Symposium on Experimental Algorithms, pp. 379\u2013390. Springer (2015)","DOI":"10.1007\/978-3-319-20086-6_29"},{"issue":"1","key":"151_CR57","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0377-2217(97)00048-9","volume":"108","author":"SS Syam","year":"1998","unstructured":"Syam, S.S.: A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals. Eur. J. Oper. Res. 108(1), 196\u2013207 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"151_CR58","first-page":"1081","volume":"298","author":"S Tarasov","year":"1988","unstructured":"Tarasov, S., Khachiian, L., Erlikh, I.: The method of inscribed ellipsoids. Dokl. Akad. Nauk SSSR 298(5), 1081\u20131085 (1988)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"1","key":"151_CR59","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"issue":"1","key":"151_CR60","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01581238","volume":"59","author":"JA Ventura","year":"1993","unstructured":"Ventura, J.A., Hearn, D.W.: Restricted simplicial decomposition for convex constrained problems. Math. Program. 59(1), 71\u201385 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"151_CR61","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01584323","volume":"13","author":"B Von Hohenbalken","year":"1977","unstructured":"Von Hohenbalken, B.: Simplicial decomposition in nonlinear programming algorithms. Math. Program. 13(1), 49\u201368 (1977)","journal-title":"Math. Program."},{"key":"151_CR62","unstructured":"WolframAlpha: Mathematica (version 11.3). http:\/\/www.wolfram.com\/mathematica\/ (2018)"},{"issue":"1","key":"151_CR63","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1090\/S0273-0979-04-01040-7","volume":"42","author":"M Wright","year":"2005","unstructured":"Wright, M.: The interior-point revolution in optimization: history, recent developments, and lasting consequences. Bull. Am. Math. Soc. 42(1), 39\u201356 (2005)","journal-title":"Bull. Am. Math. Soc."},{"key":"151_CR64","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal\u2013Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal\u2013Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"151_CR65","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis, vol. 44. Wiley, Hoboken (2011)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00151-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00151-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00151-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T08:54:36Z","timestamp":1721984076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00151-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,5]]},"references-count":65,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00151-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,11,5]]},"assertion":[{"value":"27 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}