{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T10:18:56Z","timestamp":1779013136576,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"MSMT","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765 \u201cResearch Center for Informatics\u201d"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765 \u201cResearch Center for Informatics\u201d"]}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["22-15524\u00a0S"],"award-info":[{"award-number":["22-15524\u00a0S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002969","name":"Technologick\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["TN02000025"],"award-info":[{"award-number":["TN02000025"]}],"id":[{"id":"10.13039\/501100002969","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007655","name":"Czech Technical University in Prague","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007655","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider rather a general class of multi-level optimization problems, where a convex objective function is to be minimized subject to constraints of optimality of nested convex optimization problems. As a special case, we consider a trilevel optimization problem, where the objective of the two lower layers consists of a sum of a smooth and a non-smooth term.\u00a0Based on fixed-point theory and related arguments, we present a natural first-order algorithm and analyze its convergence and rates of convergence in several regimes of parameters.<\/jats:p>","DOI":"10.1007\/s00186-024-00852-5","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T18:02:32Z","timestamp":1709143352000},"page":"77-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Trilevel and multilevel optimization using\u00a0monotone\u00a0operator\u00a0theory"],"prefix":"10.1007","volume":"99","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1415-2166","authenticated-orcid":false,"given":"Allahkaram","family":"Shafiei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2229-8824","authenticated-orcid":false,"given":"Vyacheslav","family":"Kungurtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0839-0691","authenticated-orcid":false,"given":"Jakub","family":"Marecek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,28]]},"reference":[{"key":"852_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02098176","volume":"34","author":"F Al-Khayyal","year":"1992","unstructured":"Al-Khayyal F, Horst R, Pardalos PM (1992) Global optimization of concave functions subject to quadratic constraints: an application in nonlinear bilevel programming. Ann Oper Res 34:125\u2013147","journal-title":"Ann Oper Res"},{"key":"852_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2:183\u2013202","journal-title":"SIAM J Imaging Sci"},{"key":"852_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-013-0708-2","volume":"147","author":"A Beck","year":"2014","unstructured":"Beck A, Sabach S (2014) A first order method for finding minimal norm-like solutions of convex optimization problems. Math Program 147:25\u201346","journal-title":"Math Program"},{"key":"852_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"WF Bialas","year":"1973","unstructured":"Bialas WF, Karwan MH (1973) Mathematical programs with optimization problems in the constraints. Oper Res 21:37\u201344","journal-title":"Oper Res"},{"key":"852_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke H, Combettes H, Patrick L (2011) Convex analysis and monotone operator theory in Hilbert spaces. Springer, New York"},{"key":"852_CR6","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"Aharon Ben-Tal","year":"2009","unstructured":"Ben-Tal Aharon, El Ghaoui Laurent, Nemirovski Arkadi (2009) Robust optimization, vol 28. Princeton University Press, Princeton"},{"key":"852_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/15M1045223","volume":"27","author":"JM Borwein","year":"2017","unstructured":"Borwein JM, Guoyin L, Matthew T (2017) Convergence rate analysis for averaged fixed point iterations in common fixed point problems. SIAM J Optim 27:1\u201333","journal-title":"SIAM J Optim"},{"key":"852_CR8","doi-asserted-by":"crossref","unstructured":"Blair C (1992) The computational complexity of multi-level linear programs. Ann Oper Res (34)","DOI":"10.1007\/BF02098170"},{"key":"852_CR9","doi-asserted-by":"crossref","unstructured":"Borwein JM, Vanderwerff J (2010) Convex functions: constructions, characterizations, and counterexamples. Cambridge University Press, Cambridge (172)","DOI":"10.1017\/CBO9781139087322"},{"issue":"4","key":"852_CR10","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte J, Daniilidis A, Lewis A (2007) The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J Optim 17(4):1205\u20131223","journal-title":"SIAM J Optim"},{"issue":"1","key":"852_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmaa.2014.06.075","volume":"421","author":"H Bauschke","year":"2015","unstructured":"Bauschke H, Noll D, Phan HM (2015) Linear and strong convergence of algorithms involving averaged nonexpansive operators. J Math Anal Appl 421(1):1\u201320","journal-title":"J Math Anal Appl"},{"key":"852_CR12","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1080\/02331930701617551","volume":"56","author":"S Dempe","year":"2007","unstructured":"Dempe S, Dutta J, Mordukhovich BS (2007) New necessary optimality conditions in optimistic bilevel programming. Optimization 56:577\u2013604","journal-title":"Optimization"},{"key":"852_CR13","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1080\/02331934.2012.696641","volume":"56","author":"S Dempe","year":"2014","unstructured":"Dempe S, Dutta J, Mordukhovich BS (2014) Necessary optimality conditions in pessimistic bilevel programming. Optimization 56:505\u2013533","journal-title":"Optimization"},{"key":"852_CR14","first-page":"39","volume":"4","author":"S Dempe","year":"1994","unstructured":"Dempe S, Dutta J, Mordukhovich BS (1994) An iterative method for solving a class of nonlinear operator equations in Banach space. J Panamerican Math 4:39\u201354","journal-title":"J Panamerican Math"},{"key":"852_CR15","doi-asserted-by":"crossref","unstructured":"Fisac Jaime F, Sastry S Shankar (2015) The pursuit-evasion-defense differential game in dynamic constrained environments. In: 2015 54th IEEE conference on decision and control (CDC), 4549\u20134556","DOI":"10.1109\/CDC.2015.7402930"},{"key":"852_CR16","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s10957-010-9769-z","volume":"148","author":"H Iiduka","year":"2011","unstructured":"Iiduka H (2011) Iterative algorithm for solving triple-hierarchical constrained optimization problem. J Optim Theory Appl 148:580\u2013592","journal-title":"J Optim Theory Appl"},{"key":"852_CR17","doi-asserted-by":"crossref","unstructured":"Isao Y (2001) The hybrid steepest descent method for variational inequality problems o\u00fber the intersection of the fixed-point sets of nonexpansi\u00fbe mappings, inherently parallel algorithms in feasibility and optimization and their applications, Edited by D. Butnariu, Y. Censor, and S. Reich, North-Holland, Amsterdam, Holland pp 473\u2013504","DOI":"10.1016\/S1570-579X(01)80028-8"},{"key":"852_CR18","first-page":"335","volume":"77","author":"L Lampariello","year":"2020","unstructured":"Lampariello L, Neumann C, Ricci J, Sagratella S, Stein O (2020) An explicit Tikhonov algorithm for nested variational inequalities. J Comput Appl 77:335\u2013350","journal-title":"J Comput Appl"},{"key":"852_CR19","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1137\/18M119759X","volume":"29","author":"L Lampariello","year":"2019","unstructured":"Lampariello L, Sagratella S, Stein O (2019) The standard pessimistic bilevel problem. SIAM J Optim 29:1634\u20131656","journal-title":"SIAM J Optim"},{"key":"852_CR20","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1016\/j.na.2008.11.067","volume":"71","author":"XW Lu","year":"2009","unstructured":"Lu XW, Xu HK, Yin XM (2009) Hybrid methods for a class of monotone variational inequalities. Nonlinear Anal 71:1032\u20131041","journal-title":"Nonlinear Anal"},{"key":"852_CR21","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1088\/0266-5611\/23\/4\/015","volume":"23","author":"A Moudafi","year":"2007","unstructured":"Moudafi A (2007) Krasnoselski\u2013Mann iteration for hierarchical fixed-point problems. Inverse Probl 23:1635\u20131640","journal-title":"Inverse Probl"},{"key":"852_CR22","first-page":"529","volume":"3","author":"PE Maing\u00e9","year":"2007","unstructured":"Maing\u00e9 PE, Abdellatif M (2007) Strong convergence of an iterative method for hierarchical fixed-point problems. Pac J Optim 3:529\u2013538","journal-title":"Pac J Optim"},{"key":"852_CR23","doi-asserted-by":"crossref","unstructured":"Nesterov Y (2003) Introductory lectures on convex optimization (vol 87). Springer, Applied Optimization (APOP)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"852_CR24","first-page":"277","volume":"14","author":"M Solodov","year":"2007","unstructured":"Solodov M (2007) An explicit descent method for bilevel convex optimization. J Convex Anal 14:277","journal-title":"J Convex Anal"},{"key":"852_CR25","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1137\/16M105592X","volume":"27","author":"S Sabach","year":"2017","unstructured":"Sabach S, Shtern S (2017) A first order method for solving convex bilevel optimization problems. SIAM J Optim 27:640\u2013660","journal-title":"SIAM J Optim"},{"key":"852_CR26","first-page":"7522","volume":"34","author":"R Sato","year":"2021","unstructured":"Sato R, Mirai T, Takeda A (2021) A gradient method for multilevel optimization. Adv Neural Inf Process Syst 34:7522\u20137533","journal-title":"Adv Neural Inf Process Syst"},{"key":"852_CR27","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1090\/S0002-9939-1974-0346608-8","volume":"44","author":"HF Senter","year":"1974","unstructured":"Senter HF, Dotson (1974) Approximating fixed points of nonexpansive mappings. Proc Am Math Soc 44:375\u2013380","journal-title":"Proc Am Math Soc"},{"key":"852_CR28","unstructured":"Wilfred W (1977) Multi-level programming. World Bank"},{"key":"852_CR29","doi-asserted-by":"publisher","first-page":"463","DOI":"10.11650\/twjm\/1500405802","volume":"14","author":"HK Xu","year":"2010","unstructured":"Xu HK (2010) Viscosity method for hierarchical fixed point approach to variational inequalities. Taiwan J Math 14:463\u2013478","journal-title":"Taiwan J Math"},{"key":"852_CR30","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jmaa.2004.04.059","volume":"298","author":"HK Xu","year":"2004","unstructured":"Xu HK (2004) Viscosity approximation methods for nonexpansive mappings. J Math Anal Appl 298:279\u2013291","journal-title":"J Math Anal Appl"},{"key":"852_CR31","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"HK Xu","year":"2002","unstructured":"Xu HK (2002) Iterative algorithms for nonlinear operators. J Lond Math Soc 66:240\u2013256","journal-title":"J Lond Math Soc"},{"key":"852_CR32","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0804029","volume":"4","author":"R Zhang","year":"1994","unstructured":"Zhang R (1994) Problems of hierarchical optimization in finite dimensions. SIAM J Optim 4:521\u2013536","journal-title":"SIAM J Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00852-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-024-00852-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00852-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T10:05:11Z","timestamp":1714730711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-024-00852-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["852"],"URL":"https:\/\/doi.org\/10.1007\/s00186-024-00852-5","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"assertion":[{"value":"2 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}