{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T15:50:39Z","timestamp":1723391439523},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00276-5","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T01:10:28Z","timestamp":1063329028000},"page":"527-539","source":"Crossref","is-referenced-by-count":31,"title":["The sagitta method for solving linear programs"],"prefix":"10.1016","volume":"157","author":[{"given":"\u00c1ngel","family":"Santos-Palomo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00276-5_BIB1","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BF02190122","article-title":"An exterior-point method for linear programming problems","volume":"91","author":"Andrus","year":"1996","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB2","series-title":"Linear Programming and Network Flows","author":"Bazaraa","year":"1990"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB3","series-title":"Numerical Methods for Least Squares Problems","author":"Bj\u00f6rck","year":"1996"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB4","series-title":"Linear Programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01589112","article-title":"A direct active set algorithm for large sparse quadratic programs with simple lower bounds","volume":"45","author":"Coleman","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0024-3795(88)90067-5","article-title":"Linear programming via least squares","volume":"111","author":"Dax","year":"1988","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB7","series-title":"Continuous Optimization Models","author":"Eiselt","year":"1987"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB8","first-page":"143","article-title":"A survey of methods for linear programming","volume":"1","author":"Eiselt","year":"1989","journal-title":"Investigaci\u00f3n Operativa"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB9","series-title":"Practical Methods of Optimization","author":"Fletcher","year":"1987"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB10","series-title":"Encyclopedia of Optimization","year":"2001"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02614325","article-title":"Criss-cross methods: A fresh view on pivot algorithms","volume":"78","author":"Fukuda","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB12","first-page":"10","article-title":"Electronic mail distribution of linear programming test problems","volume":"13","author":"Gay","year":"1985","journal-title":"COAL Newsletter"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0024-3795(73)90047-5","article-title":"A numerically stable form of the simplex algorithm","volume":"7","author":"Gill","year":"1973","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"10.1016\/S0377-2217(03)00276-5_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1033001","article-title":"Inertia-controlling methods for general quadratic programming","volume":"33","author":"Gill","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB15","volume":"vol. 1","author":"Gill","year":"1991"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB16","series-title":"On the Complexity of the Simplex Method","author":"Goldfarb","year":"1994"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","article-title":"A numerically stable dual method for solving strictly convex quadratic programs","volume":"22","author":"Goldfarb","year":"1983","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB18","doi-asserted-by":"crossref","unstructured":"D. Goldfarb, M.J. Todd, Linear programming, in: G.L. Nemhauser et al. (Eds.), Optimization, 1989, pp. 171\u2013210 (Chapter II)","DOI":"10.1016\/S0927-0507(89)01003-0"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB19","unstructured":"P. Guerrero-Garc\u0131\u0301a, Range-space methods for sparse linear programs, Ph. D. Thesis, University of M\u00e1laga, Spain, 2002 (Spanish)"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB20","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0905037","article-title":"Numerical methods for large sparse linear least squares problems","volume":"5","author":"Heath","year":"1984","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB21","unstructured":"K. Holmstr\u00f6m, The TOMLAB optimization environment v3.0 user's guide, Technical report, M\u00e4lardalen University, Sweden, 2001"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB22","series-title":"Solving least squares problems","author":"Lawson","year":"1974"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB23","series-title":"Nonlinear Programming","author":"Mangasarian","year":"1969"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB24","series-title":"Progress in Mathematical Programming","author":"Megiddo","year":"1989"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB25","unstructured":"N.A.G., The NAG Fortran Library. Introductory Guide, Mark 15, 1991"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB26","series-title":"Finite algorithms in optimization and data analysis","author":"Osborne","year":"1985"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB27","series-title":"Handbook of Applied Optimization","year":"2002"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB28","series-title":"The Mathematics of Nonlinear Programming","author":"Peressini","year":"1988"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB29","series-title":"Theory and Algorithms for Linear Optimization","author":"Roos","year":"1997"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB30","unstructured":"A. Santos-Palomo, Nuevos m\u00e9todos de programaci\u00f3n cuadr\u00e1tica, Ph. D. Thesis, University of M\u00e1laga, Spain, 1995"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB31","unstructured":"A. Santos-Palomo, P. Guerrero-Garc\u0131\u0301a, The sagitta method for solving linear programs as a feasible point method, Presented at Optimization 98, University of Coimbra (Portugal), July 1998, JOTA, submitted for publication"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB32","unstructured":"A. Santos-Palomo, P. Guerrero-Garc\u0131\u0301a, Solving a sequence of sparse compatible systems, Presented at the 19th Biennal Conference on Numerical Analysis, Dundee (Scotland), 26\u201329 June 2001, IMAJNA, submitted for publication"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB33","unstructured":"A. Santos-Palomo, P. Guerrero-Garc\u0131\u0301a, Solving a sequence of sparse least squares problems, Technical Report, Department of Applied Mathematics, University of M\u00e1laga, BIT, submitted for publication"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB34","unstructured":"A. Santos-Palomo, P. Guerrero-Garc\u0131\u0301a, A non-simplex method for linear programs in standard form, Expanded version of a talk presented at the XXVI Congreso Nacional de Estad\u0131\u0301 stica e Investigaci\u00f3n Operativa, \u00dabeda, Spain, 6\u20139 November 2001, APNUM, submitted for publication"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB35","unstructured":"M.A. Saunders, Large-scale linear programming using the Cholesky factorization, Technical Report CS-252, Computer Science Department, Stanford University, 1972"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB36","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800300111","article-title":"Nonadjacent extreme point methods for solving linear programs","volume":"30","author":"Sherali","year":"1983","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB37","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","article-title":"Pivot rules for linear programming: A survey on recent theoretical developments","volume":"46","author":"Terlaky","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00276-5_BIB38","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/mnsc.15.7.426","article-title":"The Criss-cross method for solving linear programming problems","volume":"15","author":"Zionts","year":"1969","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:23:47Z","timestamp":1551065027000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703002765"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00276-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}