Fast and Simple Multiclass Data Segmentation: An Eigendecomposition and Projection-Free Approach, C. Faccio, M. Porcelli, F. Rinaldi, M. Stoll, arXiv:2508.09738, 2025 [code].
A variable dimension sketching strategy for nonlinear least-squares, S. Bellavia, G. Malaspina, B. Morini, arXiv:2506.03965, 2025.
Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization, S. Bellavia, S. Gratton, B. Morini, P. L. Toint, arXiv:2505.06374, 2025.
An inexact alternating projection method with application to matrix completion, S. Bellavia, S. Rebegoldi, M. Silei, Optimization On Line, 2025.
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function, N. Gillis, M. Porcelli, G. Seraghiti, arXiv:2503.23832, 2025.
Fully stochastic trust-region methods with Barzilai-Borwein steplengths, S. Bellavia, B. Morini, M. Yousefi, arXiv: 2412.12180, 2024.
A multilevel stochastic regularized first-order method with application to training, F. Marini, M. Porcelli, E. Riccietti, arXiv:2412.11630, 2024.
Inexact Restoration via random models for unconstrained noisy optimization, B. Morini, S. Rebegoldi, arXiv:2402.12069, 2024
Alternate Training of Shared and Task-Specific Parameters for Multi-Task Neural Networks, S. Bellavia, F. Della Santa, A. Papini, arXiv:2312.16340v1, 2025.
An optimally fast objective-function-free minimization algorithm using random subspaces, S. Bellavia, S. Gratton, B. Morini, P. L. Toint, arXiv:2310.16580, 2023
Majorization-Minimization for sparse SVMs, A. Benfenati, E. Chouzenoux, G. Franchini, S. Latva-Aijo, D. Narnhofer, J. Pesquet, S. J. Scott, M. Yousefi, arXiv:2308.16858, 2023
prunAdag: an adaptive pruning-aware gradient method, M. Porcelli, G. Seraghiti, Ph. L. Toint, Computational Optimization and Applications, to appear, arXiv:2502.08308, 2025.
Black-box optimization for the design of a jet plate for impingement cooling, L. Cocchi, F. Marini, M. Porcelli, E. Riccietti, Optimization and Engineering, https://doi.org/10.1007/s11081-025-09981-0, 2025.
Inexact Newton methods with matrix approximation by sampling for nonlinear least-squares and systems, S. Bellavia, G. Malaspina, B. Morini, Mathematics of Computation, 2025.
Regularized methods via cubic subspace minimization for nonconvex optimization, S. Bellavia, D. Palitta, M. Porcelli, V. Simoncini, Computational Optimization and Applications, 90, pp. 801-837, 2025.
Distributed Inexact Newton Method with Adaptive Step Sizes, D. Jakovetic, N. Krejic, G. Malaspina, Computational Optimization and Applications, 2025
Parallel Inexact Levenberg-Marquardt Method for Nearly-Separable Nonlinear Least Squares, L. Fodor, D. Jakovetić, N. Krejić, G. Malaspina, Journal of Global Optimization, 2025
A discrete Consensus-Based Global Optimization Method with Noisy Objective Function, S. Bellavia, G. Malaspina, Journal Optimization Theory and Applications, 2025.
An investigation of stochastic trust-region based algorithms for finite-sum minimization, S. Bellavia, B. Morini, S. Rebegoldi, Optimization Methods and Software, 2024
A Proposed Workflow for the Restoration of Image Artifacts in Forensic Applications, F. Argenti, S. Bellavia, M. Fontani, G. Guarnieri, M. Jerian, A. Limone, S. Rebegoldi, IEEE Access, 2024
A non-monotone trust-region method with noisy oracles and additional sampling, N. Krejic, N. Krklec Jerinkic, A. Martinez, M. Yousefi, Computational Optimization and Applications, 2024
L. Cavalli, D. Brandoni, M. Porcelli, E. Pascolo, Dictionary Learning for data compression within a Digital Twin Framework, CEUR-WP, 29-30 May 2024, Naples. [code]
SLiSeS: Subsampled Line Search Spectral Gradient Method for Finite Sums, N. K. Jerinkic, S. Bellavia, N. Krejic, M. Raydan, Numerical Computations: Theory and Algorithms NUMTA 2023, 129, 2023
Subsampled first-order optimization methods with applications in imaging, S. Bellavia, T. Bianconcini, N. Krejić, B. Morini, Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, 5, 2023
Recovering Corrupted Data in Wind Farm Measurements: A Matrix Completion Approach, M. Silei, S. Bellavia, F. Superchi, A. Bianchini, Energies 16 (4), 1674, 2023
The impact of noise on evaluation complexity: the deterministic trust-region case, S. Bellavia, G. Gurioli, B. Morini, P. L. Toint, Journal of Optimization Theory and Applications 196 (2), 2023
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization, S. Bellavia, N. Krejić, B. Morini, S. Rebegoldi, Computational Optimization and Applications 84 (1), 2023
Numerical solution of a class of quasi-linear matrix equations, M. Porcelli, V. Simoncini, Linear Algebra and its Applications 664, 2023
A degraded adhesion model for creep force calculation based on the CONTACT algorithm, Z. Shi, M. Meacci, M. Porcelli, E. Meli, A. Rindi, Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Journal of Rail and Rapid Transit, 2023
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations, D. Garmatter, M. Porcelli, F. Rinaldi, M. Stoll, Computational Optimization and Applications 84 (1), 2023
A hybrid compartmental model with a case study of COVID-19 in Great Britain and Israel, G. Malaspina, S. Racković, F. Valdeira, Journal of Mathematics in Industry 13 (1), 2023
Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes, G. Malaspina, D. Jakovetić, N. Krejić, Optimization Letters, 2023
A Split Levenberg-Marquardt Method for Large-Scale Sparse Problems, N. Krejic, G. Malaspina, L. Swaenen, Computational Optimization and Applications 85 (1), 2023
Accelerated Algorithms for Nonlinear Matrix Decomposition with the ReLU function, G. Seraghiti, A. Awari, A. Vandaele, M. Porcelli, N. Gillis, MLSP 2023, 17-20 September, 2023, Rome. [arXiv] [code]