{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:06Z","timestamp":1740122766947,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T00:00:00Z","timestamp":1631404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T00:00:00Z","timestamp":1631404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"This work was supported by the Institute of Computer Science"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10589-021-00318-y","type":"journal-article","created":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T18:02:46Z","timestamp":1631469766000},"page":"755-780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two limited-memory optimization methods with minimum violation of the previous secant conditions"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5870-3732","authenticated-orcid":false,"given":"Jan","family":"Vl\u010dek","sequence":"first","affiliation":[]},{"given":"Ladislav","family":"Luk\u0161an","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,12]]},"reference":[{"key":"318_CR1","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Opt. 10, 147\u2013161 (2008)","journal-title":"Adv. Model. Opt."},{"key":"318_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A.R., Gould, N., Toint, P.L.: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"318_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representation of quasi-Newton matrices and their use in limited memory methods. Math. Prog. 63, 129\u2013156 (1994)","journal-title":"Math. Prog."},{"key":"318_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/1021091","volume":"21","author":"JE Dennis Jr","year":"1979","unstructured":"Dennis, J.E., Jr., Schnabel, R.B.: Least change secant updates for quasi-Newton methods. SIAM Rev. 21, 443\u2013459 (1979)","journal-title":"SIAM Rev."},{"key":"318_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Prog. 91, 201\u2013213 (2002)","journal-title":"Math. Prog."},{"key":"318_CR6","volume-title":"Special matrices and their applications in numerical mathematics","author":"M Fiedler","year":"2008","unstructured":"Fiedler, M.: Special matrices and their applications in numerical mathematics, 2nd edn. Dover Publications, Mineola (2008)","edition":"2"},{"key":"318_CR7","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, Chichester (1987)"},{"key":"318_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG-DESCENT, a Conjugate Gradient Method with Guaranteed Descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"318_CR9","unstructured":"Hu, Y.F., Storey, C.: Motivating Quasi-Newton Updates by Preconditioned Conjugate Gradient Methods, Math. Report A\u00a0150, Department of Mathematical Sciences, Loughborough University of Technology, England (1991)"},{"key":"318_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"D Li","year":"2001","unstructured":"Li, D., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"318_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Prog. 45, 503\u2013528 (1989)","journal-title":"Math. Prog."},{"key":"318_CR12","doi-asserted-by":"crossref","unstructured":"Luk\u0161an, L., Matonoha, C., Vl\u010dek, J.: Algorithm 896: LSA - Algorithms for Large-Scale Optimization, ACM Trans. Math. Softw. 36, 16:1-16:29 (2009)","DOI":"10.1145\/1527286.1527290"},{"key":"318_CR13","volume-title":"Sparse Test Problems for Unconstrained Optimization, Report V-1064","author":"L Luk\u0161an","year":"2010","unstructured":"Luk\u0161an, L., Matonoha, C., Vl\u010dek, J.: Sparse Test Problems for Unconstrained Optimization, Report V-1064. ICS AS CR, Prague (2010). (http:\/\/hdl.handle.net\/11104\/0181697)"},{"key":"318_CR14","volume-title":"Modified CUTE Problems for Sparse Unconstrained Optimization, Report V-1081","author":"L Luk\u0161an","year":"2010","unstructured":"Luk\u0161an, L., Matonoha, C., Vl\u010dek, J.: Modified CUTE Problems for Sparse Unconstrained Optimization, Report V-1081. ICS AS CR, Prague (2010). (http:\/\/hdl.handle.net\/11104\/0189238)"},{"key":"318_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0377-0427(00)00420-9","volume":"124","author":"L Luk\u0161an","year":"2000","unstructured":"Luk\u0161an, L., Spedicato, E.: Variable metric methods for unconstrained optimization and nonlinear least squares. J. Comput. Appl. Math. 124, 61\u201395 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"318_CR16","unstructured":"Luk\u0161an, L., T\u016fma, M., Matonoha, C., Vl\u010dek, J., Rame\u0161ov\u00e1, N., \u0160i\u0161ka, M., Hartman, J.: UFO\u00a02017. Interactive System for Universal Functional Optimization, Report V-1252, ICS AS CR, Prague (2017). http:\/\/www.cs.cas.cz\/luksan\/ufo.pdf"},{"key":"318_CR17","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comp. 35, 773\u2013782 (1980)","journal-title":"Math. Comp."},{"key":"318_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer, New York (1999)"},{"key":"318_CR19","doi-asserted-by":"crossref","unstructured":"Schnabel, R.B.: Quasi-Newton Methods Using Multiple Secant Equations, Technical Report CU-CS-247-83. University of Colorado at Boulder, USA, Department of Computer Science (1983)","DOI":"10.21236\/ADA131444"},{"key":"318_CR20","first-page":"800","volume":"219","author":"J Vl\u010dek","year":"2012","unstructured":"Vl\u010dek, J., Luk\u0161an, L.: A conjugate directions approach to improve the limited-memory BFGS method. Appl. Math. Comput. 219, 800\u2013809 (2012)","journal-title":"Appl. Math. Comput."},{"key":"318_CR21","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1080\/10556788.2014.955101","volume":"30","author":"J Vl\u010dek","year":"2015","unstructured":"Vl\u010dek, J., Luk\u0161an, L.: A modified limited-memory BNS method for unconstrained minimization based on conjugate directions idea. Optim. Meth. Softw. 30, 616\u2013633 (2015)","journal-title":"Optim. Meth. Softw."},{"key":"318_CR22","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11075-018-0513-3","volume":"80","author":"J Vl\u010dek","year":"2019","unstructured":"Vl\u010dek, J., Luk\u0161an, L.: Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization. Num. Alg. 80, 957\u2013987 (2019)","journal-title":"Num. Alg."},{"key":"318_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.cam.2018.10.054","volume":"351","author":"J Vl\u010dek","year":"2019","unstructured":"Vl\u010dek, J., Luk\u0161an, L.: A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions. J. Comput. Appl. Math. 351, 14\u201328 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"318_CR24","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.cam.2017.05.030","volume":"327","author":"G Yuan","year":"2018","unstructured":"Yuan, G., Sheng, Z., Wang, B., Hu, W., Li, Ch.: The global convergence of a modified BFGS method for nonconvex functions. J. Comput. Appl. Math. 327, 274\u2013294 (2018)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00318-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00318-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00318-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T17:38:38Z","timestamp":1637257118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00318-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,12]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["318"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00318-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,9,12]]},"assertion":[{"value":"27 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}