{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T12:05:39Z","timestamp":1775909139767,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:00:00Z","timestamp":1615939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:00:00Z","timestamp":1615939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10462-021-09984-0","type":"journal-article","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T18:02:53Z","timestamp":1616004173000},"page":"1121-1147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Tangent-cut optimizer on gradient descent: an approach towards Hybrid Heuristics"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7082-023X","authenticated-orcid":false,"given":"Saptarshi","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhrapratim","family":"Nath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumagna","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Utsha","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,17]]},"reference":[{"key":"9984_CR1","unstructured":"Akhtar A, (2019) Evolution of Ant Colony Optimization Algorithm\u2014A brief literature review. Preprint at https:\/\/arxiv.org\/abs\/1908.08007[cs.NE] 1\u201311"},{"issue":"7","key":"9984_CR2","first-page":"1748","volume":"6","author":"S Akram","year":"2015","unstructured":"Akram S, Ann Q (2015) Newton Raphson Method. Int J Sci Eng Res 6(7):1748\u20131752","journal-title":"Int J Sci Eng Res"},{"key":"9984_CR3","doi-asserted-by":"crossref","unstructured":"Bottou L (2010) Large-scale machine learning with stochastic gradient descent. In 19th International Conference on Computational Statistics, Paris, France 177\u2013186","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"9984_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume":"136","author":"K Chakhlevitch","year":"2008","unstructured":"Chakhlevitch K, Cowling P (2008) Hyperheuristics: recent developments. Adapt Multilevel Metaheuristics Stud Comput Intell 136:3\u201329","journal-title":"Adapt Multilevel Metaheuristics Stud Comput Intell"},{"key":"9984_CR5","unstructured":"Chee J, Toulis P (2018) Convergence diagnostics for stochastic gradient descent with constant learning rate. https:\/\/arxiv.org\/abs\/1710.06382[stat.ML] 1\u201336"},{"key":"9984_CR6","series-title":"Springer","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"International conference on the practice and theory of automated timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A hyperheuristic approach to scheduling a sales summit. In: Burke E, Erben W (eds) International conference on the practice and theory of automated timetabling III, vol 2079. Springer. Berlin, Heidelberg, pp 176\u2013190"},{"issue":"8","key":"9984_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ins.2020.08.040","volume":"547","author":"G D\u2019Angelo","year":"2021","unstructured":"D\u2019Angelo G, Palmieri F (2021) GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems. Inf Sci 547(8):136\u2013162","journal-title":"Inf Sci"},{"key":"9984_CR8","unstructured":"Dauphin YN, Vries H, Chung J, Bengio Y (2015) Equilibrated adaptive learning rates for non-convex optimization. Preprint at https:\/\/arxiv.org\/abs\/1502.04390[cs.LG] 1\u201310"},{"key":"9984_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18272-3","volume-title":"New horizons in evolutionary robotics","author":"S Doncieux","year":"2011","unstructured":"Doncieux S, Mouret JB, Bredeche N, Padois V (2011) Evolutionary robotics exploring new horizons. In: Doncieux S, Bred\u00e8che N, Mouret J-B (eds) New horizons in evolutionary robotics. Springer, Berlins"},{"key":"9984_CR10","unstructured":"Dozat T (2016) Incorporating Nesterov Momentum into Adam. International Conference on Learning Representation 2016, San Juan, PR 1\u20134"},{"issue":"1","key":"9984_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1108\/IJICC-02-2014-0005","volume":"7","author":"H Duan","year":"2014","unstructured":"Duan H, Qiao P (2014) Pigeon-inspired optimization: a new swarm intelligence optimizer for robot path planning. Int J Intell Comput Cybern 7(1):24\u201337","journal-title":"Int J Intell Comput Cybern"},{"key":"9984_CR12","unstructured":"Gitman I, Dilipkumar D, Parr B (2018) Convergence analysis of gradient descent algorithms with proportional updates. Preprint at https:\/\/arxiv.org\/abs\/1801.03137 [cs.LG] 1\u201312"},{"key":"9984_CR13","volume-title":"Handbook of metaheuristics. International series in operations research and management science","author":"D Henderson","year":"2003","unstructured":"Henderson D, Jacobson SH, Johnson AW (2003) The theory and practice of simulated annealing. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. International series in operations research and management science. Springer, Boston"},{"issue":"1","key":"9984_CR14","first-page":"843","volume":"14","author":"P Hennig","year":"2013","unstructured":"Hennig P, Kiefel M (2013) Quasi-Newton methods: a new direction. J Mach Learn Res 14(1):843\u2013865","journal-title":"J Mach Learn Res"},{"key":"9984_CR15","unstructured":"Kamrani AK, Gonzalez R (2002) A heuristic genetic algorithm methodology. Proceedings of the 5th Biannual World Automation Congress, Orlando, FL 71\u201376"},{"key":"9984_CR16","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. Proc. of IEEE International Conference on Neural Networks, Perth, WA 4: 1942\u20131948"},{"key":"9984_CR17","doi-asserted-by":"crossref","unstructured":"Khirirat S, Feyzmahdavian HR, Johansson M (2017) Mini-batch gradient descent: Faster convergence under data sparsity. In 2017 IEEE 56th Annual Conference on Decision and Control, Melbourne, VIC 2880\u20132887","DOI":"10.1109\/CDC.2017.8264077"},{"key":"9984_CR18","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. International Conference on Learning Representations, San Diego, CA, 1\u201313"},{"key":"9984_CR19","unstructured":"Kokash N (2005) An introduction to heuristic algorithms. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.105.8050. Accessed 22 May 2020 1\u20138"},{"issue":"6","key":"9984_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3065386","volume":"60","author":"A Krizhevsky","year":"2017","unstructured":"Krizhevsky A, Sutskever I, Hinton GE (2017) ImageNet classification with deep convolutional neural networks. Commun ACM 60(6):84\u201390","journal-title":"Commun ACM"},{"key":"9984_CR21","first-page":"251","volume":"17","author":"C Lemar\u00e9chal","year":"2012","unstructured":"Lemar\u00e9chal C (2012) Cauchy and the gradient method. Doc Math 17:251\u2013254","journal-title":"Doc Math"},{"issue":"7","key":"9984_CR22","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1016\/j.cor.2008.09.004","volume":"36","author":"R Lewis","year":"2009","unstructured":"Lewis R (2009) A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing. Comput Oper Res 36(7):2295\u20132310","journal-title":"Comput Oper Res"},{"key":"9984_CR23","doi-asserted-by":"crossref","unstructured":"Li X, Zhao H, Jin L (2012) An Algorithm for Global Optimization Problems Based on ABC-BFGS. In 2012 Fifth International Joint Conference on Computational Sciences and Optimization, Harbin 881\u2013884","DOI":"10.1109\/CSO.2012.197"},{"key":"9984_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02022092","volume":"21","author":"GE Liepins","year":"1989","unstructured":"Liepins GE, Hilliard MR (1989) Genetic algorithms: foundations and applications. Ann Oper Res 21:31\u201357","journal-title":"Ann Oper Res"},{"key":"9984_CR25","unstructured":"Liu L, Jiang H, He P, Chen W, Liu X, Gao J, Han J (2020) On the Variance of the Adaptive Learning Rate and Beyond. Preprint at https:\/\/arxiv.org\/abs\/1908.03265[cs.LG] 1\u201314"},{"key":"9984_CR26","volume-title":"Handbook of Metaheuristics. International Series in Operations Research and Management Science","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. In: Glover F, Kochenberger GA (eds) Handbook of Metaheuristics. International Series in Operations Research and Management Science. Springer, Boston"},{"issue":"22","key":"9984_CR27","first-page":"1","volume":"4","author":"M Najafabadi","year":"2017","unstructured":"Najafabadi M, Khoshgoftaar T, Villanustre F, Holt J (2017) Large-scale distributed L-BFGS. J Big Data 4(22):1\u201317","journal-title":"J Big Data"},{"key":"9984_CR28","doi-asserted-by":"publisher","unstructured":"Nath S, Sing JK, Sarkar SK, (2018) Performance comparison of PSO and its new variants in the context of VLSI global routing. Particle swarm optimization with applications, Pakize Erdo\u011fmu\u015f, IntechOpen 1\u201321. https:\/\/doi.org\/10.5772\/intechopen.72811. Available from: https:\/\/www.intechopen.com\/books\/particle-swarm-optimization-with-applications\/performance-comparison-of-pso-and-its-new-variants-in-the-context-ofvlsi-global-routing","DOI":"10.5772\/intechopen.72811"},{"key":"9984_CR29","doi-asserted-by":"crossref","unstructured":"Nath S, Gupta S, Biswas S, Banerjee R, Sing JK, Sarkar SK (2020) GPSO Hybrid Algorithm for Rectilinear Steiner Tree Optimization. In 2020 IEEE VLSI DEVICE CIRCUIT AND SYSTEM, Kolkata, WB 365\u2013369","DOI":"10.1109\/VLSIDCS47293.2020.9179861"},{"issue":"2","key":"9984_CR30","first-page":"543","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov Y (1983) A method for unconstrained convex minimization problem with the rate of convergence O(1\/k2). Soviet Math Dokl 27(2):543\u2013547","journal-title":"Soviet Math Dokl"},{"issue":"1","key":"9984_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.asoc.2011.08.037","volume":"12","author":"MM Noel","year":"2012","unstructured":"Noel MM (2012) A new gradient based particle swarm optimization algorithm for accurate computation of global minimum. Appl Soft Comput 12(1):353\u2013359","journal-title":"Appl Soft Comput"},{"key":"9984_CR32","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice JR (1976) The algorithm selection problem. Adv Comput 15:65\u2013118","journal-title":"Adv Comput"},{"key":"9984_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search methodologies","author":"P Ross","year":"2005","unstructured":"Ross P (2005) Hyper-Heuristics. In: Burke EK, Kendall G (eds) Search methodologies. Springer, Boston. https:\/\/doi.org\/10.1007\/0-387-28356-0_17"},{"key":"9984_CR34","unstructured":"Ruder S (2017) An overview of gradient descent optimization algorithms. Preprint at https:\/\/arxiv.org\/abs\/1609.04747 [cs.LG] 1\u201314"},{"key":"9984_CR35","unstructured":"Ryser-Welch P, Miller JF (2014) A review of hyper-heuristic frameworks. In 50th Annual Convention of the AISB 1\u20137"},{"key":"9984_CR36","doi-asserted-by":"crossref","unstructured":"Salvatierra MA (2013) Quasi-Newton optimization algorithm to solve molecular distance geometry problems. In 2013 XXXIX Latin American Computing Conference, Naiguata 1\u20133","DOI":"10.1109\/CLEI.2013.6670603"},{"issue":"5","key":"9984_CR37","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39(5):875\u2013889","journal-title":"Comput Oper Res"},{"key":"9984_CR38","unstructured":"Sutskever I, Martens J, Dahl G, Hinton G (2013) On the importance of initialization and momentum in deep learning. Proceedings of the 30th International Conference on Machine Learning, Atlanta, Ga, 28(3): 1139\u20131147"},{"key":"9984_CR39","doi-asserted-by":"crossref","unstructured":"Veenhuis C (2010) Binary invasive weed optimization. In 2010 Second World Congress on Nature and Biologically Inspired Computing, Fukuoka 449\u2013454","DOI":"10.1109\/NABIC.2010.5716311"},{"key":"9984_CR40","volume-title":"Handbook of metaheuristics, international series in operations research and management science","author":"C Voudouris","year":"2003","unstructured":"Voudouris C, Tsang EPK (2003) Guided local search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics, international series in operations research and management science. Springer, Boston"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-021-09984-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-021-09984-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-021-09984-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T20:03:27Z","timestamp":1644609807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-021-09984-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,17]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["9984"],"URL":"https:\/\/doi.org\/10.1007\/s10462-021-09984-0","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,17]]},"assertion":[{"value":"5 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors of this article declare no competing interest related to this research work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}