{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T05:01:45Z","timestamp":1688446905903},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T00:00:00Z","timestamp":1170979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,6,20]]},"DOI":"10.1007\/s10107-006-0075-3","type":"journal-article","created":{"date-parts":[[2007,2,8]],"date-time":"2007-02-08T13:07:30Z","timestamp":1170940050000},"page":"95-112","source":"Crossref","is-referenced-by-count":1,"title":["On some properties and an application of the logarithmic barrier method"],"prefix":"10.1007","volume":"111","author":[{"given":"Regina S.","family":"Burachik","sequence":"first","affiliation":[]},{"given":"L. M. Gra\u00f1a","family":"Drummond","sequence":"additional","affiliation":[]},{"given":"Susana","family":"Scheimberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,2,9]]},"reference":[{"key":"75_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/S1052623497324825","volume":"10","author":"A. Auslender","year":"1999","unstructured":"Auslender A. (1999). Penalty and barrier methods: a unified framework. SIAM J. Optim. 10: 211\u2013230","journal-title":"SIAM J. Optim."},{"key":"75_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.22.1.43","volume":"22","author":"A. Auslender","year":"1997","unstructured":"Auslender A., Cominetti R. and Haddou M. (1997). Asymptotic analysis for penalty and barrier in convex and linear programming. Math. Oper. Res. 22: 43\u201362","journal-title":"Math. Oper. Res."},{"key":"75_CR3","unstructured":"Bayer, D., Lagarias, J.C.: The nonlinear geometry of linear programming: (i) affine and projective scaling trajectories, (ii) Legendre transform coordinates, (iii) central trajectories. Preprint, AT&Bell Laboratories, Murray Hill (1986)"},{"key":"75_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and nonsmooth analysis","author":"F. Clarke","year":"1990","unstructured":"Clarke F. (1990). Optimization and nonsmooth analysis. SIAM Publications, Philadelphia"},{"key":"75_CR5","doi-asserted-by":"crossref","unstructured":"Cominetti, R.: Nonlinear averages and convergence of penalty trayectories in convex programming. In: Th\u00e9ra, M., Tichatschke, R. (eds.) Ill-Posed Variational Problems and Regularization Techniques, Lecture Notes in Economics and Mathematical Systems, vol. 477, pp. 65\u201378. Springer, Berlin Heidelberg New York (1999)","DOI":"10.1007\/978-3-642-45780-7_5"},{"key":"75_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Techniques","author":"A. Fiacco","year":"1990","unstructured":"Fiacco A. and McCormick G.P. (1990). Nonlinear Programming: Sequential Unconstrained Techniques. SIAM Publications, Philadelphia"},{"key":"75_CR7","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J. Fliege","year":"2000","unstructured":"Fliege J. and Svaiter B.F. (2000). Steepest descent methods for multicriteria optimimization. Math. Methods Oper. Res. 51: 479\u2013494","journal-title":"Math. Methods Oper. Res."},{"key":"75_CR8","unstructured":"Frish, K.R.: The Logarithmic potential method of convex programming. Memorandum, Institute of Economics, University of Oslo, Norway (1955)"},{"key":"75_CR9","unstructured":"Gilbert, J.C., Gonzaga, C., Karas, E.: Examples of ill-behaved central paths in convex optimization. Technical Report N 4179, INRIA, Paris, France (2001)"},{"key":"75_CR10","first-page":"57","volume":"19","author":"L.M. Gra\u00f1a Drummond","year":"2000","unstructured":"Gra\u00f1a Drummond L.M. and Iusem A.N. (2000). Welldefinedness and limiting behavior of the central path. Comp. Appl. Math. 19: 57\u201378","journal-title":"Comp. Appl. Math."},{"key":"75_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"L.M. Gra\u00f1a Drummond","year":"2004","unstructured":"Gra\u00f1a Drummond L.M. and Iusem A.N. (2004). A projected gradient method for vector optimization problems. Comp. Optim. Appl. 28: 5\u201329","journal-title":"Comp. Optim. Appl."},{"key":"75_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/02331930290019396","volume":"51","author":"L.M. Gra\u00f1a Drummond","year":"2002","unstructured":"Gra\u00f1a Drummond L.M. and Peterzil Y. (2002). The central path in smooth convex semidefinite programs. Optimization 51: 207\u2013233","journal-title":"Optimization"},{"key":"75_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"B.F. Gra\u00f1aDrummond","year":"2005","unstructured":"Gra\u00f1aDrummond B.F. and Svaiter L.M. (2005). A steepest descent method for vector optimization. J. Comp. Appl. Math. 175: 395\u2013414","journal-title":"J. Comp. Appl. Math."},{"key":"75_CR14","unstructured":"Gra\u00f1a Drummond, L.M., Maculan, N., Svaiter, B.F.: On the choice of parameters for the weighting method scalarization in vector optimization (Submitted)"},{"key":"75_CR15","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1137\/S1052623401390793","volume":"12","author":"M. Halicka","year":"2002","unstructured":"Halicka M., De Klerk E. and Roos C. (2002). On the convergence of the central path in semidefinite optimization. SIAM J. Optim. 12: 1090\u20131099","journal-title":"SIAM J. Optim."},{"key":"75_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty J.-B. and Lemar\u00e9chal C. (1993). Convex Analysis and Minimization Algorithms. Springer, Berlin Heidelberg New York"},{"key":"75_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02592221","volume":"29","author":"J. Jahn","year":"1984","unstructured":"Jahn J. (1984). Scalarization in vector optimization. Math. Program. 29: 203\u2013218","journal-title":"Math. Program."},{"key":"75_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF00939046","volume":"55","author":"D.T. Luc","year":"1987","unstructured":"Luc D.T. (1987). Scalarization of vector optimization problems. J. Optim. Theory Appl. 55: 85\u2013102","journal-title":"J. Optim. Theory Appl."},{"key":"75_CR19","doi-asserted-by":"crossref","unstructured":"Luc, D.T.: Theory of vector optimization. In: Lecture Notes in Economy and Mathematical Systems. vol. 319, Springer, Berlin Heidelberg New York (1989)","DOI":"10.1007\/978-3-642-50280-4"},{"key":"75_CR20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/PL00011416","volume":"90","author":"G.P. McCormick","year":"2001","unstructured":"McCormick G.P. and Witzgall C. (2001). Logarithmic SUMT limits in convex programming. Math. Program. Ser. A 90: 113\u2013145","journal-title":"Math. Program. Ser. A"},{"key":"75_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.2140\/pjm.1980.88.101","volume":"88","author":"L. McLinden","year":"1980","unstructured":"McLinden L. (1980). An analogue of Moreau\u2019s Proximation Theorem, with application to the nonlinear complementarity problem. Pacific J. Math. 88: 101\u2013161","journal-title":"Pacific J. Math."},{"key":"75_CR22","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming-Interior Point and Related Methods, pp. 131\u2013158. Springer, Berlin Heidelberg New York (1988)","DOI":"10.1007\/978-1-4613-9617-8_8"},{"key":"75_CR23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.14.1.97","volume":"14","author":"N. Megiddo","year":"1989","unstructured":"Megiddo N. and Schub M. (1989). Boundary behavior of interior-point algorithms in linear programming. Math. Oper. Res. 14: 97\u2013146","journal-title":"Math. Oper. Res."},{"key":"75_CR24","volume-title":"Nonlinear Multiobjective Optimization","author":"K.M. Miettinen","year":"1999","unstructured":"Miettinen K.M. (1999). Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Norwell"},{"key":"75_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro R.D.C. and Adler I. (1989). Interior path-following primal-dual algorithms, part 1: linear programming. Math. Program. 44: 27\u201341","journal-title":"Math. Program."},{"key":"75_CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro R.D.C. and Adler I. (1989). Interior path-following primal-dual algorithms, part 2: convex quadratic programming. Math. Program. 44: 43\u201366","journal-title":"Math. Program."},{"key":"75_CR27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1018339901042","volume":"10","author":"R. Monteiro","year":"1998","unstructured":"Monteiro R. and Zhou F. (1998). On the existence and convergence of the central path for convex programming and some duality results. Comp. Optim. Appl. 10: 51\u201377","journal-title":"Comp. Optim. Appl."},{"key":"75_CR28","first-page":"227","volume":"20","author":"G.R. Parissot","year":"1961","unstructured":"Parissot G.R. (1961). R\u00e9solution num\u00e9rique approch\u00e9e du probl\u00e8me de programation lin\u00e9aire par application de la programation logarithmique. Rev. Fr. Rech. Op\u00e9r. 20: 227\u2013259","journal-title":"Rev. Fr. Rech. Op\u00e9r."},{"key":"75_CR29","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, New Jersey"},{"key":"75_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar R.T. and Wets R. (1998). Variational Analysis. Springer, New Jersey"},{"key":"75_CR31","doi-asserted-by":"crossref","unstructured":"Sonnevend, G.: An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Lecture Notes on Control and Information Sciences, vol. 84, pp. 866\u2013876. Springer, Berlin Heidelberg New York (1985)","DOI":"10.1007\/BFb0043914"},{"key":"75_CR32","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804526","volume-title":"A First Course in Optimization Theory","author":"R.K. Sundaram","year":"1996","unstructured":"Sundaram R.K. (1996). A First Course in Optimization Theory. Cambridge University Press, Cambridge"},{"key":"75_CR33","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1090\/qam\/135625","volume":"19","author":"P. Wolfe","year":"1961","unstructured":"Wolfe P. (1961). A duality theorem for nonlinear programming. Q. Appl. Math. 19: 239\u2013244","journal-title":"Q. Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0075-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0075-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0075-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:02Z","timestamp":1559123402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0075-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,9]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2007,6,20]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0075-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,9]]}}}