{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T02:33:05Z","timestamp":1785465185768,"version":"3.56.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["JP21K17710"],"award-info":[{"award-number":["JP21K17710"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Composite optimization offers a powerful modeling tool for a variety of applications and is often numerically solved by means of proximal gradient methods. In this paper, we consider fully nonconvex composite problems under only local Lipschitz gradient continuity for the smooth part of the objective function. We investigate an adaptive scheme for PANOC-type methods (Stella et al. in Proceedings of the IEEE 56th CDC, 2017), namely accelerated linesearch algorithms requiring only the simple oracle of proximal gradient. While including the classical proximal gradient method, our theoretical results cover a broader class of algorithms and provide convergence guarantees for accelerated methods with possibly inexact computation of the proximal mapping. These findings have also significant practical impact, as they widen scope and performance of existing, and possibly future, general purpose optimization software that invoke PANOC as inner solver.<\/jats:p>","DOI":"10.1007\/s10957-022-02048-5","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T15:03:42Z","timestamp":1657119822000},"page":"771-794","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity"],"prefix":"10.1007","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3545-6898","authenticated-orcid":false,"given":"Alberto","family":"De Marchi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6044-0169","authenticated-orcid":false,"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,6]]},"reference":[{"issue":"1","key":"2048_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/19M1264783","volume":"31","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward\u2013backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima. SIAM J. Optim. 31(1), 653\u2013685 (2021)","journal-title":"SIAM J. Optim."},{"key":"2048_CR2","unstructured":"Antonello, N., Stella, L., Patrinos, P., van Waterschoot, T.: Proximal gradient algorithms: applications in signal processing. arXiv:1803.01621 (2020)"},{"issue":"2","key":"2048_CR3","doi-asserted-by":"publisher","first-page":"9814","DOI":"10.1016\/j.ifacol.2020.12.2683","volume":"53","author":"A Astudillo","year":"2020","unstructured":"Astudillo, A., Gillis, J., Decr\u00e9, W., Pipeleers, G., Swevers, J.: Towards an open toolchain for fast nonlinear MPC for serial robots. IFAC-PapersOnLine 53(2), 9814\u20139819 (2020)","journal-title":"IFAC-PapersOnLine"},{"key":"2048_CR4","doi-asserted-by":"crossref","unstructured":"Berlin, J., Hess, G., Karlsson, A., Ljungbergh, W., Zhang, Z., \u00c5kesson, K., G\u00f6tvall, P.-L.: Trajectory generation for mobile robots in a dynamic environment using nonlinear model predictive control. In: 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), pp. 942\u2013947 (2021)","DOI":"10.1109\/CASE49439.2021.9551644"},{"key":"2048_CR5","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1996)"},{"key":"2048_CR6","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"2048_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2014)"},{"issue":"3","key":"2048_CR8","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3), 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2048_CR9","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1137\/19M1254155","volume":"30","author":"S Bonettini","year":"2020","unstructured":"Bonettini, S., Prato, M., Rebegoldi, S.: Convergence of inexact forward-backward algorithms using the forward-backward envelope. SIAM J. Optim. 30(4), 3069\u20133097 (2020)","journal-title":"SIAM J. Optim."},{"key":"2048_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, New York (2011)"},{"issue":"6","key":"2048_CR11","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1080\/10556788.2016.1214959","volume":"31","author":"JYB Cruz","year":"2016","unstructured":"Cruz, J.Y.B., Nghia, T.T.A.: On the convergence of the forwardbackward splitting method with linesearches. Optim. Methods Softw. 31(6), 1209\u20131238 (2016)","journal-title":"Optim. Methods Softw."},{"key":"2048_CR12","doi-asserted-by":"crossref","unstructured":"De Marchi, A., Jia, X., Kanzow, C., Mehlitz, P.: Constrained structured optimization and augmented Lagrangian proximal methods. arXiv:2203.05276 (2022)","DOI":"10.1007\/s10107-022-01922-4"},{"key":"2048_CR13","unstructured":"Hermans, B.: Penalty and Augmented Lagrangian Methods for Model Predictive Control. Ph.D. thesis, KU Leuven (2021)"},{"key":"2048_CR14","doi-asserted-by":"crossref","unstructured":"Kanzow, C., Mehlitz, P.: Convergence properties of monotone and nonmonotone proximal gradient methods revisited. arXiv:2112.01798 (2021)","DOI":"10.1007\/s10957-022-02101-3"},{"key":"2048_CR15","doi-asserted-by":"crossref","unstructured":"Katriniok, A., Sopasakis, P., Schuurmans, M., Patrinos, P.: Nonlinear model predictive control for distributed motion planning in road intersections using PANOC. In: 2019 IEEE 58th Annual Conference on Decision and Control (CDC), pp. 5272\u20135278 (2019)","DOI":"10.1109\/CDC40024.2019.9029703"},{"issue":"3","key":"2048_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10589-017-9900-2","volume":"67","author":"T Liu","year":"2017","unstructured":"Liu, T., Pong, T.K.: Further properties of the forward-backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67(3), 489\u2013520 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2048_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"key":"2048_CR18","unstructured":"P\u00e5lsson, K., Sv\u00e4rling, E.: Nonlinear model predictive control for constant distance between autonomous transport robots. Master\u2019s thesis, Chalmers University of Technology (2020)"},{"issue":"3","key":"2048_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"2048_CR20","doi-asserted-by":"crossref","unstructured":"Pas, P.: A matrix-free nonlinear solver for embedded and large-scale optimization. Master\u2019s thesis, KU Leuven (2021)","DOI":"10.23919\/ECC55457.2022.9838172"},{"key":"2048_CR21","doi-asserted-by":"crossref","unstructured":"Pas, P., Schuurmans, M., Patrinos, P.: Alpaqa: A matrix-free solver for nonlinear MPC and large-scale nonconvex optimization. arXiv:2112.02370 (2021)","DOI":"10.23919\/ECC55457.2022.9838172"},{"key":"2048_CR22","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE Conference on Decision and Control (CDC), pp. 2358\u20132363 (2013)","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"2","key":"2048_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"2048_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer, Berlin (1998)"},{"issue":"4","key":"2048_CR25","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27(4), 2153\u20132181 (2017)","journal-title":"SIAM J. Optim."},{"key":"2048_CR26","doi-asserted-by":"crossref","unstructured":"Sathya, A., Sopasakis, P., Van Parys, R., Themelis, A., Pipeleers, G., Patrinos, P.: Embedded nonlinear model predictive control for obstacle avoidance using PANOC. In: 2018 European Control Conference (ECC), pp. 1523\u20131528 (2018)","DOI":"10.23919\/ECC.2018.8550253"},{"key":"2048_CR27","doi-asserted-by":"crossref","unstructured":"Sathya, A.S., Gillis, J., Pipeleers, G., Swevers, J.: Real-time robot arm motion planning and control with nonlinear model predictive control using augmented Lagrangian on a first-order solver. In: 2020 European Control Conference (ECC), pp. 507\u2013512 (2020)","DOI":"10.23919\/ECC51009.2020.9143732"},{"key":"2048_CR28","doi-asserted-by":"crossref","unstructured":"Small, E., Sopasakis, P., Fresk, E., Patrinos, P., Nikolakopoulos, G.: Aerial navigation in obstructed environments with embedded nonlinear model predictive control. In: 2019 18th European Control Conference (ECC), pp. 3556\u20133563 (2019)","DOI":"10.23919\/ECC.2019.8796236"},{"issue":"2","key":"2048_CR29","doi-asserted-by":"publisher","first-page":"6548","DOI":"10.1016\/j.ifacol.2020.12.071","volume":"53","author":"P Sopasakis","year":"2020","unstructured":"Sopasakis, P., Fresk, E., Patrinos, P.: OpEn: Code generation for embedded nonconvex optimization. IFAC-PapersOnLine 53(2), 6548\u20136554 (2020)","journal-title":"IFAC-PapersOnLine"},{"issue":"3","key":"2048_CR30","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2600000008","volume":"3","author":"G Stathopoulos","year":"2016","unstructured":"Stathopoulos, G., Shukla, H., Szucs, A., Ye, P., Jones, C.N.: Operator splitting methods in control. Found. Trends Syst. Control 3(3), 249\u2013362 (2016)","journal-title":"Found. Trends Syst. Control"},{"key":"2048_CR31","unstructured":"Stella, L.: ProximalAlgorithms.jl: Proximal algorithms for nonsmooth optimization in Julia. Software available at https:\/\/github.com\/JuliaFirstOrder\/ProximalAlgorithms.jl (2022)"},{"key":"2048_CR32","doi-asserted-by":"crossref","unstructured":"Stella, L., Themelis, A., Sopasakis, P., Patrinos, P.: A simple and efficient algorithm for nonlinear model predictive control. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 1939\u20131944 (2017)","DOI":"10.1109\/CDC.2017.8263933"},{"key":"2048_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-25939-6_15","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In: Bauschke, H.H., Burachik, R.S., Luke, D.R. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer, Cham (2019)"},{"issue":"3","key":"2048_CR34","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02048-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02048-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02048-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:31:03Z","timestamp":1676075463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02048-5"}},"subtitle":["A Convergence and Robustness Analysis of PANOC"],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["2048"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02048-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"24 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":3,"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 competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}