{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:06:22Z","timestamp":1648821982533},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01299141","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:57:33Z","timestamp":1111744653000},"page":"29-46","source":"Crossref","is-referenced-by-count":4,"title":["A weighted least squaes study of robustness in interior point linear programming"],"prefix":"10.1007","volume":"2","author":[{"given":"Alexander L.","family":"Hipolito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, N.K. Karmarkar, M.C.G. Reseande, and G. Veiga, ?An implementation of Karmarkar's algrothm for linear programming,?Math. Programming 44 (1989) 297?335.","journal-title":"Math. Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, ?A variation on Karmarkar's algorithm for solving linear programming problems,?Math. Programming 36 (1986) 174?182.","journal-title":"Math. Programming"},{"key":"CR3","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1969","unstructured":"I.I. Dikin, ?Iterative solution of problems of linear and quadratic programming,?Doklady Akadmiia Nauk SSSR 174 (1969) 747?748, (English translation:Soviet Math. Doklady 8 674?675.","journal-title":"Doklady Akadmiia Nauk SSSR"},{"key":"CR4","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, NY, 1968."},{"key":"CR5","volume-title":"The logarithmic potential method of convex programming","author":"K.R. Frisch","year":"1955","unstructured":"K.R. Frisch,The logarithmic potential method of convex programming, Memorandum, University Institute of Economic, Oslo, Norway, 1955."},{"key":"CR6","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, ?Electronic mail distribution of linear programming test problems,?Math. Programming Society COAL Newsletter,13 (1985) 10?12.","journal-title":"Math. Programming Society COAL Newsletter"},{"key":"CR7","first-page":"567","volume-title":"Matrix Computations","author":"G. Golub","year":"1989","unstructured":"G. Golub and C. Van Loan, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD 567?568, 1989.","edition":"2nd ed."},{"key":"CR8","first-page":"1","volume-title":"Progress in Math. Programming","author":"C.C. Gonzaga","year":"1989","unstructured":"C.C. Gonzaga, ?An algorithm for solving linear programming inO(n 3 L) operations,? N. Meggido, ed.,Progress in Math. Programming, Springer, Verlag, New York, NY, 1?28, 1989."},{"key":"CR9","series-title":"Technical Report ES-230\/90","volume-title":"Convergence of the large step prinal affine-scaling algorithm for prinal nondegenerate linear programs","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga,Convergence of the large step prinal affine-scaling algorithm for prinal nondegenerate linear programs, Technical Report ES-230\/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, 1990."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, ?Search directions for interior linear-programming methods,?Algorithmica,6 (1991), 153?161.","journal-title":"Algorithmica"},{"key":"CR11","volume-title":"Degeneracy in interior point methods for linear programming","author":"O. G\u00fcler","year":"1991","unstructured":"O. G\u00fcler, D. den Hertog, C. Roos, T. Terlaky, and T. Tsuchiya,Degeneracy in interior point methods for linear programming, Report 91-102, Faculty of technical Mathematics and Informatics, TU Delft, Delft, The Netherlands, 1991."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01582902","volume":"52","author":"D. Hertog den","year":"1991","unstructured":"D. den Hertog and C. Roos, ?A survey of search directions in interior point methods for linear programming,?Math. Programming,52 (1991) 481?510.","journal-title":"Math. Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, ?A new polynomial-time algorihm for linear programming,?Combinatorica,4 (1984) 373?395.","journal-title":"Combinatorica"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01582905","volume":"52","author":"N.K. Karmakar","year":"1991","unstructured":"N.K. Karmakar and K.G. Ramakrishnan, ?Computational results of an interior point algorithm for large scale linear programming,?Math. Programming,52 (1991) 555?586.","journal-title":"Math. Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Math. Programming","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno, and A. Yoshiye, ?A primal-dual inteior point method for linear progamming,? in N. Meggido, ed.,Progress in Math. Programming, Springer-Verlag, New York, NY, 29?47, 1989."},{"key":"CR16","volume-title":"Solving Least Squares Problems","author":"C.L. Lawson","year":"1974","unstructured":"C.L. Lawson and R.J. Hanson,Solving Least Squares Problems, Prentice-Hall Inc., Englewood Cliffs, NJ, 1974."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R.E. Marsten, and D.F. Shanno, ?Computational experience with aprimal-dual interior point method for linear programming,?Liear Algebra and its Applications,152 (1991) 191?222.","journal-title":"Liear Algebra and its Applications"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.14.1.97","volume":"14","author":"N. Meggido","year":"1989","unstructured":"N. Meggido and M. Shub, ?Boundary behaviour of interior point algorithms in linear programming,?Math. of Oper. Res. 14 (1989) 97?114.","journal-title":"Math. of Oper. Res."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(87)90040-X","volume":"6","author":"C.L. Monma","year":"1987","unstructured":"C.L. Monma and A.J. Morton, ?Computational experience with the dual affine variant of Karmarkar's method for linear programming,?Oper. Res. Letters,6 (1987), 261?267.","journal-title":"Oper. Res. Letters"},{"key":"CR20","volume-title":"A simplified global convergence proof of the affine scaling algorithm","author":"R.D.C. Monteiro","year":"1992","unstructured":"R.D.C. Monteiro, T. Tsuchiya, and Y. Wang,A simplified global convergence proof of the affine scaling algorithm, Manusript, Dept. of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 1992."},{"key":"CR21","unstructured":"D. Shanno,Tutorial: Interior point methods for linear programming, Presented at the ORSA\/TIMS 34th Joint National Meeting, San Francisco, CA. November, 1992."},{"key":"CR22","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1007\/BFb0043914","volume-title":"An analytical centre for polyhedrons and new classes of global algorthms for linear (smoth, convex) programming","author":"G. Sonnevend","year":"1986","unstructured":"G. Sonnevend,An analytical centre for polyhedrons and new classes of global algorthms for linear (smoth, convex) programming, Lecture Notes in Control and Information Sciences 84, Springer-Verlag, Berlin, 1986, 866?876."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-0348-9297-1_20","volume-title":"Trends in Math. Optimization","author":"G. Sonnevend","year":"1988","unstructured":"G. Sonnevend, ?New algorithms in convex programming based on the notin of ?centre? (for a system of analytic inequalities) and on rational extrapolation,? in K.H. Hoffmann et al., eds.,Trends in Math. Optimization, Birkhauser Verlag, Basel, Switzerland, 1988, 311?327."},{"key":"CR24","series-title":"Technical Report","volume-title":"A low complexity interior point algorithm for linear programming","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd,A low complexity interior point algorithm for linear programming, Technical Report 903, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1990."},{"key":"CR25","first-page":"17","volume":"19","author":"M.J. Todd","year":"1991","unstructured":"M.J. Todd, ?Playing with interior points,?Math. Programming Society COAL Newsletter,19 (1991) 17?25.","journal-title":"Math. Programming Society COAL Newsletter"},{"key":"CR26","series-title":"Research Memorandum","volume-title":"Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems","author":"T. Tsuchiya","year":"1992","unstructured":"T. Tsuchiya and M. Muramatsu,Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems,? Research Memorandum 423. The Institute of Statistical Mathematics, Tokyo, Japan, 1992."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon, and B.A. Freedman, ?A modification of Karmarkar's linear programming algorithm,?Algorithmica 1 (1986) 395?407.","journal-title":"Algorithmica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299141.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299141\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:02Z","timestamp":1556647682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01299141"],"URL":"https:\/\/doi.org\/10.1007\/bf01299141","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}