{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T13:10:05Z","timestamp":1747487405434,"version":"3.40.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:00:00Z","timestamp":1746144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:00:00Z","timestamp":1746144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10589-025-00689-6","type":"journal-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:19:24Z","timestamp":1746188364000},"page":"351-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preface: New trends in large scale optimization"],"prefix":"10.1007","volume":"91","author":[{"given":"Stefania","family":"Bellavia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"De Simone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedetta","family":"Morini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"689_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00613-4","author":"S Aleotti","year":"2024","unstructured":"Aleotti, S., Bonettini, S., Donatelli, M., Prato, M., Rebegoldi, S.: A nested primal-dual iterated Tikhonov method for regularized convex optimization. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00613-4","journal-title":"Comput. Optim. Appl."},{"key":"689_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00642-z","author":"R Andreani","year":"2025","unstructured":"Andreani, R., Haeser, G., Ramos, A., Santos, D.O., Secchin, L.D., Serranoni, A.: Strong global convergence properties of algorithms for nonlinear symmetric cone programming. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-024-00642-z","journal-title":"Comput. Optim. Appl."},{"key":"689_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00623-2","author":"L Bergamaschi","year":"2024","unstructured":"Bergamaschi, L., Mart\u00ednez, A., Pearson, J.W., Potschka, A.: Spectral analysis of block preconditioners for double saddle-point linear systems with application to PDE-constrained optimization. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00623-2","journal-title":"Comput. Optim. Appl."},{"key":"689_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00615-2","author":"F Bevilacqua","year":"2024","unstructured":"Bevilacqua, F., Lanza, A., Pragliola, M., Sgallari, F.: A general framework for whiteness-based parameters selection in variational models. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00615-2","journal-title":"Comput. Optim. Appl."},{"key":"689_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00572-w","author":"EG Birgin","year":"2025","unstructured":"Birgin, E.G., Haeser, G., Mart\u00ednez, J.M.: Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-024-00572-w","journal-title":"Comput. Optim. Appl."},{"key":"689_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00585-5","author":"I Bomze","year":"2024","unstructured":"Bomze, I., Rinaldi, F., Zeffiro, D.: Projection free methods on product domains. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00585-5","journal-title":"Comput. Optim. Appl."},{"key":"689_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00675-y","author":"D Calvetti","year":"2025","unstructured":"Calvetti, D., Somersalo, E.: Distributed Tikhonov regularization for ill-posed inverse problems from a Bayesian perspective. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00675-y","journal-title":"Comput. Optim. Appl."},{"key":"689_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00614-3","author":"S Cipolla","year":"2024","unstructured":"Cipolla, S., Gondzio, J.: Proximal-stabilized semidefinite programming. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00614-3","journal-title":"Comput. Optim. Appl."},{"key":"689_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00650-7","author":"G Fasano","year":"2025","unstructured":"Fasano, G., Piermarini, C., Roma, M.: Exploiting effective negative curvature directions via SYMMBK algorithm. Newton-Krylov methods. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00650-7","journal-title":"Newton-Krylov methods. Comput. Optim. Appl."},{"key":"689_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00584-6","author":"J Gondzio","year":"2025","unstructured":"Gondzio, J., Sobral, F.N.C.: Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-024-00584-6","journal-title":"Comput. Optim. Appl."},{"key":"689_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00666-z","author":"D Jakoveti\u0107","year":"2025","unstructured":"Jakoveti\u0107, D., Kreji\u0107, N., Malaspina, G.: Distributed inexact newton method with adaptive step sizes. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00666-z","journal-title":"Comput. Optim. Appl."},{"key":"689_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00664-1","author":"N Krkle\u0107 Jerinki\u0107","year":"2025","unstructured":"Krkle\u0107 Jerinki\u0107, N., Ruggiero, V., Trombini, I.: Spectral stochastic gradient method with additional sampling for finite and infinite sums. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00664-1","journal-title":"Comput. Optim. Appl."},{"key":"689_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00659-y","author":"G Landi","year":"2025","unstructured":"Landi, G., Viola, M., Zama, F.: A scaled gradient projection method for the realization of the balancing principle in TGV-based image restoration. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00659-y","journal-title":"Comput. Optim. Appl."},{"key":"689_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00631-2","author":"A Lanza","year":"2024","unstructured":"Lanza, A., Morigi, S., Recupero, G.: Variational graph p-Laplacian Eigende composition under p-orthogonality constraints. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00631-2","journal-title":"Comput. Optim. Appl."},{"key":"689_CR15","doi-asserted-by":"publisher","unstructured":"Lazzaretti, M., Estatico, C., Melero, A., Calatroni, L.: Off-the-grid regularisation for Poisson inverse problems. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00688-7","DOI":"10.1007\/s10589-025-00688-7"},{"key":"689_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00604-5","author":"G Leconte","year":"2024","unstructured":"Leconte, G., Orban, D.: The indefinite proximal gradient method. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00604-5","journal-title":"Comput. Optim. Appl."},{"key":"689_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00629-w","author":"L Piccinini","year":"2024","unstructured":"Piccinini, L., Simoncini, V.: Truncated LSQR for matrix least squares problems. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00629-w","journal-title":"Comput. Optim. Appl."},{"key":"689_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00667-y","author":"R Seccia","year":"2025","unstructured":"Seccia, R., Coppola, C., Liuzzi, G., Palagi, L.: Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00667-y","journal-title":"Comput. Optim. Appl."},{"key":"689_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00606-3","author":"N Vater","year":"2024","unstructured":"Vater, N., Borz\u00ec, A.: Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00606-3","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00689-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00689-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00689-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T12:32:13Z","timestamp":1747485133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00689-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,2]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00689-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,5,2]]},"assertion":[{"value":"2 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}