{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:27:59Z","timestamp":1772519279923,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1007\/bf01582224","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:40:17Z","timestamp":1114677617000},"page":"265-295","source":"Crossref","is-referenced-by-count":27,"title":["Some properties of the Hessian of the logarithmic barrier function"],"prefix":"10.1007","volume":"67","author":[{"given":"Margaret H.","family":"Wright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BF02592223","volume":"29","author":"T.F. Coleman","year":"1984","unstructured":"T.F. Coleman and D.C. Sorensen, \u201cA note on the computation of an orthonormal basis for the null space of a matrix,\u201dMathematical Programming 29 (1984) 234\u2013242.","journal-title":"Mathematical Programming"},{"key":"CR2","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis Jr.","year":"1983","unstructured":"J.E. Dennis, Jr. and R.B. Schnabel,Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, New Jersey, 1983)."},{"key":"CR3","first-page":"377","volume-title":"Operations Research Support Methodology","author":"A.V. Fiacco","year":"1979","unstructured":"A.V. Fiacco, \u201cBarrier methods for nonlinear programming,\u201d in:Operations Research Support Methodology (A.G. Holzman, ed.), (Marcel Dekker, New York, 1979) 377\u2013440."},{"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 (John Wiley and Sons, New York, 1968), (Republished by SIAM, Philadelphia, 1990)."},{"key":"CR5","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization (second edition), (John Wiley and Sons, Chichester, 1987).","edition":"second edition"},{"key":"CR6","first-page":"203","volume-title":"Optimization","author":"R. Fletcher","year":"1969","unstructured":"R. Fletcher and A.P. McCann, \u201cAcceleration techniques for nonlinear programming,\u201d in:Optimization (R. Fletcher, ed.), (Academic Press, New York, 1969) 203\u2013213."},{"key":"CR7","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, London and New York, 1981)."},{"key":"CR8","volume-title":"Numerical Linear Algebra and Optimization, Volume 1","author":"P.E. Gill","year":"1991","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Numerical Linear Algebra and Optimization, Volume 1 (Addison-Wesley, Redwood City, California, 1991)."},{"key":"CR9","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations (second edition), (Johns Hopkins University Press, Baltimore, Maryland, 1989).","edition":"second edition"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, \u201cPath following methods for linear programming,\u201dSIAM Review 34 (1992) 167\u2013224.","journal-title":"SIAM Review"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/oso\/9780198535645.003.0010","volume-title":"Reliable Numerical Computation","author":"N.J. Higham","year":"1990","unstructured":"N.J. Higham, \u201cAnalysis of the Cholesky decomposition of a semi-definite matrix,\u201d in:Reliable Numerical Computation (M.G. Cox and S. Hammarling, eds.), (Clarendon Press, Oxford, 1990) 161\u2013185."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR13","first-page":"322","volume":"24","author":"F.A. Lootsma","year":"1969","unstructured":"F.A. Lootsma, Hessian matrices of penalty functions for solving constrained optimization problems,Philips Research Reports 24 (1969) 322\u2013331.","journal-title":"Philips Research Reports"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00932477","volume":"7","author":"W. Murray","year":"1971","unstructured":"W. Murray, \u201cAnalytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions,\u201dJournal on Optimization Theory and Applications 7 (1971) 189\u2013196.","journal-title":"Journal on Optimization Theory and Applications"},{"key":"CR15","volume-title":"Projected Lagrangian methods based on the trajectories of penalty and barrier functions, Report SOL 78-23","author":"W. Murray","year":"1978","unstructured":"W. Murray and M.H. Wright, Projected Lagrangian methods based on the trajectories of penalty and barrier functions, Report SOL 78-23, Department of Operations Research, Stanford University, Stanford, California, 1978."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1287\/ijoc.5.1.40","volume":"5","author":"S.G. Nash","year":"1993","unstructured":"S.G. Nash and A. Sofer, \u201cA barrier method for large-scale constrained optimization,\u201dORSA Journal on Computing 5 (1993) 40\u201353.","journal-title":"ORSA Journal on Computing"},{"key":"CR17","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.R. Papadimitriou","year":"1982","unstructured":"C.R. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, New Jersey, 1982)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/0911064","volume":"11","author":"R.B. Schnabel","year":"1990","unstructured":"R.B. Schnabel and E. Eskow, \u201cA new modified Cholesky factorization,\u201dSIAM Journal on Scientific and Statistical Computing 11 (1990) 1136\u20131158.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR19","volume-title":"Matrix Perturbation Theory","author":"G.W. Stewart","year":"1990","unstructured":"G.W. Stewart and J. Sun,Matrix Perturbation Theory (Academic Press, Boston, 1990)."},{"key":"CR20","volume-title":"The Algebraic Eigenvalue Problem","author":"J.H. Wilkinson","year":"1965","unstructured":"J.H. Wilkinson,The Algebraic Eigenvalue Problem (The Clarendon Press, Oxford, 1965)."},{"key":"CR21","volume-title":"Numerical Methods for Nonlinearly Constrained Optimization","author":"M.H. Wright","year":"1976","unstructured":"M.H. Wright,Numerical Methods for Nonlinearly Constrained Optimization, Ph. D. thesis, Stanford University, California, 1976."},{"key":"CR22","first-page":"341","volume-title":"Acta Numerica 1992","author":"M.H. Wright","year":"1992","unstructured":"M.H. Wright, Interior methods for constrained optimization, in:Acta Numerica 1992 (A. Iserles, ed.), (Cambridge University Press, New York, 1992) 341\u2013407."},{"key":"CR23","volume-title":"Why a pure primal Newton barrier step may be infeasible, Numerical Analysis Manuscript 93-02","author":"M.H. Wright","year":"1994","unstructured":"M.H. Wright, Why a pure primal Newton barrier step may be infeasible, Numerical Analysis Manuscript 93-02, AT&T Bell Laboratories, Murray Hill, New Jersey; to appear inSIAM Journal on Optimization (1994)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582224.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582224\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T08:19:10Z","timestamp":1706170750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["BF01582224"],"URL":"https:\/\/doi.org\/10.1007\/bf01582224","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}