{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:50Z","timestamp":1740109310545,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2078"],"award-info":[{"award-number":["N00014-18-1-2078"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-15-1-2171"],"award-info":[{"award-number":["N00014-15-1-2171"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-12-1-0049"],"award-info":[{"award-number":["N00014-12-1-0049"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10107-021-01663-w","type":"journal-article","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T16:02:51Z","timestamp":1624118571000},"page":"937-974","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Status determination by interior-point methods for convex optimization problems in domain-driven form"],"prefix":"10.1007","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0153-0612","authenticated-orcid":false,"given":"Mehdi","family":"Karimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,19]]},"reference":[{"issue":"3","key":"1663_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-002-0334-x","volume":"93","author":"B Alkire","year":"2002","unstructured":"Alkire, B., Vandenberghe, L.: Convex optimization problems involving finite autocorrelation sequences. Math. Program. 93(3), 331\u2013359 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"1663_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Kim, S.-J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Opt. Eng. 8(1), 67\u2013127 (2007)","journal-title":"Opt. Eng."},{"key":"1663_CR3","doi-asserted-by":"crossref","unstructured":"Christiano, P., Kelner, J.\u00a0A., Madry, A., Spielman, D.\u00a0A., Teng, S.-H.: Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 273\u2013282. ACM, (2011)","DOI":"10.1145\/1993636.1993674"},{"key":"1663_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, Michael\u00a0B., Madry, Aleksander, Sankowski, Piotr, Vladu, Adrian.: Negative-weight shortest paths and unit capacity minimum cost flow in $${\\tilde{O}}(m^{10\/7} log \\ W)$$ time. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 752\u2013771. Society for Industrial and Applied Mathematics, 2017","DOI":"10.1137\/1.9781611974782.48"},{"issue":"3","key":"1663_CR5","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10107-005-0667-3","volume":"106","author":"RM Freund","year":"2006","unstructured":"Freund, R.M.: On the behavior of the homogeneous self-dual model for conic convex optimization. Math. Program. 106(3), 527\u2013545 (2006)","journal-title":"Math. Program."},{"key":"1663_CR6","unstructured":"Haeser, G., Hinder, O., Ye, Y.: On the behavior of Lagrange multipliers in convex and non-convex infeasible interior point methods. arXiv preprint arXiv:1707.07327, 2017"},{"key":"1663_CR7","unstructured":"Hinder, O., Ye, Y.: A one-phase interior point method for nonconvex optimization. arXiv preprint arXiv:1801.03072, (2018)"},{"key":"1663_CR8","unstructured":"Karimi, M.: Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods. PhD thesis, University of Waterloo, (2017)"},{"issue":"2","key":"1663_CR9","first-page":"591","volume":"45","author":"M Karimi","year":"2020","unstructured":"Karimi, M., Tun\u00e7el, L.: Primal-dual interior-point methods for Domain-Driven formulations. Math. Op. Res. 45(2), 591\u2013621 (2020)","journal-title":"Math. Op. Res."},{"key":"1663_CR10","unstructured":"Karimi, M., Tun\u00e7el, L.: Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form. http:\/\/www.math.uwaterloo.ca\/~m7karimi\/DDS.html, arXiv preprint arXiv:1908.03075v2, 2020"},{"issue":"1","key":"1663_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61(1), 263\u2013280 (1993)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1663_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 44(1\u20133), 1\u201326 (1989)","journal-title":"Math. Program."},{"key":"1663_CR13","doi-asserted-by":"crossref","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In Progress in Mathematical Programming, pages 29\u201347. Springer, (1989)","DOI":"10.1007\/978-1-4613-9617-8_2"},{"issue":"1","key":"1663_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01581253","volume":"59","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A little theorem of the big-M in interior point algorithms. Math. Program. 59(1), 361\u2013375 (1993)","journal-title":"Math. Program."},{"key":"1663_CR15","unstructured":"Liu, Yanli, Ryu, Ernest\u00a0K., Yin, Wotao.: A new use of Douglas-Rachford splitting and ADMM for identifying infeasible, unbounded, and pathological conic programs. arXiv preprint 1706.02374, 2017"},{"key":"1663_CR16","unstructured":"Luo, Z.-Q., Sturm, J.\u00a0F., Zhang, S.: Duality and self-duality for conic convex programming. Technical report, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute, 1996"},{"issue":"3","key":"1663_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1080\/10556780008805800","volume":"14","author":"Z-Q Luo","year":"2000","unstructured":"Luo, Z.-Q., Sturm, J.F., Zhang, S.: Conic convex programming and self-dual embedding. Opt. Methods Softw. 14(3), 169\u2013218 (2000)","journal-title":"Opt. Methods Softw."},{"key":"1663_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"IJ Lustig","year":"1991","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Computational experience with a primal-dual interior point method for linear programming. Lin. Algebra Appl. 152, 191\u2013222 (1991)","journal-title":"Lin. Algebra Appl."},{"issue":"1\u20133","key":"1663_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"Irvin J Lustig","year":"1990","unstructured":"Lustig, Irvin J.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1\u20133), 145\u2013162 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"1663_CR20","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"KA McShane","year":"1989","unstructured":"McShane, K.A., Monma, C.L., Shanno, D.: An implementation of a primal-dual interior point method for linear programming. ORSA J. Comput. 1(2), 70\u201383 (1989)","journal-title":"ORSA J. Comput."},{"key":"1663_CR21","doi-asserted-by":"crossref","unstructured":"Megiddo. N.: Pathways to the optimal set in linear programming. In Progress in Mathematical Programming, pages 131\u2013158. Springer, (1989)","DOI":"10.1007\/978-1-4613-9617-8_8"},{"issue":"1","key":"1663_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S Mizuno","year":"1994","unstructured":"Mizuno, S.: Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Program. 67(1), 109\u2013119 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"1663_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/0805003","volume":"5","author":"S Mizuno","year":"1995","unstructured":"Mizuno, S., Kojima, M., Todd, M.J.: Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming. SIAM J. Opt. 5(1), 52\u201367 (1995)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"1663_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"RDC Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms. Part I Lin. Program. Math. Program. 44(1), 27\u201341 (1989)","journal-title":"Part I Lin. Program. Math. Program."},{"key":"1663_CR25","unstructured":"Myklebust, T., Tun\u00e7el, L.: Interior-point algorithms for convex optimization based on primal-dual metrics. arXiv preprint arXiv:1411.2129, 2014"},{"key":"1663_CR26","unstructured":"Nemirovski, A.: Interior point polynomial time methods in convex programming. Lecture Notes, 2004"},{"key":"1663_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10107-004-0545-4","volume":"102","author":"A Nemirovski","year":"2005","unstructured":"Nemirovski, A., Tun\u00e7el, L.: Cone-free primal-dual path-following and potential reduction polynomial time interior-point methods. Math. Program. 102, 261\u2013294 (2005)","journal-title":"Math. Program."},{"key":"1663_CR28","unstructured":"Nesterov, Y.: Infeasible-start interior-point primal-dual methods in nonlinear programming. Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE), (1995067), 1995"},{"key":"1663_CR29","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1080\/10556788.2011.567270","volume":"27","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Towards non-symmetric conic optimization. Opt. Methods Softw. 27, 893\u2013917 (2012)","journal-title":"Opt. Methods Softw."},{"key":"1663_CR30","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer (2018)","DOI":"10.1007\/978-3-319-91578-4"},{"key":"1663_CR31","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., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM Series in Applied Mathematics, SIAM, Philadelphia (1994)"},{"key":"1663_CR32","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10107980009a","volume":"84","author":"Y Nesterov","year":"1999","unstructured":"Nesterov, Y., Todd, M.J., Ye, Y.: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84, 227\u2013267 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"1663_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcom.1994.1001","volume":"10","author":"J Renegar","year":"1994","unstructured":"Renegar, J.: Is it possible to know a problem instance is ill-posed?: some foundations for a general theory of condition numbers. J. Complex. 10(1), 1\u201356 (1994)","journal-title":"J. Complex."},{"issue":"1\u20133","key":"1663_CR34","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01581690","volume":"65","author":"J Renegar","year":"1994","unstructured":"Renegar, J.: Some perturbation theory for linear programming. Math. Program. 65(1\u20133), 73\u201391 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"1663_CR35","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1137\/0805026","volume":"5","author":"J Renegar","year":"1995","unstructured":"Renegar, J.: Incorporating condition measures into the complexity theory of linear programming. SIAM J. Opt. 5(3), 506\u2013524 (1995)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"1663_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1018343420495","volume":"9","author":"A Seifi","year":"1998","unstructured":"Seifi, A., Tun\u00e7el, L.: A constant-potential infeasible-start interior-point algorithm with computational experiments and applications. Comput. Opt. Appl. 9(2), 107\u2013152 (1998)","journal-title":"Comput. Opt. Appl."},{"issue":"2","key":"1663_CR37","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0773-1","volume":"150","author":"A Skajaa","year":"2015","unstructured":"Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. 150(2), 391\u2013422 (2015)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"1663_CR38","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Opt. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Opt. Methods Softw."},{"key":"1663_CR39","unstructured":"Todd, Michael\u00a0J.: Detecting infeasibility in infeasible-interior-point methods for optimization. Technical report, Cornell University Operations Research and Industrial Engineering, (2003)"},{"key":"1663_CR40","unstructured":"Toh, K.-C., T\u00fct\u00fcnc\u00fc, R.\u00a0H., Todd, M.\u00a0J.: On the implementation and usage of SDPT3\u2013a MATLAB software package for semidefinite-quadratic-linear programming, version 4.0. (2006)"},{"issue":"3","key":"1663_CR41","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002080010009","volume":"1","author":"L Tun\u00e7el","year":"2001","unstructured":"Tun\u00e7el, L.: Generalization of primal-dual interior-point methods to convex optimization problems in conic form. Found. Comput. Math. 1(3), 229\u2013254 (2001)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"1663_CR42","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-012-9480-0","volume":"53","author":"L Tun\u00e7el","year":"2012","unstructured":"Tun\u00e7el, L., Wolkowicz, H.: Strong duality and minimal representations for cone optimization. Comput. Opt. Appl. 53(2), 619\u2013648 (2012)","journal-title":"Comput. Opt. Appl."},{"issue":"1","key":"1663_CR43","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X Xu","year":"1996","unstructured":"Xu, X., Hung, P.-F., Ye, Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Op. Res. 62(1), 151\u2013171 (1996)","journal-title":"Ann. Op. Res."},{"issue":"1","key":"1663_CR44","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $$O(\\sqrt{n}L)$$-iteration homogeneous and self-dual linear programming algorithm. Math. Op. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Op. Res."},{"issue":"1","key":"1663_CR45","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Opt. 4(1), 208\u2013227 (1994)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"1663_CR46","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Yin Zhang","year":"1998","unstructured":"Zhang, Yin: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Opt. 8(2), 365\u2013386 (1998)","journal-title":"SIAM J. Opt."},{"issue":"1\u20134","key":"1663_CR47","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/10556789908805756","volume":"11","author":"Yin Zhang","year":"1999","unstructured":"Zhang, Yin: User\u2019s guide to LIPSOL linear-programming interior point solvers V0.4. Opt. Methods Softw. 11(1\u20134), 385\u2013396 (1999)","journal-title":"Opt. Methods Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01663-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01663-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01663-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T19:18:22Z","timestamp":1656357502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01663-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,19]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1663"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01663-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,6,19]]},"assertion":[{"value":"26 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}