{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:50:52Z","timestamp":1760057452494,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>In this paper, we study a recently established s-hybrid approach for generating gradient descent methods for solving optimization tasks. We present an s-hybrid variant of the accelerated double-direction method. The results obtained based on convergence analysis confirm the first-order consistency of the newly defined method on a set of strictly convex quadratic functions.<\/jats:p>","DOI":"10.3390\/axioms14020131","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T05:34:32Z","timestamp":1739252072000},"page":"131","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An S-Hybridization Technique Using Two-Directional Optimization"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4182-4458","authenticated-orcid":false,"given":"Vladimir","family":"Rako\u010devi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, Vi\u0161egradska 33, 18108 Ni\u0161, Serbia"},{"name":"Serbian Academy of Sciences and Arts, Kneza Mihaila 35, 11000 Belgrade, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5073-143X","authenticated-orcid":false,"given":"Milena J.","family":"Petrovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Pri\u0161tina in Kosovska Mitrovica, Lole Ribara 29, 38220 Kosovska Mitrovica, Serbia"}]}],"member":"1968","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"ref_1","first-page":"11","article-title":"A multi-step curve search algorithm in nonlinear optimization: Nondifferentiable case","volume":"25","year":"2010","journal-title":"Facta Univ. Ser. Inform."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"965104","DOI":"10.1155\/2014\/965104","article-title":"Accelerated Double Direction Method For Solving Unconstrained Optimization Problems","volume":"2014","author":"Stanimirovic","year":"2014","journal-title":"Math. Probl. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","article-title":"Minimization of functions having Lipschitz first partial derivatives","volume":"6","author":"Armijo","year":"1966","journal-title":"Pac. J. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","article-title":"Convergence conditions for ascent methods","volume":"11","author":"Wolfe","year":"1968","journal-title":"SIAM Rev."},{"key":"ref_5","first-page":"147","article-title":"On steepest descent","volume":"3","author":"Goldstein","year":"1965","journal-title":"SIAM J. Control"},{"key":"ref_6","unstructured":"Petrovi\u0107, M. (2006). A Truly Third Order Finite Volume Scheme on Quadrilateral Mesh. [Master\u2019s Thesis, Lund University]."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/03060240X","article-title":"Conservative Logarithmic Reconstruction and Finite Volume Methods","volume":"27","author":"Artebrant","year":"2005","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/040620187","article-title":"Limiter-free Third Order Logarithmic Reconstruction","volume":"28","author":"Artebrant","year":"2006","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10915-005-9063-7","article-title":"Third order acurate non-polynomial reconstruction on ractangular and triangular meshes","volume":"30","author":"Artebrant","year":"2007","journal-title":"J. Sci. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10915-004-4927-9","article-title":"A Bi-Hyperbolic Finite Volume Method on Quadrilateral Meshes","volume":"26","author":"Schroll","year":"2006","journal-title":"J. Sci. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/BF02193062","article-title":"Efficient line search algorithm for unconstrained optimization","volume":"85","author":"Potra","year":"1995","journal-title":"J. Optim. Theory Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11075-006-9023-9","article-title":"An acceleration of gradient descent algoritham with backtracing for unconstrained optimization","volume":"42","author":"Andrei","year":"2006","journal-title":"Numer. Algorithms"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/10556788.2010.501379","article-title":"An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization","volume":"27","author":"Andrei","year":"2012","journal-title":"Optim. Methods Softw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1014838419611","article-title":"Modified two-point step-size gradient methods for unconstrained optimization","volume":"22","author":"Dai","year":"2002","journal-title":"Comput. Optim. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1093\/imanum\/23.3.377","article-title":"Alternate minimization gradient method","volume":"23","author":"Dai","year":"2003","journal-title":"IMA J. Numer. Anal."},{"key":"ref_17","first-page":"35","article-title":"Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es","volume":"16","author":"Polak","year":"1969","journal-title":"Rev. Fr. d\u2019Inform. Rech. Op\u00e9r. S\u00e9r. Rouge"},{"key":"ref_18","unstructured":"Petrovi\u0107, M.J., Rako\u010devi\u0107, V., and Ili\u0107, D. (2024). Hybrid optimization models based on S-iteration process. Filomat, 38."},{"key":"ref_19","first-page":"653","article-title":"Fixed points of demicontinuous nearly Lipschitzian mappings in Banach spaces","volume":"46","author":"Sahu","year":"2005","journal-title":"Comment. Math. Univ. Carol."},{"key":"ref_20","first-page":"61","article-title":"Iterative construction of fixed points of nearly asymptotically nonexpansive mappings","volume":"8","author":"Agarwal","year":"2007","journal-title":"J. Nonlinear Convex Anal."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s11075-009-9350-8","article-title":"Accelerated gradient descent methods with line search","volume":"54","year":"2010","journal-title":"Numer. Algorithms"},{"key":"ref_22","unstructured":"Luenberg, D.G., and Ye, Y. (2008). Linear and Nonlinear Programming, Springer Science+Business Media, LLC."},{"key":"ref_23","unstructured":"Ortega, J.M., and Reinboldt, W.C. (1970). Iterative Solution of Nonlinear Equation in Several Variables, Academic."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press.","DOI":"10.1515\/9781400873173"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.cam.2007.12.018","article-title":"Improved Newton\u2019s method with exact line searches to solve quadratic matrix equation","volume":"222","author":"Long","year":"2008","journal-title":"J. Comput. Appl. Math."},{"key":"ref_26","first-page":"761","article-title":"An adaptive nonmomotonic trust region method with curlinear searches","volume":"24","author":"Zhou","year":"2006","journal-title":"J. Comput. Math."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Rako\u010devi\u0107, V., and Petrovi\u0107, M.J. (2022). Comparative analysis over accelerated models for solving unconstrained optimization problems with application of Khan\u2019s hybrid rule. Mathemathics, 10.","DOI":"10.3390\/math10234411"},{"key":"ref_28","first-page":"1","article-title":"An Unconstrained Optimization Test Functions Collection","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/2\/131\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:31:07Z","timestamp":1760027467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/2\/131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,11]]},"references-count":28,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["axioms14020131"],"URL":"https:\/\/doi.org\/10.3390\/axioms14020131","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2025,2,11]]}}}