{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:14:53Z","timestamp":1774437293262,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["15-11-30022"],"award-info":[{"award-number":["15-11-30022"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10589-017-9957-y","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:50:17Z","timestamp":1508806217000},"page":"73-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming"],"prefix":"10.1007","volume":"71","author":[{"given":"Renato","family":"De Leone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4721-8114","authenticated-orcid":false,"given":"Giovanni","family":"Fasano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaroslav D.","family":"Sergeyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"key":"9957_CR1","doi-asserted-by":"crossref","unstructured":"Amodio, P., Iavernaro, F., Mazzia, F., Mukhametzhanov, M.S., Sergeyev, Y.D.: A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic. Math. Comput. Simulat. 141, 24\u201339 (2017)","DOI":"10.1016\/j.matcom.2016.03.007"},{"key":"9957_CR2","doi-asserted-by":"crossref","unstructured":"Cococcioni, M., Pappalardo, M., Sergeyev, Y.D.: Towards lexicographic multi-objective linear programming using grossone methodology. In: Sergeyev, Y.D., Kvasov, D.E., Dell\u2019Accio, F., Mukhametzhanov, M.S. (eds.) Proceedings of the 2nd International Conference on \u201cNumerical Computations: Theory and Algorithms\u201d, vol.\u00a01776, p. 090040. AIP Publishing, New York (2016)","DOI":"10.1063\/1.4965404"},{"key":"9957_CR3","volume-title":"Trust-Region Methods. MPS\u2013SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS\u2013SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"16","key":"9957_CR4","first-page":"8077","volume":"218","author":"L D\u2019Alotto","year":"2012","unstructured":"D\u2019Alotto, L.: Cellular automata using infinite computations. Appl. Math. Comput. 218(16), 8077\u20138082 (2012)","journal-title":"Appl. Math. Comput."},{"key":"9957_CR5","first-page":"15","volume":"255","author":"L D\u2019Alotto","year":"2015","unstructured":"D\u2019Alotto, L.: A classification of one-dimensional cellular automata using infinite computations. Appl. Math. Comput. 255, 15\u201324 (2015)","journal-title":"Appl. Math. Comput."},{"issue":"16","key":"9957_CR6","first-page":"8029","volume":"218","author":"S Cosmis De","year":"2012","unstructured":"De Cosmis, S., De Leone, R.: The use of grossone in mathematical programming and operations research. Appl. Math. Comput. 218(16), 8029\u20138038 (2012)","journal-title":"Appl. Math. Comput."},{"key":"9957_CR7","unstructured":"De Leone, R.: Nonlinear programming and grossone: quadratic programming and the role of constraint qualifications. Appl. Math. Comput. 318, 290\u2013297 (2018)"},{"key":"9957_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1080\/10556780410001689234","volume":"3\u20134","author":"G Fasano","year":"2004","unstructured":"Fasano, G.: Conjugate gradient (CG)-type method for the solution of Newton\u2019s equation within optimization frameworks. Optim. Methods Softw. 3\u20134, 267\u2013290 (2004)","journal-title":"Optim. Methods Softw."},{"key":"9957_CR9","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10957-005-2087-1","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar conjugate gradient algorithm for large-scale unconstrained optimization, part 1: theory. J. Optim. Theory Appl. 125, 523\u2013541 (2005a)","journal-title":"J. Optim. Theory Appl."},{"key":"9957_CR10","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10957-005-2088-0","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar conjugate gradient algorithm for large-scale unconstrained optimization, part 2: application. J. Optim. Theory Appl. 125, 543\u2013558 (2005b)","journal-title":"J. Optim. Theory Appl."},{"key":"9957_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10957-006-9119-3","volume":"132","author":"G Fasano","year":"2007","unstructured":"Fasano, G.: Lanczos-conjugate gradient method and pseudoinverse computation, on indefinite and singular systems. J. Optim. Theory Appl. 132, 267\u2013285 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"9957_CR12","doi-asserted-by":"crossref","unstructured":"Fasano, G., Pesenti, R.: Conjugate direction methods and polarity for quadratic hypersurfaces. J. Optim. Theory Appl. (2018) (in press)","DOI":"10.1007\/s10957-017-1180-6"},{"key":"9957_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970937","volume-title":"Iterative Methods for Solving Linear Systems","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative Methods for Solving Linear Systems. SIAM, Philadelphia (1997)"},{"key":"9957_CR14","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newtons method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"9957_CR15","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60, 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"9957_CR16","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"W Hager","year":"2013","unstructured":"Hager, W., Zhang, H.: The limited memory conjugate gradient method. SIAM J. Optim. 23, 2150\u20132168 (2013)","journal-title":"SIAM J. Optim."},{"key":"9957_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6048-6","volume-title":"Conjugate Direction Methods in Optimization","author":"MR Hestenes","year":"1980","unstructured":"Hestenes, M.R.: Conjugate Direction Methods in Optimization. Springer, New York (1980)"},{"key":"9957_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"9957_CR19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF00927440","volume":"5","author":"HY Huang","year":"1970","unstructured":"Huang, H.Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Optim. Theory Appl. 5, 405\u2013423 (1970)","journal-title":"J. Optim. Theory Appl."},{"issue":"16","key":"9957_CR20","first-page":"8099","volume":"218","author":"DI Iudin","year":"2012","unstructured":"Iudin, D.I., Sergeyev, Y.D., Hayakawa, M.: Interpretation of percolation in terms of infinity computations. Appl. Math. Comput. 218(16), 8099\u20138111 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"9957_CR21","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.cnsns.2014.06.031","volume":"20","author":"DI Iudin","year":"2015","unstructured":"Iudin, D.I., Sergeyev, Y.D., Hayakawa, M.: Infinity computations in cellular automaton forest-fire model. Commun. Nonlinear Sci. Numer. Simul. 20(3), 861\u2013870 (2015)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"issue":"16","key":"9957_CR22","first-page":"7979","volume":"218","author":"G Lolli","year":"2012","unstructured":"Lolli, G.: Infinitesimals and infinites in the history of mathematics: a brief survey. Appl. Math. Comput. 218(16), 7979\u20137988 (2012)","journal-title":"Appl. Math. Comput."},{"key":"9957_CR23","first-page":"3","volume":"255","author":"G Lolli","year":"2015","unstructured":"Lolli, G.: Metamathematical investigations on the theory of grossone. Appl. Math. Comput. 255, 3\u201314 (2015)","journal-title":"Appl. Math. Comput."},{"key":"9957_CR24","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/0117118","volume":"17","author":"DG Luenberger","year":"1969","unstructured":"Luenberger, D.G.: Hyperbolic pairs in the method of conjugate gradients. SIAM J. Appl. Math. 17, 1263\u20131267 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"9957_CR25","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1134\/S2070046611030034","volume":"3","author":"M Margenstern","year":"2011","unstructured":"Margenstern, M.: Using grossone to count the number of elements of infinite sets and the connection with bijections. p-Adic Numbers Ultrametr. Anal. Appl. 3(3), 196\u2013204 (2011)","journal-title":"p-Adic Numbers Ultrametr. Anal. Appl."},{"key":"9957_CR26","doi-asserted-by":"crossref","unstructured":"Mazzia, F., Sergeyev, Y.D., Iavernaro, F., Amodio, P., Mukhametzhanov, M.S.: Numerical methods for solving ODEs on the Infinity Computer. In: Sergeyev, Y.D., Kvasov, D.E., Dell\u2019Accio, F., Mukhametzhanov, M.S. (eds.) Proceedings of the 2nd International Conference on \u201cNumerical Computations: Theory and Algorithms\u201d, vol. 1776, p. 090033. AIP Publishing, New York (2016)","DOI":"10.1063\/1.4965397"},{"key":"9957_CR27","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"9957_CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00936162","volume":"43","author":"SS Oren","year":"1984","unstructured":"Oren, S.S.: Planar quasi-Newton algorithms for unconstrained saddlepoint problems. J. Optim. Theory Appl. 43, 167\u2013204 (1984)","journal-title":"J. Optim. Theory Appl."},{"key":"9957_CR29","doi-asserted-by":"crossref","unstructured":"Rizza, D.: Supertasks and numeral systems. In: Sergeyev, Y.D., Kvasov, D.E., Dell\u2019Accio, F., Mukhametzhanov, M.S. (eds.) Proceedings of the 2nd International Conference on \u201cNumerical Computations: Theory and Algorithms\u201d, vol. 1776, p. 090005. AIP Publishing, New York (2016)","DOI":"10.1063\/1.4965369"},{"key":"9957_CR30","volume-title":"Lecture in Projective Geometry","author":"A Seidenberg","year":"2005","unstructured":"Seidenberg, A.: Lecture in Projective Geometry. Dover Publications Inc, Mineola (2005)"},{"key":"9957_CR31","volume-title":"Arithmetic of Infinity","author":"YD Sergeyev","year":"2013","unstructured":"Sergeyev, Y.D.: Arithmetic of Infinity, 2nd edn. Edizioni Orizzonti Meridionali, Cosenza (2013)","edition":"2"},{"issue":"1","key":"9957_CR32","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.chaos.2006.11.001","volume":"33","author":"YD Sergeyev","year":"2007","unstructured":"Sergeyev, Y.D.: Blinking fractals and their quantitative analysis using infinite and infinitesimal numbers. Chaos Solitons Fractals 33(1), 50\u201375 (2007)","journal-title":"Chaos Solitons Fractals"},{"issue":"4","key":"9957_CR33","doi-asserted-by":"crossref","first-page":"567","DOI":"10.15388\/Informatica.2008.231","volume":"19","author":"YD Sergeyev","year":"2008","unstructured":"Sergeyev, Y.D.: A new applied approach for executing computations with infinite and infinitesimal quantities. Informatica 19(4), 567\u2013596 (2008)","journal-title":"Informatica"},{"issue":"5","key":"9957_CR34","doi-asserted-by":"crossref","first-page":"3042","DOI":"10.1016\/j.chaos.2009.04.013","volume":"42","author":"YD Sergeyev","year":"2009","unstructured":"Sergeyev, Y.D.: Evaluating the exact infinitesimal values of area of Sierpinski\u2019s carpet and volume of Menger\u2019s sponge. Chaos Solitons Fractals 42(5), 3042\u20133046 (2009)","journal-title":"Chaos Solitons Fractals"},{"issue":"2","key":"9957_CR35","first-page":"95","volume":"68","author":"YD Sergeyev","year":"2010","unstructured":"Sergeyev, Y.D.: Lagrange lecture: methodology of numerical computations with infinities and infinitesimals. Rendiconti del Seminario Matematico dell\u2019Universit\u00e0 e del Politecnico di Torino 68(2), 95\u2013113 (2010)","journal-title":"Rendiconti del Seminario Matematico dell\u2019Universit\u00e0 e del Politecnico di Torino"},{"issue":"4","key":"9957_CR36","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s11590-010-0221-y","volume":"5","author":"YD Sergeyev","year":"2011","unstructured":"Sergeyev, Y.D.: Higher order numerical differentiation on the Infinity Computer. Optim. Lett. 5(4), 575\u2013585 (2011a)","journal-title":"Optim. Lett."},{"issue":"4","key":"9957_CR37","doi-asserted-by":"crossref","first-page":"559","DOI":"10.15388\/Informatica.2011.342","volume":"22","author":"YD Sergeyev","year":"2011","unstructured":"Sergeyev, Y.D.: Using blinking fractals for mathematical modelling of processes of growth in biological systems. Informatica 22(4), 559\u2013576 (2011b)","journal-title":"Informatica"},{"issue":"22","key":"9957_CR38","first-page":"10668","volume":"219","author":"YD Sergeyev","year":"2013","unstructured":"Sergeyev, Y.D.: Solving ordinary differential equations by working with infinitesimals numerically on the Infinity Computer. Appl. Math. Comput. 219(22), 10668\u201310681 (2013)","journal-title":"Appl. Math. Comput."},{"key":"9957_CR39","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D.: Computations with grossone-based infinities. In: Calude, C.S., Dinneen, M.J. (eds.) Unconventional Computation and Natural Computation: Proceedings of the 14th International Conference UCNC 2015, vol. LNCS 9252, pp. 89\u2013106. Springer, New York (2015)","DOI":"10.1007\/978-3-319-21819-9_6"},{"issue":"1","key":"9957_CR40","first-page":"111","volume":"8","author":"YD Sergeyev","year":"2015","unstructured":"Sergeyev, Y.D.: Un semplice modo per trattare le grandezze infinite ed infinitesime. Mat. nella Soc. nella Cult. Riv. della Unione Mat. Ital. 8(1), 111\u2013147 (2015)","journal-title":"Mat. nella Soc. nella Cult. Riv. della Unione Mat. Ital."},{"issue":"1\u20133","key":"9957_CR41","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cnsns.2015.07.004","volume":"31","author":"YD Sergeyev","year":"2016","unstructured":"Sergeyev, Y.D.: The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area. Commun. Nonlinear Sci. Numer. Simul. 31(1\u20133), 21\u201329 (2016)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"9957_CR42","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D.: Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Surveys Math. Sci. (2017) (in press)","DOI":"10.4171\/EMSS\/4-2-3"},{"issue":"3","key":"9957_CR43","doi-asserted-by":"crossref","first-page":"425","DOI":"10.15388\/Informatica.2010.298","volume":"21","author":"YD Sergeyev","year":"2010","unstructured":"Sergeyev, Y.D., Garro, A.: Observability of turing machines: a refinement of the theory of computation. Informatica 21(3), 425\u2013454 (2010)","journal-title":"Informatica"},{"issue":"2","key":"9957_CR44","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s11227-013-0894-y","volume":"65","author":"YD Sergeyev","year":"2013","unstructured":"Sergeyev, Y.D., Garro, A.: Single-tape and multi-tape turing machines through the lens of the grossone methodology. J. Supercomput. 65(2), 645\u2013663 (2013)","journal-title":"J. Supercomput."},{"issue":"1","key":"9957_CR45","first-page":"3","volume":"12","author":"YD Sergeyev","year":"2016","unstructured":"Sergeyev, Y.D., Mukhametzhanov, M.S., Mazzia, F., Iavernaro, F., Amodio, P.: Numerical methods for solving initial value problems on the Infinity Computer. Int. J. Unconv. Comput. 12(1), 3\u201323 (2016)","journal-title":"Int. J. Unconv. Comput."},{"key":"9957_CR46","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (1997)"},{"issue":"16","key":"9957_CR47","first-page":"8187","volume":"218","author":"MC Vita","year":"2012","unstructured":"Vita, M.C., Bartolo, S.D., Fallico, C., Veltri, M.: Usage of infinitesimals in the Menger\u2019s Sponge model of porosity. Appl. Math. Comput. 218(16), 8187\u20138196 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"16","key":"9957_CR48","first-page":"8131","volume":"218","author":"A \u017dilinskas","year":"2012","unstructured":"\u017dilinskas, A.: On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions. Appl. Math. Comput. 218(16), 8131\u20138136 (2012)","journal-title":"Appl. Math. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9957-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9957-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9957-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T09:53:44Z","timestamp":1603187624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9957-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9957"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9957-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,23]]}}}