{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T13:21:41Z","timestamp":1751808101389,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031105616"},{"type":"electronic","value":"9783031105623"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10562-3_13","type":"book-chapter","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:25:15Z","timestamp":1659536715000},"page":"174-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Active-Set LP Algorithms Allowing Basis Deficiency"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3126-0078","authenticated-orcid":false,"given":"Pablo","family":"Guerrero-Garc\u00eda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-1436","authenticated-orcid":false,"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-6377(92)90024-W","volume":"11","author":"JR Birge","year":"1992","unstructured":"Birge, J.R., Freund, R.M., Vanderbei, R.J.: Prior reduced fill-in solving equations in interior point algorithms. Oper. Res. Lett. 11(4), 195\u2013198 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01403888","volume":"54","author":"\u00c5 Bj\u00f6rck","year":"1988","unstructured":"Bj\u00f6rck, \u00c5.: A direct method for sparse least squares problems with lower and upper bounds. Numer. Math. 54(1), 19\u201332 (1988)","journal-title":"Numer. Math."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF01589112","volume":"45","author":"TF Coleman","year":"1989","unstructured":"Coleman, T.F., Hulbert, L.A.: A direct active set algorithm for large sparse quadratic programs with simple bounds. Math. Program. 45(3), 373\u2013406 (1989)","journal-title":"Math. Program."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B., Leichner, S.A., Davis, J.W.: A strictly improving linear programming Phase I algorithm. Ann. Oper. Res. 46\/47(2), 409\u2013430 (1993)","DOI":"10.1007\/BF02023107"},{"key":"13_CR5","unstructured":"Dax, A.: The gradient projection method for quadratic programming. Technical report, Institute of Mathematics, Hebrew University, Jerusalem, Israel (1978)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0024-3795(88)90067-5","volume":"111","author":"A Dax","year":"1988","unstructured":"Dax, A.: Linear programming via least squares. Linear Algebra Appl. 111, 313\u2013324 (1988)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S0036144594295502","volume":"39","author":"A Dax","year":"1997","unstructured":"Dax, A.: An elementary proof of Farkas\u2019 Lemma. SIAM Rev. 39(3), 503\u2013507 (1997)","journal-title":"SIAM Rev."},{"key":"13_CR8","unstructured":"Gay, D.M.: Electronic mail distribution of linear programming test problems. Committee Algorithms (COAL) Newslett. 13, 10\u201312 (1985)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0024-3795(73)90047-5","volume":"7","author":"PE Gill","year":"1973","unstructured":"Gill, P.E., Murray, W.: A numerically stable form of the simplex algorithm. Linear Algebra Appl. 7, 99\u2013138 (1973)","journal-title":"Linear Algebra Appl."},{"key":"13_CR10","volume-title":"Numerical Linear Algebra and Optimization","author":"PE Gill","year":"1991","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Numerical Linear Algebra and Optimization, vol. 1. Addison-Wesley, Redwood City (1991)"},{"key":"13_CR11","unstructured":"Gould, N.I.M.: The generalized steepest-edge for linear programming, Part I: theory. Technical report CORR 83-2, Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario, Canada, January 1983"},{"key":"13_CR12","unstructured":"Guerrero-Garc\u00eda, P.: Range-space methods for sparse linear programs (in Spanish). Ph.D. thesis, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, July 2002"},{"key":"13_CR13","unstructured":"Guerrero-Garc\u00eda, P., Santos-Palomo, A.: Gyula Farkas would also feel proud. Technical report MA-02-01, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, November 2002"},{"key":"13_CR14","unstructured":"Guerrero-Garc\u00eda, P., Santos-Palomo, A.: A comparison of three sparse linear program solvers. Technical report MA-03-04, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, October 2003"},{"key":"13_CR15","unstructured":"Guerrero-Garc\u00eda, P., Santos-Palomo, A.: Solving a sequence of sparse compatible systems. Technical report MA-02-03, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, October 2003"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ejor.2003.06.048","volume":"167","author":"P Guerrero-Garc\u00eda","year":"2005","unstructured":"Guerrero-Garc\u00eda, P., Santos-Palomo, A.: Phase-I cycling under the most-obtuse-angle pivot rule. Eur. J. Oper. Res. 167(1), 20\u201327 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1137\/0905037","volume":"5","author":"MT Heath","year":"1984","unstructured":"Heath, M.T.: Numerical methods for large sparse linear least squares problems. SIAM J. Sci. Stat. Comput. 5(3), 497\u2013513 (1984)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"13_CR18","unstructured":"Holmstr\u00f6m, K.: The TOMLAB optimization environment v3.0 user\u2019s guide. Technical report, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden, April 2001"},{"key":"13_CR19","volume-title":"Solving Least Squares Problems","author":"CL Lawson","year":"1974","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Prentice-Hall, Englewood Cliffs (1974)"},{"key":"13_CR20","unstructured":"Li, W.: Bound constraints simplex method with deficient basis. Pure Appl. Math. (Xi\u2019an) 20(2), 171\u2013176 (2004)"},{"issue":"6\/7","key":"13_CR21","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.camwa.2005.11.033","volume":"51","author":"W Li","year":"2006","unstructured":"Li, W., Guerrero-Garc\u00eda, P., Santos-Palomo, A.: A basis-deficiency-allowing primal Phase-I algorithm using the most-obtuse-angle column rule. Comput. Math. Appl. 51(6\/7), 903\u2013914 (2006)","journal-title":"Comput. Math. Appl."},{"key":"13_CR22","unstructured":"Murtagh, B.A., Saunders, M.A.: Minos 5.5 user\u2019s guide. Technical report SOL 83-20R, Systems Optimization Laboratory, Stanford University, Stanford, CA, July 1998"},{"key":"13_CR23","unstructured":"Oreborn, U.: A Direct Method for Sparse Nonnegative Least Squares Problems. Licentiat thesis, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden (1986)"},{"key":"13_CR24","volume-title":"Finite Algorithms in Optimization and Data Analysis","author":"MR Osborne","year":"1985","unstructured":"Osborne, M.R.: Finite Algorithms in Optimization and Data Analysis. Wiley, Chichester (1985)"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0898-1221(98)00127-8","volume":"36","author":"PQ Pan","year":"1998","unstructured":"Pan, P.Q.: A basis-deficiency-allowing variation of the simplex method for linear programming. Comput. Math. Appl. 36(3), 33\u201353 (1998)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:COAP.0000044185.69640.54","volume":"29","author":"PQ Pan","year":"2004","unstructured":"Pan, P.Q.: A dual projective pivot algorithm for linear programming. Comput. Optim. Appl. 29(3), 333\u2013346 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"13_CR27","unstructured":"Pan, P.Q.: Revised basis-deficiency-allowing simplex algorithm using the LU-factorization for linear programming. Presented at The Sixth International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 2004"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/030602253","volume":"16","author":"PQ Pan","year":"2005","unstructured":"Pan, P.Q.: A revised dual projective pivot algorithm for linear programming. SIAM J. Optim. 16(1), 49\u201368 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"13_CR29","first-page":"898","volume":"196","author":"PQ Pan","year":"2008","unstructured":"Pan, P.Q.: A primal deficient-basis simplex algorithm for linear programming. Appl. Math. Comput. 196(2), 898\u2013912 (2008)","journal-title":"Appl. Math. Comput."},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Pan, P.Q.: Linear Programming Computation, 1st edn. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-642-40754-3","DOI":"10.1007\/978-3-642-40754-3"},{"issue":"2","key":"13_CR31","first-page":"88","volume":"8","author":"PQ Pan","year":"2004","unstructured":"Pan, P.Q., Li, W., Wang, Y.: A Phase-I algorithm using the most-obtuse-angle rule for the basis-deficiency-allowing dual simplex method. OR Trans. (Chinese) 8(2), 88\u201396 (2004)","journal-title":"OR Trans. (Chinese)"},{"issue":"10\/11","key":"13_CR32","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/S0898-1221(01)00254-1","volume":"42","author":"PQ Pan","year":"2001","unstructured":"Pan, P.Q., Pan, Y.P.: A Phase-1 approach for the generalized simplex algorithm. Comput. Math. Appl. 42(10\/11), 1455\u20131464 (2001)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"13_CR33","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01589358","volume":"20","author":"MJD Powell","year":"1981","unstructured":"Powell, M.J.D.: An example of cycling in a feasible point algorithm. Math. Program. 20(1), 353\u2013357 (1981)","journal-title":"Math. Program."},{"key":"13_CR34","first-page":"1","volume-title":"Nonlinear Programming 4","author":"MJD Powell","year":"1981","unstructured":"Powell, M.J.D.: An upper triangular matrix method for quadratic programming. In: Mangasarian, O., Meyer, R., Robinson, S. (eds.) Nonlinear Programming 4, pp. 1\u201324. Academic Press, New York (1981)"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Rosen, J.B.: The gradient projection method for nonlinear programming. Part I: linear constraints. J. Soc. Industr. Appl. Math. 8(1), 181\u2013217 (1960)","DOI":"10.1137\/0108011"},{"key":"13_CR36","unstructured":"Santos-Palomo, A.: New range-space active-set methods for strictly convex quadratic programming. In: Olivares-Rieumont, P. (ed.) Proceedings of the III Conference on Operations Research, vol. 2, p. 27. Universidad de La Habana, Cuba, March 1997"},{"issue":"3","key":"13_CR37","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/S0377-2217(03)00276-5","volume":"157","author":"A Santos-Palomo","year":"2004","unstructured":"Santos-Palomo, A.: The sagitta method for solving linear programs. Eur. J. Oper. Res. 157(3), 527\u2013539 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR38","unstructured":"Santos-Palomo, A., Guerrero-Garc\u00eda, P.: Solving a sequence of sparse least squares problems. Technical report MA-03-03, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, September 2003"},{"key":"13_CR39","unstructured":"Santos-Palomo, A., Guerrero-Garc\u00eda, P.: Computational NETLIB experience with a dense projected gradient sagitta method. Technical report MA-05-05, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, September 2005"},{"issue":"2","key":"13_CR40","first-page":"79","volume":"14","author":"A Santos-Palomo","year":"2005","unstructured":"Santos-Palomo, A., Guerrero-Garc\u00eda, P.: A non-simplex active-set method for linear programs in standard form. Stud. Inform. Control 14(2), 79\u201384 (2005)","journal-title":"Stud. Inform. Control"},{"key":"13_CR41","unstructured":"Santos-Palomo, A., Guerrero-Garc\u00eda, P.: Sagitta method with guaranteed convergence. Technical report MA-05-02, Department of Applied Mathematics, University of M\u00e1laga, Spain, M\u00e1laga, Spain, February 2005"},{"issue":"1","key":"13_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/dri027","volume":"26","author":"A Santos-Palomo","year":"2006","unstructured":"Santos-Palomo, A., Guerrero-Garc\u00eda, P.: Updating and downdating an upper trapezoidal sparse orthogonal factorization. IMA J. Numer. Anal. 26(1), 1\u201310 (2006)","journal-title":"IMA J. Numer. Anal."},{"key":"13_CR43","unstructured":"Saunders, M.A.: Large-scale linear programming using the Cholesky factorization. Technical report CS-TR-72-252, Computer Science Department, Stanford University, Stanford, CA, January 1972"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2022 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10562-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:27:05Z","timestamp":1659536825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10562-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031105616","9783031105623"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10562-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"279","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"285 Workshop submission accepted out of 815 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}