Martina Cerulli

Martina Cerulli

Auto-generated profile, based on publicly available information

Martina Cerulli

Department of Computer Science University of Salerno Fisciano Italy

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 February 2021 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
MCMartina Cerulli
Martina Cerulli
CDClaudia D’aMbrosio
Claudia D’aMbrosio
LLLeo Liberti
Leo Liberti
MPMercedes Pelegrín
Mercedes Pelegrín

10 September 2020 in 4OR
Verified
Journal Article
Open access
PDF file
MCMartina Cerulli
Martina Cerulli
MSMarianna De Santis
Marianna De Santis
EGElisabeth Gaar
Elisabeth Gaar
AWAngelika Wiegele
Angelika Wiegele
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper, we focus on solving doubly nonnegative programs (DNN), which are semidefinite programs where the elements of the matrix variable are constrained to be nonnegative. Starting from two algorithms already proposed in the literature on conic programming, we introduce two new ADMMs by employing a factorization of the dual variable. It is well known that first order methods are not suitable to compute high precision optimal solutions, however an optimal solution of moderate precision often suffices to get high quality lower bounds on the primal optimal objective function value. We present methods to obtain such bounds by either perturbing the dual objective function value or by constructing a dual feasible solution from a dual approximate optimal solution. Both procedures can be used as a post-processing phase in our ADMMs. Numerical results for DNNs that are relaxations of the stable set problem are presented. They show the impact of using the factorization of the dual variable in order to improve the progress towards the optimal solution within an iteration of the ADMM. This decreases the number of iterations as well as the CPU time to solve the DNN to a given precision. The experiments also demonstrate that within a computationally cheap post-processing, we can compute bounds that are close to the optimal value even if the DNN was solved to moderate precision only. This makes ADMMs applicable also within a branch-and-bound algorithm.

1 September 2024 in Transportation Science
Verified
Journal Article
Closed access
MCMartina Cerulli
Martina Cerulli
CAClaudia Archetti
Claudia Archetti
EFElena Fernández
Elena Fernández
ILIvana Ljubić
Ivana Ljubić
In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connecting senders, customers, and independent carriers to fulfill delivery requests. As the carriers are not under the platform’s control, the platform has to anticipate their reactions while deciding how to allocate the delivery operations. Indeed, carriers’ decisions largely affect the platform’s revenue. In this paper, we model this problem using bilevel programming. At the upper level, the platform decides how to assign the orders to the carriers; at the lower level, each carrier solves a profitable tour problem to determine which offered requests to accept, based on her own profit maximization. Possibly, the platform can influence carriers’ decisions by determining also the compensation paid for each accepted request. The two considered settings result in two different formulations: the bilevel profitable tour problem with fixed compensation margins and with margin decisions, respectively. For each of them, we propose single-level reformulations and alternative formulations where the lower-level routing variables are projected out. A branch-and-cut algorithm is proposed to solve the bilevel models, with a tailored warm-start heuristic used to speed up the solution process. Extensive computational tests are performed to compare the proposed formulations and analyze solution characteristics. Funding: The research of E. Fernandez was partially funded through the Spanish Ministerio de Ciencia y Tecnología and European Regional Development Funds (ERDF) [Grant MTM2019-105824GB-I00]. The research of C. Archetti, M. Cerulli, and I. Ljubić was partially funded by CY Initiative of Excellence, France [Grant “Investissements d’Avenir ANR-16-IDEX-0008”]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0129 .

27 September 2024 in Optimization Letters
Verified
Journal Article
Open access
PDF file
AOAntoine Oustry
Antoine Oustry
MCMartina Cerulli
Martina Cerulli
Solving convex semi-infinite programming (SIP) problems is challenging when the separation problem, namely, the problem of finding the most violated constraint, is computationally hard. We propose to tackle this difficulty by solving the separation problem approximately, i.e., by using an inexact oracle. Our focus lies in two algorithms for SIP, namely the cutting-planes (CP) and the inner-outer approximation (IOA) algorithms. We prove the CP convergence rate to be in O(1/k), where k is the number of calls to the limited-accuracy oracle, if the objective function is strongly convex. Compared to the CP algorithm, the advantage of the IOA algorithm is the feasibility of its iterates. In the case of a semi-infinite program with a Quadratically Constrained Quadratic Programming separation problem, we prove the convergence of the IOA algorithm toward an optimal solution of the SIP problem despite the oracle’s inexactness.

28 April 2023 in European Journal of Operational Research
Verified
Journal Article
Open access
MCMartina Cerulli
Martina Cerulli
DSDomenico Serra
Domenico Serra
CSCarmine Sorgente
Carmine Sorgente
CAClaudia Archetti
Claudia Archetti
ILIvana Ljubić
Ivana Ljubić

1 January 2019
Verified
Book Chapter
Closed access
PDF file
MCMartina Cerulli
Martina Cerulli
CDClaudia D’ambrosio
Claudia D’ambrosio
LLLeo Liberti
Leo Liberti