Matteo Lapucci

Orcid: 0000-0002-2488-5486

According to our database1, Matteo Lapucci authored at least 19 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
A Unifying Framework for Sparsity-Constrained Optimization.
J. Optim. Theory Appl., November, 2023

Inexact penalty decomposition methods for optimization problems with geometric constraints.
Comput. Optim. Appl., July, 2023

A memetic procedure for global multi-objective optimization.
Math. Program. Comput., June, 2023

Improved front steepest descent for multi-objective optimization.
Oper. Res. Lett., May, 2023

A limited memory Quasi-Newton approach for multi-objective optimization.
Comput. Optim. Appl., May, 2023

Loss-Optimal Classification Trees: A Generalized Framework and the Logistic Case.
CoRR, 2023

2022
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems.
Optim. Methods Softw., 2022

A study on sequential minimal optimization methods for standard quadratic problems.
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

Pareto front approximation through a multi-objective augmented Lagrangian method.
EURO J. Comput. Optim., 2021

A Robust Initialization of Residual Blocks for Effective ResNet Training without Batch Normalization.
CoRR, 2021

An effective procedure for feature subset selection in logistic regression based on information criteria.
Comput. Optim. Appl., 2021

2020
An Alternating Augmented Lagrangian method for constrained nonconvex optimization.
Optim. Methods Softw., 2020

An augmented Lagrangian algorithm for multi-objective optimization.
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


  Loading...