[{"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Shehu Y, Iyiola OS. Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. 2022;101(1):192-216. doi:10.1080/00036811.2020.1736287","apa":"Shehu, Y., & Iyiola, O. S. (2022). Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. Taylor & Francis. https://doi.org/10.1080/00036811.2020.1736287","short":"Y. Shehu, O.S. Iyiola, Applicable Analysis 101 (2022) 192–216.","ieee":"Y. Shehu and O. S. Iyiola, “Weak convergence for variational inequalities with inertial-type method,” Applicable Analysis, vol. 101, no. 1. Taylor & Francis, pp. 192–216, 2022.","mla":"Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities with Inertial-Type Method.” Applicable Analysis, vol. 101, no. 1, Taylor & Francis, 2022, pp. 192–216, doi:10.1080/00036811.2020.1736287.","ista":"Shehu Y, Iyiola OS. 2022. Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. 101(1), 192–216.","chicago":"Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities with Inertial-Type Method.” Applicable Analysis. Taylor & Francis, 2022. https://doi.org/10.1080/00036811.2020.1736287."},"title":"Weak convergence for variational inequalities with inertial-type method","author":[{"last_name":"Shehu","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Olaniyi S.","full_name":"Iyiola, Olaniyi S.","last_name":"Iyiola"}],"article_processing_charge":"No","external_id":{"isi":["000518364100001"],"arxiv":["2101.08057"]},"acknowledgement":"The project of the first author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7 - 2007-2013) (Grant agreement No. 616160).","publisher":"Taylor & Francis","quality_controlled":"1","oa":1,"day":"01","publication":"Applicable Analysis","isi":1,"has_accepted_license":"1","year":"2022","date_published":"2022-01-01T00:00:00Z","doi":"10.1080/00036811.2020.1736287","date_created":"2020-03-09T07:06:52Z","page":"192-216","_id":"7577","status":"public","type":"journal_article","article_type":"original","ddc":["510","515","518"],"date_updated":"2024-03-05T14:01:52Z","department":[{"_id":"VlKo"}],"file_date_updated":"2021-03-16T23:30:06Z","oa_version":"Submitted Version","abstract":[{"text":"Weak convergence of inertial iterative method for solving variational inequalities is the focus of this paper. The cost function is assumed to be non-Lipschitz and monotone. We propose a projection-type method with inertial terms and give weak convergence analysis under appropriate conditions. Some test results are performed and compared with relevant methods in the literature to show the efficiency and advantages given by our proposed methods.","lang":"eng"}],"month":"01","intvolume":" 101","scopus_import":"1","file":[{"date_updated":"2021-03-16T23:30:06Z","file_size":4282586,"creator":"dernst","date_created":"2020-10-12T10:42:54Z","file_name":"2020_ApplicAnalysis_Shehu.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8648","checksum":"869efe8cb09505dfa6012f67d20db63d","embargo":"2021-03-15"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0003-6811"],"eissn":["1563-504X"]},"publication_status":"published","volume":101,"issue":"1","ec_funded":1},{"abstract":[{"lang":"eng","text":"The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, \"are they parallelizable?\", \"how many solutions can they output?\", \"what is the expected \"weight\" of a solution?\", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"09","intvolume":" 207","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7207-5"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"9d2544d53aa5b01565c6891d97a4d765","file_id":"10098","creator":"cchlebak","file_size":804472,"date_updated":"2021-10-06T13:51:54Z","file_name":"2021_LIPIcs_Harris.pdf","date_created":"2021-10-06T13:51:54Z"}],"language":[{"iso":"eng"}],"volume":207,"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"_id":"10072","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation","location":"Virtual","end_date":"2021-08-18","start_date":"2021-08-16"},"status":"public","date_updated":"2022-03-18T10:08:25Z","ddc":["000"],"department":[{"_id":"VlKo"}],"file_date_updated":"2021-10-06T13:51:54Z","acknowledgement":"Fotis Iliopoulos: This material is based upon work directly supported by the IAS Fund for Math and indirectly supported by the National Science Foundation Grant No. CCF-1900460. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is also supported by the National Science Foundation Grant No. CCF-1815328.\r\nVladimir Kolmogorov: Supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160.","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","oa":1,"has_accepted_license":"1","year":"2021","day":"15","publication":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","date_published":"2021-09-15T00:00:00Z","doi":"10.4230/LIPIcs.APPROX/RANDOM.2021.31","date_created":"2021-10-03T22:01:22Z","article_number":"31","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"citation":{"ista":"Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.","chicago":"Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Vol. 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31.","apa":"Harris, D. G., Iliopoulos, F., & Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31","ama":"Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Vol 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31","ieee":"D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Virtual, 2021, vol. 207.","short":"D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. 207, 31, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Harris","full_name":"Harris, David G.","first_name":"David G."},{"first_name":"Fotis","full_name":"Iliopoulos, Fotis","last_name":"Iliopoulos"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"external_id":{"arxiv":["2008.05569"]},"article_processing_charge":"Yes","title":"A new notion of commutativity for the algorithmic Lovász Local Lemma"},{"title":"One-sided Frank-Wolfe algorithms for saddle problems","department":[{"_id":"VlKo"}],"author":[{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pock, Thomas","last_name":"Pock","first_name":"Thomas"}],"external_id":{"arxiv":["2101.12617"]},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” In 38th International Conference on Machine Learning, 2021.","ista":"Kolmogorov V, Pock T. 2021. One-sided Frank-Wolfe algorithms for saddle problems. 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning.","mla":"Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” 38th International Conference on Machine Learning, 2021.","ieee":"V. Kolmogorov and T. Pock, “One-sided Frank-Wolfe algorithms for saddle problems,” in 38th International Conference on Machine Learning, Virtual, 2021.","short":"V. Kolmogorov, T. Pock, in:, 38th International Conference on Machine Learning, 2021.","ama":"Kolmogorov V, Pock T. One-sided Frank-Wolfe algorithms for saddle problems. In: 38th International Conference on Machine Learning. ; 2021.","apa":"Kolmogorov, V., & Pock, T. (2021). One-sided Frank-Wolfe algorithms for saddle problems. In 38th International Conference on Machine Learning. Virtual."},"date_updated":"2021-12-17T09:06:46Z","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"status":"public","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2021-07-18","end_date":"2021-07-24","location":"Virtual"},"_id":"10552","date_published":"2021-07-01T00:00:00Z","ec_funded":1,"date_created":"2021-12-16T12:41:20Z","day":"01","publication":"38th International Conference on Machine Learning","language":[{"iso":"eng"}],"publication_status":"published","year":"2021","month":"07","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.12617"}],"oa":1,"oa_version":"Preprint","acknowledgement":"Vladimir Kolmogorov was supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160. Thomas Pock acknowledges support by an ERC grant HOMOVIS, no 640156.","abstract":[{"lang":"eng","text":"We study a class of convex-concave saddle-point problems of the form minxmaxy⟨Kx,y⟩+fP(x)−h∗(y) where K is a linear operator, fP is the sum of a convex function f with a Lipschitz-continuous gradient and the indicator function of a bounded convex polytope P, and h∗ is a convex (possibly nonsmooth) function. Such problem arises, for example, as a Lagrangian relaxation of various discrete optimization problems. Our main assumptions are the existence of an efficient linear minimization oracle (lmo) for fP and an efficient proximal map for h∗ which motivate the solution via a blend of proximal primal-dual algorithms and Frank-Wolfe algorithms. In case h∗ is the indicator function of a linear constraint and function f is quadratic, we show a O(1/n2) convergence rate on the dual objective, requiring O(nlogn) calls of lmo. If the problem comes from the constrained optimization problem minx∈Rd{fP(x)|Ax−b=0} then we additionally get bound O(1/n2) both on the primal gap and on the infeasibility gap. In the most general case, we show a O(1/n) convergence rate of the primal-dual gap again requiring O(nlogn) calls of lmo. To the best of our knowledge, this improves on the known convergence rates for the considered class of saddle-point problems. We show applications to labeling problems frequently appearing in machine learning and computer vision."}]},{"type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"conference":{"start_date":"2021-08-10","location":"Halifax, NS, Canada","end_date":"2021-08-12","name":"CCCG: Canadian Conference on Computational Geometry"},"status":"public","keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"_id":"9592","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"file_date_updated":"2021-08-12T10:57:21Z","date_updated":"2021-08-12T10:57:39Z","ddc":["516"],"month":"06","abstract":[{"text":"The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general.","lang":"eng"}],"oa_version":"Submitted Version","license":"https://creativecommons.org/licenses/by-nd/4.0/","publication_status":"accepted","file":[{"creator":"mdvorak","date_updated":"2021-06-28T20:23:13Z","file_size":381306,"date_created":"2021-06-28T20:23:13Z","file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","file_id":"9616","success":1},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"9902","checksum":"9199cf18c65658553487458cc24d0ab2","success":1,"date_updated":"2021-08-12T10:57:21Z","file_size":403645,"creator":"kschuh","date_created":"2021-08-12T10:57:21Z","file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Dvorak","full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","first_name":"Martin"},{"first_name":"Sara","full_name":"Nicholson, Sara","last_name":"Nicholson"}],"external_id":{"arxiv":["2106.11247"]},"article_processing_charge":"No","title":"Massively winning configurations in the convex grabbing game on the plane","citation":{"chicago":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” In Proceedings of the 33rd Canadian Conference on Computational Geometry, n.d.","ista":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.","mla":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” Proceedings of the 33rd Canadian Conference on Computational Geometry.","short":"M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, n.d.","ieee":"M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in Proceedings of the 33rd Canadian Conference on Computational Geometry, Halifax, NS, Canada.","apa":"Dvorak, M., & Nicholson, S. (n.d.). Massively winning configurations in the convex grabbing game on the plane. In Proceedings of the 33rd Canadian Conference on Computational Geometry. Halifax, NS, Canada.","ama":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: Proceedings of the 33rd Canadian Conference on Computational Geometry."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","oa":1,"date_published":"2021-06-29T00:00:00Z","date_created":"2021-06-22T15:57:11Z","has_accepted_license":"1","year":"2021","day":"29","publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry"},{"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Iyiola OS, Enyi CD, Shehu Y. 2021. Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software.","chicago":"Iyiola, Olaniyi S., Cyril D. Enyi, and Yekini Shehu. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.” Optimization Methods and Software. Taylor and Francis, 2021. https://doi.org/10.1080/10556788.2021.1924715.","short":"O.S. Iyiola, C.D. Enyi, Y. Shehu, Optimization Methods and Software (2021).","ieee":"O. S. Iyiola, C. D. Enyi, and Y. Shehu, “Reflected three-operator splitting method for monotone inclusion problem,” Optimization Methods and Software. Taylor and Francis, 2021.","ama":"Iyiola OS, Enyi CD, Shehu Y. Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software. 2021. doi:10.1080/10556788.2021.1924715","apa":"Iyiola, O. S., Enyi, C. D., & Shehu, Y. (2021). Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software. Taylor and Francis. https://doi.org/10.1080/10556788.2021.1924715","mla":"Iyiola, Olaniyi S., et al. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.” Optimization Methods and Software, Taylor and Francis, 2021, doi:10.1080/10556788.2021.1924715."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Olaniyi S.","full_name":"Iyiola, Olaniyi S.","last_name":"Iyiola"},{"first_name":"Cyril D.","full_name":"Enyi, Cyril D.","last_name":"Enyi"},{"id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","first_name":"Yekini","last_name":"Shehu","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139"}],"article_processing_charge":"No","external_id":{"isi":["000650507600001"]},"title":"Reflected three-operator splitting method for monotone inclusion problem","acknowledgement":"The authors are grateful to the anonymous referees and the handling Editor for their insightful comments which have improved the earlier version of the manuscript greatly. The second author is grateful to the University of Hafr Al Batin. The last author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","quality_controlled":"1","publisher":"Taylor and Francis","isi":1,"year":"2021","day":"12","publication":"Optimization Methods and Software","doi":"10.1080/10556788.2021.1924715","date_published":"2021-05-12T00:00:00Z","date_created":"2021-06-06T22:01:30Z","_id":"9469","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-08-08T13:57:43Z","department":[{"_id":"VlKo"}],"abstract":[{"text":"In this paper, we consider reflected three-operator splitting methods for monotone inclusion problems in real Hilbert spaces. To do this, we first obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of the reflected Krasnosel'skiĭ-Mann iteration for finding a fixed point of nonexpansive mapping in real Hilbert spaces under some seemingly easy to implement conditions on the iterative parameters. We then apply our results to three-operator splitting for the monotone inclusion problem and consequently obtain the corresponding convergence analysis. Furthermore, we derive reflected primal-dual algorithms for highly structured monotone inclusion problems. Some numerical implementations are drawn from splitting methods to support the theoretical analysis.","lang":"eng"}],"oa_version":"None","scopus_import":"1","month":"05","publication_identifier":{"eissn":["1029-4937"],"issn":["1055-6788"]},"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1},{"publication":"Networks and Spatial Economics","day":"01","year":"2021","isi":1,"has_accepted_license":"1","date_created":"2021-03-10T12:18:47Z","date_published":"2021-06-01T00:00:00Z","doi":"10.1007/s11067-021-09517-w","page":"291-323","acknowledgement":"The authors sincerely thank the Editor-in-Chief and anonymous referees for their careful reading, constructive comments and fruitful suggestions that help improve the manuscript. The research of the first author is supported by the National Research Foundation (NRF) South Africa (S& F-DSI/NRF Free Standing Postdoctoral Fellowship; Grant Number: 120784). The first author also acknowledges the financial support from DSI/NRF, South Africa Center of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) Postdoctoral Fellowship. The second author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7 - 2007-2013) (Grant agreement No. 616160). Open Access funding provided by Institute of Science and Technology (IST Austria).","oa":1,"quality_controlled":"1","publisher":"Springer Nature","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.” Networks and Spatial Economics. Springer Nature, 2021. https://doi.org/10.1007/s11067-021-09517-w.","ista":"Izuchukwu C, Shehu Y. 2021. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. 21(2), 291–323.","mla":"Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.” Networks and Spatial Economics, vol. 21, no. 2, Springer Nature, 2021, pp. 291–323, doi:10.1007/s11067-021-09517-w.","ama":"Izuchukwu C, Shehu Y. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. 2021;21(2):291-323. doi:10.1007/s11067-021-09517-w","apa":"Izuchukwu, C., & Shehu, Y. (2021). New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. Springer Nature. https://doi.org/10.1007/s11067-021-09517-w","ieee":"C. Izuchukwu and Y. Shehu, “New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity,” Networks and Spatial Economics, vol. 21, no. 2. Springer Nature, pp. 291–323, 2021.","short":"C. Izuchukwu, Y. Shehu, Networks and Spatial Economics 21 (2021) 291–323."},"title":"New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000625002100001"]},"author":[{"full_name":"Izuchukwu, Chinedu","last_name":"Izuchukwu","first_name":"Chinedu"},{"last_name":"Shehu","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"language":[{"iso":"eng"}],"file":[{"date_created":"2021-08-11T12:44:16Z","file_name":"2021_NetworksSpatialEconomics_Shehu.pdf","creator":"kschuh","date_updated":"2021-08-11T12:44:16Z","file_size":834964,"file_id":"9884","checksum":"22b4253a2e5da843622a2df713784b4c","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"eissn":["1572-9427"],"issn":["1566-113X"]},"ec_funded":1,"issue":"2","volume":21,"oa_version":"Published Version","abstract":[{"text":"In this paper, we present two new inertial projection-type methods for solving multivalued variational inequality problems in finite-dimensional spaces. We establish the convergence of the sequence generated by these methods when the multivalued mapping associated with the problem is only required to be locally bounded without any monotonicity assumption. Furthermore, the inertial techniques that we employ in this paper are quite different from the ones used in most papers. Moreover, based on the weaker assumptions on the inertial factor in our methods, we derive several special cases of our methods. Finally, we present some experimental results to illustrate the profits that we gain by introducing the inertial extrapolation steps.","lang":"eng"}],"intvolume":" 21","month":"06","scopus_import":"1","ddc":["510"],"date_updated":"2023-09-05T15:32:32Z","file_date_updated":"2021-08-11T12:44:16Z","department":[{"_id":"VlKo"}],"_id":"9234","keyword":["Computer Networks and Communications","Software","Artificial Intelligence"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original"},{"status":"public","conference":{"location":"Rupnagar, India","end_date":"2021-02-13","start_date":"2021-02-11","name":"CALDAM: Conference on Algorithms and Discrete Applied Mathematics"},"type":"conference","_id":"9227","title":"Experimental evaluation of a local search approximation algorithm for the multiway cut problem","department":[{"_id":"VlKo"}],"article_processing_charge":"No","author":[{"last_name":"Bloch-Hansen","full_name":"Bloch-Hansen, Andrew","first_name":"Andrew"},{"full_name":"Samei, Nasim","last_name":"Samei","id":"C1531CAE-36E9-11EA-845F-33AA3DDC885E","first_name":"Nasim"},{"full_name":"Solis-Oba, Roberto","last_name":"Solis-Oba","first_name":"Roberto"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-10T09:29:08Z","citation":{"apa":"Bloch-Hansen, A., Samei, N., & Solis-Oba, R. (2021). Experimental evaluation of a local search approximation algorithm for the multiway cut problem. In Conference on Algorithms and Discrete Applied Mathematics (Vol. 12601, pp. 346–358). Rupnagar, India: Springer Nature. https://doi.org/10.1007/978-3-030-67899-9_28","ama":"Bloch-Hansen A, Samei N, Solis-Oba R. Experimental evaluation of a local search approximation algorithm for the multiway cut problem. In: Conference on Algorithms and Discrete Applied Mathematics. Vol 12601. Springer Nature; 2021:346-358. doi:10.1007/978-3-030-67899-9_28","short":"A. Bloch-Hansen, N. Samei, R. Solis-Oba, in:, Conference on Algorithms and Discrete Applied Mathematics, Springer Nature, 2021, pp. 346–358.","ieee":"A. Bloch-Hansen, N. Samei, and R. Solis-Oba, “Experimental evaluation of a local search approximation algorithm for the multiway cut problem,” in Conference on Algorithms and Discrete Applied Mathematics, Rupnagar, India, 2021, vol. 12601, pp. 346–358.","mla":"Bloch-Hansen, Andrew, et al. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.” Conference on Algorithms and Discrete Applied Mathematics, vol. 12601, Springer Nature, 2021, pp. 346–58, doi:10.1007/978-3-030-67899-9_28.","ista":"Bloch-Hansen A, Samei N, Solis-Oba R. 2021. Experimental evaluation of a local search approximation algorithm for the multiway cut problem. Conference on Algorithms and Discrete Applied Mathematics. CALDAM: Conference on Algorithms and Discrete Applied Mathematics, LNCS, vol. 12601, 346–358.","chicago":"Bloch-Hansen, Andrew, Nasim Samei, and Roberto Solis-Oba. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.” In Conference on Algorithms and Discrete Applied Mathematics, 12601:346–58. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-67899-9_28."},"intvolume":" 12601","month":"01","publisher":"Springer Nature","quality_controlled":"1","scopus_import":"1","alternative_title":["LNCS"],"oa_version":"None","abstract":[{"lang":"eng","text":"In the multiway cut problem we are given a weighted undirected graph G=(V,E) and a set T⊆V of k terminals. The goal is to find a minimum weight set of edges E′⊆E with the property that by removing E′ from G all the terminals become disconnected. In this paper we present a simple local search approximation algorithm for the multiway cut problem with approximation ratio 2−2k . We present an experimental evaluation of the performance of our local search algorithm and show that it greatly outperforms the isolation heuristic of Dalhaus et al. and it has similar performance as the much more complex algorithms of Calinescu et al., Sharma and Vondrak, and Buchbinder et al. which have the currently best known approximation ratios for this problem."}],"date_created":"2021-03-07T23:01:25Z","volume":12601,"date_published":"2021-01-28T00:00:00Z","doi":"10.1007/978-3-030-67899-9_28","page":"346-358","language":[{"iso":"eng"}],"publication":"Conference on Algorithms and Discrete Applied Mathematics","day":"28","publication_status":"published","year":"2021","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030678982"],"issn":["0302-9743"]}},{"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"mla":"Shehu, Yekini, et al. “An Inertial Subgradient Extragradient Algorithm Extended to Pseudomonotone Equilibrium Problems.” Mathematical Methods of Operations Research, vol. 93, no. 2, Springer Nature, 2021, pp. 213–42, doi:10.1007/s00186-020-00730-w.","apa":"Shehu, Y., Iyiola, O. S., Thong, D. V., & Van, N. T. C. (2021). An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems. Mathematical Methods of Operations Research. Springer Nature. https://doi.org/10.1007/s00186-020-00730-w","ama":"Shehu Y, Iyiola OS, Thong DV, Van NTC. An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems. Mathematical Methods of Operations Research. 2021;93(2):213-242. doi:10.1007/s00186-020-00730-w","ieee":"Y. Shehu, O. S. Iyiola, D. V. Thong, and N. T. C. Van, “An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems,” Mathematical Methods of Operations Research, vol. 93, no. 2. Springer Nature, pp. 213–242, 2021.","short":"Y. Shehu, O.S. Iyiola, D.V. Thong, N.T.C. Van, Mathematical Methods of Operations Research 93 (2021) 213–242.","chicago":"Shehu, Yekini, Olaniyi S. Iyiola, Duong Viet Thong, and Nguyen Thi Cam Van. “An Inertial Subgradient Extragradient Algorithm Extended to Pseudomonotone Equilibrium Problems.” Mathematical Methods of Operations Research. Springer Nature, 2021. https://doi.org/10.1007/s00186-020-00730-w.","ista":"Shehu Y, Iyiola OS, Thong DV, Van NTC. 2021. An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems. Mathematical Methods of Operations Research. 93(2), 213–242."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","last_name":"Shehu","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Iyiola, Olaniyi S.","last_name":"Iyiola","first_name":"Olaniyi S."},{"full_name":"Thong, Duong Viet","last_name":"Thong","first_name":"Duong Viet"},{"first_name":"Nguyen Thi Cam","full_name":"Van, Nguyen Thi Cam","last_name":"Van"}],"article_processing_charge":"No","external_id":{"isi":["000590497300001"]},"title":"An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems","acknowledgement":"The authors are grateful to the two referees and the Associate Editor for their comments and suggestions which have improved the earlier version of the paper greatly. The project of Yekini Shehu has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7 - 2007-2013) (Grant agreement No. 616160).","publisher":"Springer Nature","quality_controlled":"1","isi":1,"year":"2021","day":"01","publication":"Mathematical Methods of Operations Research","page":"213-242","date_published":"2021-04-01T00:00:00Z","doi":"10.1007/s00186-020-00730-w","date_created":"2020-11-29T23:01:18Z","_id":"8817","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-10-10T09:30:23Z","department":[{"_id":"VlKo"}],"abstract":[{"text":"The paper introduces an inertial extragradient subgradient method with self-adaptive step sizes for solving equilibrium problems in real Hilbert spaces. Weak convergence of the proposed method is obtained under the condition that the bifunction is pseudomonotone and Lipchitz continuous. Linear convergence is also given when the bifunction is strongly pseudomonotone and Lipchitz continuous. Numerical implementations and comparisons with other related inertial methods are given using test problems including a real-world application to Nash–Cournot oligopolistic electricity market equilibrium model.","lang":"eng"}],"oa_version":"None","scopus_import":"1","month":"04","intvolume":" 93","publication_identifier":{"issn":["1432-2994"],"eissn":["1432-5217"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"2","volume":93,"ec_funded":1},{"type":"journal_article","article_type":"original","status":"public","_id":"9315","department":[{"_id":"VlKo"}],"date_updated":"2023-10-10T09:47:33Z","scopus_import":"1","intvolume":" 76","month":"03","abstract":[{"lang":"eng","text":"We consider inertial iteration methods for Fermat–Weber location problem and primal–dual three-operator splitting in real Hilbert spaces. To do these, we first obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of the inertial Krasnoselskii–Mann iteration for fixed point of nonexpansive operators in infinite dimensional real Hilbert spaces under some seemingly easy to implement conditions on the iterative parameters. One of our contributions is that the convergence analysis and rate of convergence results are obtained using conditions which appear not complicated and restrictive as assumed in other previous related results in the literature. We then show that Fermat–Weber location problem and primal–dual three-operator splitting are special cases of fixed point problem of nonexpansive mapping and consequently obtain the convergence analysis of inertial iteration methods for Fermat–Weber location problem and primal–dual three-operator splitting in real Hilbert spaces. Some numerical implementations are drawn from primal–dual three-operator splitting to support the theoretical analysis."}],"oa_version":"None","issue":"2","volume":76,"publication_status":"published","publication_identifier":{"eissn":["1420-9012"],"issn":["1422-6383"]},"language":[{"iso":"eng"}],"article_number":"75","article_processing_charge":"No","external_id":{"isi":["000632917700001"]},"author":[{"first_name":"Olaniyi S.","last_name":"Iyiola","full_name":"Iyiola, Olaniyi S."},{"last_name":"Shehu","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","first_name":"Yekini"}],"title":"New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications","citation":{"ista":"Iyiola OS, Shehu Y. 2021. New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications. Results in Mathematics. 76(2), 75.","chicago":"Iyiola, Olaniyi S., and Yekini Shehu. “New Convergence Results for Inertial Krasnoselskii–Mann Iterations in Hilbert Spaces with Applications.” Results in Mathematics. Springer Nature, 2021. https://doi.org/10.1007/s00025-021-01381-x.","ieee":"O. S. Iyiola and Y. Shehu, “New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications,” Results in Mathematics, vol. 76, no. 2. Springer Nature, 2021.","short":"O.S. Iyiola, Y. Shehu, Results in Mathematics 76 (2021).","ama":"Iyiola OS, Shehu Y. New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications. Results in Mathematics. 2021;76(2). doi:10.1007/s00025-021-01381-x","apa":"Iyiola, O. S., & Shehu, Y. (2021). New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications. Results in Mathematics. Springer Nature. https://doi.org/10.1007/s00025-021-01381-x","mla":"Iyiola, Olaniyi S., and Yekini Shehu. “New Convergence Results for Inertial Krasnoselskii–Mann Iterations in Hilbert Spaces with Applications.” Results in Mathematics, vol. 76, no. 2, 75, Springer Nature, 2021, doi:10.1007/s00025-021-01381-x."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"The research of this author is supported by the Postdoctoral Fellowship from Institute of Science and Technology (IST), Austria.","date_created":"2021-04-11T22:01:14Z","doi":"10.1007/s00025-021-01381-x","date_published":"2021-03-25T00:00:00Z","year":"2021","isi":1,"publication":"Results in Mathematics","day":"25"},{"department":[{"_id":"VlKo"}],"date_updated":"2023-10-10T09:48:41Z","status":"public","type":"journal_article","article_type":"original","_id":"9365","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0233-1934"],"eissn":["1029-4945"]},"publication_status":"published","month":"04","scopus_import":"1","oa_version":"None","abstract":[{"text":"In this paper, we propose a new iterative method with alternated inertial step for solving split common null point problem in real Hilbert spaces. We obtain weak convergence of the proposed iterative algorithm. Furthermore, we introduce the notion of bounded linear regularity property for the split common null point problem and obtain the linear convergence property for the new algorithm under some mild assumptions. Finally, we provide some numerical examples to demonstrate the performance and efficiency of the proposed method.","lang":"eng"}],"title":"Convergence analysis of new inertial method for the split common null point problem","author":[{"full_name":"Ogbuisi, Ferdinard U.","last_name":"Ogbuisi","first_name":"Ferdinard U."},{"first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","last_name":"Shehu","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139"},{"last_name":"Yao","full_name":"Yao, Jen Chih","first_name":"Jen Chih"}],"external_id":{"isi":["000640109300001"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ogbuisi FU, Shehu Y, Yao JC. 2021. Convergence analysis of new inertial method for the split common null point problem. Optimization.","chicago":"Ogbuisi, Ferdinard U., Yekini Shehu, and Jen Chih Yao. “Convergence Analysis of New Inertial Method for the Split Common Null Point Problem.” Optimization. Taylor and Francis, 2021. https://doi.org/10.1080/02331934.2021.1914035.","ieee":"F. U. Ogbuisi, Y. Shehu, and J. C. Yao, “Convergence analysis of new inertial method for the split common null point problem,” Optimization. Taylor and Francis, 2021.","short":"F.U. Ogbuisi, Y. Shehu, J.C. Yao, Optimization (2021).","ama":"Ogbuisi FU, Shehu Y, Yao JC. Convergence analysis of new inertial method for the split common null point problem. Optimization. 2021. doi:10.1080/02331934.2021.1914035","apa":"Ogbuisi, F. U., Shehu, Y., & Yao, J. C. (2021). Convergence analysis of new inertial method for the split common null point problem. Optimization. Taylor and Francis. https://doi.org/10.1080/02331934.2021.1914035","mla":"Ogbuisi, Ferdinard U., et al. “Convergence Analysis of New Inertial Method for the Split Common Null Point Problem.” Optimization, Taylor and Francis, 2021, doi:10.1080/02331934.2021.1914035."},"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"date_published":"2021-04-14T00:00:00Z","doi":"10.1080/02331934.2021.1914035","date_created":"2021-05-02T22:01:29Z","day":"14","publication":"Optimization","isi":1,"year":"2021","publisher":"Taylor and Francis","quality_controlled":"1","acknowledgement":"The second author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160)."}]