{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:27:13Z","timestamp":1672428433501},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T00:00:00Z","timestamp":1164153600000},"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,1,30]]},"DOI":"10.1007\/s10107-006-0025-0","type":"journal-article","created":{"date-parts":[[2006,11,21]],"date-time":"2006-11-21T14:51:32Z","timestamp":1164120692000},"page":"385-411","source":"Crossref","is-referenced-by-count":1,"title":["A modified nearly exact method for solving low-rank trust region subproblem"],"prefix":"10.1007","volume":"109","author":[{"given":"Zhaosong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,22]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-1-4613-3632-7_3","volume-title":"Large Scale Optimization: State of the Art","author":"M.G. Breitfeld","year":"1994","unstructured":"Breitfeld M.G., Shanno D.F. (1994) Preliminary computational experience with modified log-barrier functions for large-scale nonlinear programming. In: Hager W., Hearn D., Pardalos P. (eds) Large Scale Optimization: State of the Art. Kluwer, Dordrecht, pp. 45\u201367"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF02206826","volume":"62","author":"M.G. Breitfeld","year":"1996","unstructured":"Breitfeld M.G., Shanno D.F. (1996) Computational experience with penalty-barrier methods for nonlinear programming. Ann. Oper. Res. 62, 439\u2013463","journal-title":"Ann. Oper. Res."},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0708060","volume":"8","author":"J.R. Bunch","year":"1971","unstructured":"Bunch J.R., Parlett B.N. (1971) Direct methods for solving symmetric indefinite systems of linear equations. SIAM J. Numer. Anal. 8, 639\u2013655","journal-title":"SIAM J. Numer. Anal."},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0716029","volume":"16","author":"A.K. Cline","year":"1979","unstructured":"Cline A.K., Moler C.B., Stewart G.W., Wilkinson J.H. (1979) An estimate for the condition number of a matrix. SIAM J. Numer. Anal. 16, 368\u2013375","journal-title":"SIAM J. Numer. Anal."},{"key":"25_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12211-2","volume-title":"LANCELOT: A Fortran package for large-scale nonlinear optimization. Springer Series in Computational Mathematics 17","author":"A.R. Conn","year":"1992","unstructured":"Conn A.R., Gould N.I.M., Toint P.L. (1992) LANCELOT: A Fortran package for large-scale nonlinear optimization. Springer Series in Computational Mathematics 17. Springer, Berlin New York"},{"key":"25_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-region methods","author":"A.R. Conn","year":"2000","unstructured":"Conn A.R., Gould N.I.M., Toint P.L. (2000) Trust-region methods. SIAM Publications, Philadelphia"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF00932218","volume":"28","author":"J.E. Dennis","year":"1979","unstructured":"Dennis J.E., Mei H.W. (1979) Two new unconstrained optimization algorithms which use function and gradient values. J. Optim. Theor. Appl. 28, 453\u2013482","journal-title":"J. Optim. Theor. Appl."},{"key":"25_CR8","volume-title":"Practical Methods of Optimization. Unconstrained Optimization 1","author":"R. Fletcher","year":"1980","unstructured":"Fletcher R. (1980) Practical Methods of Optimization. Unconstrained Optimization 1. John Wiley, New York"},{"issue":"1","key":"25_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/10556780410001647186","volume":"19","author":"C. Fortin","year":"2004","unstructured":"Fortin C., Wolkowicz H. (2004) The trust region subproblem and semidefinite programming. Optim. Methods Softw. 19(1): 41\u201367","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"25_CR10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"4","author":"D.M. Gay","year":"1981","unstructured":"Gay D.M. (1981) Computing optimal locally constrained steps. SIAM J. Sci. Stat. Comput. 4(2): 186\u2013197","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"25_CR11","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N.I.M. Gould","year":"1999","unstructured":"Gould N.I.M., Lucidi S., Roma M., Toint P.L. (1999) Solving the trust-region subproblem using the Lanczos method. SIAM J. Optimization 9(2): 504\u2013525","journal-title":"SIAM J. Optimization"},{"key":"25_CR12","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: General CUTEr documentation. Technical Report TR\/PA\/02\/13, CERFACS, Toulouse, France (2003)"},{"key":"25_CR13","unstructured":"Hebden, M.D.: An algorithm for minimization using exact second derivatives. Atomic Energy Research Establishment, Report T.P.515, Harwell, England (1973)"},{"issue":"3","key":"25_CR14","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9 J.J., Sorensen D.C. (1983) Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3): 553\u2013572","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-68874-4_11","volume-title":"Mathematical Programming: the State of the Art, University of Bonn","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9 J.J. (1983) Recent developments in algorithms and software for trust region methods. In: Bachem A., Grotschel M., Korte B. (eds) Mathematical Programming: the State of the Art, University of Bonn. Springer, Berlin Heidelberg New York, pp. 258\u2013287"},{"key":"25_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J., Wright S.J. (1999) Numerical optimization. Springer, Berlin Heidelberg New York"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R. Polyak","year":"1992","unstructured":"Polyak R. (1992) Modified barrier functions (theory and methods). Math. Program. 54, 177\u2013222","journal-title":"Math. Program."},{"key":"25_CR18","volume-title":"Numerical Methods for Nonlinear Algebraic Equations","author":"M.J.D. Powell","year":"1970","unstructured":"Powell M.J.D. (1970) A hybrid method for nonlinear equations. In: Rabinowitz P. (ed) Numerical Methods for Nonlinear Algebraic Equations. Gordon and Breach, New York"},{"key":"25_CR19","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02169154","volume":"16","author":"C.H. Reinsch","year":"1971","unstructured":"Reinsch C.H. (1971) Smoothing by spline functions II. Numer. Math.16, 451\u2013454","journal-title":"Numer. Math."},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"G.A. Shultz","year":"1985","unstructured":"Shultz G.A., Schnabel R.B., Byrd R.H. (1985) A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal. 22, 47\u201367","journal-title":"SIAM J. Numer. Anal."},{"key":"25_CR21","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1137\/0719026","volume":"19","author":"D.C. Sorensen","year":"1982","unstructured":"Sorensen D.C. (1982) Newton\u2019s method with a model trust region modification. SIAM J. Numer. Anal. 19, 404\u2013426","journal-title":"SIAM J. Numer. Anal."},{"key":"25_CR22","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T. Steihaug","year":"1983","unstructured":"Steihaug T. (1983) The conjugate gradient method and trust regions in large-scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637","journal-title":"SIAM J. Numer. Anal."},{"key":"25_CR23","unstructured":"Toint, P.L.: Towards an efficient sparsity exploiting newton method for minimization. In: Duff, I.S. (ed.) Sparse Matrices and Their Uses, Institute of Mathematics and its Applications Conference Series, xii+387 Academic Press, Inc. London (1981)"},{"key":"25_CR24","first-page":"265","volume-title":"Numerical Linear Algebra and Optimization, Proceeding of the 2003 International Conference on Numerical Optimization and Linear Algebra","author":"Z.H. Wang","year":"2004","unstructured":"Wang Z.H., Wen Z.W., Yuan Y. (2004) A subspace trust region method for large scale unconstrained optimization. In: Yuan Y. (ed) Numerical Linear Algebra and Optimization, Proceeding of the 2003 International Conference on Numerical Optimization and Linear Algebra. Science Press, Beijing, pp. 265\u2013274"},{"key":"25_CR25","unstructured":"Yuan, Y.: A Subspace Trust Region Algorithm. In: Presented at the Conference of Multiscale Optimization Methods and Applications, Center for Applied Optimization, University of Florida, USA, 26\u201328, February 2004"},{"issue":"3","key":"25_CR26","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S105262349627523X","volume":"9","author":"J. Zhang","year":"1999","unstructured":"Zhang J., Xu C. (1999) A class of indefinite dogleg path methods for unconstrained minimization. SIAM J. Optim. 9(3): 646\u2013667","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0025-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0025-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0025-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:01Z","timestamp":1559109001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0025-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,22]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,1,30]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0025-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,22]]}}}