{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:12Z","timestamp":1751367972721},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bf00130832","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T10:34:18Z","timestamp":1099564458000},"page":"375-388","source":"Crossref","is-referenced-by-count":3,"title":["A trajectory algorithm based on the gradient method I. The search on the quasioptimal trajectories"],"prefix":"10.1007","volume":"1","author":[{"given":"E. G.","family":"Sturua","sequence":"first","affiliation":[]},{"given":"S. K.","family":"Zavriev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"231","volume-title":"Numerical Methods to Nonlinear Optimization","author":"F. Branin","year":"1972","unstructured":"Branin F. and Hoo S. (1972), A Method for Finding Multiple Extrema of a Function of n Variables, in F. A. Lootsma (ed.), Numerical Methods to Nonlinear Optimization, London, New-York: Academic Press, pp. 231?237."},{"issue":"5","key":"CR2","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1147\/rd.165.0504","volume":"16","author":"F. H. Branin","year":"1972","unstructured":"Branin F. H. (1972), Widely Convergent Methods for Finding Multiple Solutions of Simultaneous Nonlinear Equations, IBM J. Res. Dev. 16 (5), 504?522.","journal-title":"IBM J. Res. Dev."},{"key":"CR3","first-page":"29","volume-title":"Towards Global Optimization","author":"J. Gomulka","year":"1975","unstructured":"Gomulka J. (1975), Remarks on Branin's Method for Solving Nonlinear Equations in L. C. W. Dixon and G. P. Szeg\u00f6 (eds.), Towards Global Optimization, Amsterdam, Oxford: North-Holland, New York: Amer. Elsevier, pp. 29?54."},{"issue":"3","key":"CR4","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF02592065","volume":"36","author":"I. Diener","year":"1986","unstructured":"Diener I. (1986), Trajectory Nets Connecting All Critical Points of a Smooth Function, Math. Progr. 36 (3), 340?352.","journal-title":"Math. Progr."},{"key":"CR5","series-title":"Proc. 9th International Math. Prog. Symp. Budapest, 1976","first-page":"539","volume-title":"Survey of Mathematical Programming","author":"H. Yamashita","year":"1979","unstructured":"Yamashita H. (1979), A Continuous Path Method of Optimization and Its Applications to Global Optimization, Survey of Mathematical Programming (Proc. 9th International Math. Prog. Symp. Budapest, 1976), Amsterdam, North-Holland, V. 1., pp. 539?546."},{"key":"CR6","first-page":"107","volume-title":"Towards Global Optimization","author":"G. Treccani","year":"1975","unstructured":"Treccani G. (1975), On the Convergence of Branin's Method: A Counter Example, in L. C. W. Dixon and G. P. Szeg\u00f6 (eds.), Towards Global Optimization, Amsterdam, Oxford: North-Holland, New York: Amer., Elsevier, pp. 107?116."},{"key":"CR7","volume-title":"Nonstationary Mathematical Programming Processes","author":"I. I. Eremin","year":"1979","unstructured":"Eremin I. I. and Mazurov V. D. (1979), Nonstationary Mathematical Programming Processes, Nauka, Moscow (in Russian)."},{"key":"CR8","first-page":"89","volume":"4","author":"A. A. Gaivoronski","year":"1978","unstructured":"Gaivoronski A. A. (1978), On Nonstationary Stochastic Programming Problems, Kibernetika 4, 89?92.","journal-title":"Kibernetika"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Dem'janov, V. F. and Vasil'jev, K. S. (1985), Nondifferentiable Optimization, Nauka (in Russian).","DOI":"10.1007\/978-1-4613-8268-3"},{"key":"CR10","first-page":"111","volume-title":"Computing Complexes and the Modelling of Complicated Systems","author":"S. K. Zavriev","year":"1989","unstructured":"Zavriev S. K. (1989), The Finite ?-Subgradient Algorithm for the Approximate Solving of Parametrical Programming Problems, in P. S. Krasnoschokov and L. N. Korolev (eds.), Computing Complexes and the Modelling of Complicated Systems, MGU, Moscow, pp. 111?117 (in Russian)."},{"key":"CR11","first-page":"239","volume-title":"Minimization Algorithms Mathematic Theories and Computer Results","author":"G. Treccani","year":"1972","unstructured":"Treccani G., Trabattoni L. and Szeg\u00f6 G. P. (1972), A Numerical Method for the Isolation of Minima, in G. P. Szeg\u00f6 (ed.), Minimization Algorithms Mathematic Theories and Computer Results, London, New-York: Academic Press, pp. 239?289."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00130832.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00130832\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00130832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T19:52:45Z","timestamp":1585943565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00130832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991]]}},"alternative-id":["BF00130832"],"URL":"https:\/\/doi.org\/10.1007\/bf00130832","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}