Matteo Lapucci
Orcid: 0000-0002-2488-5486
According to our database1,
Matteo Lapucci authored at least 31 papers
between 2019 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2026
Effectively leveraging momentum terms in stochastic line search frameworks for fast optimization of finite-sum problems.
Comput. Optim. Appl., June, 2026
Comput. Optim. Appl., March, 2026
Correction: On the computation of the efficient frontier in advanced sparse portfolio optimization.
4OR, March, 2026
On the computation of the efficient frontier in advanced sparse portfolio optimization.
4OR, March, 2026
Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization.
J. Glob. Optim., February, 2026
Sample-wise Constrained Learning via a Sequential Penalty Approach with Applications in Image Processing.
CoRR, January, 2026
2025
A Robust Initialization of Residual Blocks for Effective ResNet Training Without Batch Normalization.
IEEE Trans. Neural Networks Learn. Syst., January, 2025
2024
On the Convergence of Inexact Alternate Minimization in Problems with ℓ <sub>0</sub> Penalties.
Oper. Res. Forum, June, 2024
Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms.
J. Optim. Theory Appl., April, 2024
Integrated task scheduling and personnel rostering of airports ground staff: A case study.
Expert Syst. Appl., March, 2024
Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization.
Oper. Res. Lett., 2024
Advances in nonlinear optimization and equilibrium problems - Special issue editorial.
EURO J. Comput. Optim., 2024
Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models.
CoRR, 2024
2023
J. Optim. Theory Appl., November, 2023
Inexact penalty decomposition methods for optimization problems with geometric constraints.
Comput. Optim. Appl., July, 2023
Math. Program. Comput., June, 2023
Oper. Res. Lett., May, 2023
Comput. Optim. Appl., May, 2023
CoRR, 2023
2022
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems.
Optim. Methods Softw., 2022
4OR, 2022
2021
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems.
J. Optim. Theory Appl., 2021
A Two-Level Decomposition Framework Exploiting First and Second Order Information for SVM Training Problems.
J. Mach. Learn. Res., 2021
EURO J. Comput. Optim., 2021
An effective procedure for feature subset selection in logistic regression based on information criteria.
Comput. Optim. Appl., 2021
2020
Optim. Methods Softw., 2020
Comput. Optim. Appl., 2020
2019
On the convergence of inexact augmented Lagrangian methods for problems with convex constraints.
Oper. Res. Lett., 2019
An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series.
Comput. Optim. Appl., 2019