Laura Palagi

Laura Palagi

orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

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

Representative Publications

View All Publications
1 May 1999 in Transportation Science
Verified
Journal Article
Closed access
ACA. Ciancimino
A. Ciancimino
GIG. Inzerillo
G. Inzerillo
SLS. Lucidi
S. Lucidi
LPLaura Palagi
Laura Palagi
Railway passenger transportation plays a fundamental role in Europe, particularly in view of the growing number of trains offering valuable services such as high speed travel, high comfort, etc. Hence, it is advantageous to submit seat inventories to a Yield Management system to get the maximum revenue. We consider a deterministic linear programming model and a probabilistic nonlinear programming model for the network problem with non-nested seat allocation. A first comparative analysis of the computational results obtained by the two models, both in terms of the overall expected revenue and in terms of CPU time, is carried out. Furthermore, we describe a new nonlinear algorithm for the solution of the probabilistic nonlinear programming model that exploits the structure of the optimization problem. The numerical results obtained on a set of real data show that, for this class of problems, this algorithm is more efficient than other standard algorithms for nonlinear programming problems.

5 February 2021 in Life
Verified
Journal Article
Open access
PDF file
RSRuggiero Seccia
Ruggiero Seccia
SRSilvia Romano
Silvia Romano
MSMarco Salvetti
Marco Salvetti
Andrea CrisantiAndrea Crisanti
Andrea Crisanti
LPLaura Palagi
Laura Palagi
Francesca GrassiFrancesca Grassi
Francesca Grassi
The course of multiple sclerosis begins with a relapsing-remitting phase, which evolves into a secondarily progressive form over an extremely variable period, depending on many factors, each with a subtle influence. To date, no prognostic factors or risk score have been validated to predict disease course in single individuals. This is increasingly frustrating, since several treatments can prevent relapses and slow progression, even for a long time, although the possible adverse effects are relevant, in particular for the more effective drugs. An early prediction of disease course would allow differentiation of the treatment based on the expected aggressiveness of the disease, reserving high-impact therapies for patients at greater risk. To increase prognostic capacity, approaches based on machine learning (ML) algorithms are being attempted, given the failure of other approaches. Here we review recent studies that have used clinical data, alone or with other types of data, to derive prognostic models. Several algorithms that have been used and compared are described. Although no study has proposed a clinically usable model, knowledge is building up and in the future strong tools are likely to emerge.

1 January 2019 in Energy
Verified
Journal Article
Closed access
LPLaura Palagi
Laura Palagi
Apostolos PesyridisApostolos Pesyridis
Apostolos Pesyridis
Enrico SciubbaEnrico Sciubba
Enrico Sciubba
LTLorenzo Tocci
Lorenzo Tocci

1 January 2002 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
FFFrancisco Facchinei
Francisco Facchinei
SLStefano Lucidi
Stefano Lucidi
LPLaura Palagi
Laura Palagi
A method for the solution of minimization problems with simple bounds is presented. Global convergence of a general scheme requiring the approximate solution of a single linear system at each iteration is proved and a superlinear convergence rate is established without requiring the strict complementarity assumption. The algorithm proposed is based on a simple, smooth unconstrained reformulation of the bound constrained problem and may produce a sequence of points that are not feasible. Numerical results and comparison with existing codes are reported.

20 March 2020 in PLOS ONE
Verified
Journal Article
Open access
PDF file
RSRuggiero Seccia
Ruggiero Seccia
DGDaniele Gammelli
Daniele Gammelli
FDFabio Dominici
Fabio Dominici
SRSilvia Romano
Silvia Romano
ALAnna Chiara Landi
Anna Chiara Landi
LPLaura Palagi
Laura Palagi
Multiple Sclerosis (MS) progresses at an unpredictable rate, but predictions on the disease course in each patient would be extremely useful to tailor therapy to the individual needs. We explore different machine learning (ML) approaches to predict whether a patient will shift from the initial Relapsing-Remitting (RR) to the Secondary Progressive (SP) form of the disease, using only “real world” data available in clinical routine. The clinical records of 1624 outpatients (207 in the SP phase) attending the MS service of Sant’Andrea hospital, Rome, Italy, were used. Predictions at 180, 360 or 720 days from the last visit were obtained considering either the data of the last available visit (Visit-Oriented setting), comparing four classical ML methods (Random Forest, Support Vector Machine, K-Nearest Neighbours and AdaBoost) or the whole clinical history of each patient (History-Oriented setting), using a Recurrent Neural Network model, specifically designed for historical data. Missing values were handled by removing either all clinical records presenting at least one missing parameter (Feature-saving approach) or the 3 clinical parameters which contained missing values (Record-saving approach). The performances of the classifiers were rated using common indicators, such as Recall (or Sensitivity) and Precision (or Positive predictive value). In the visit-oriented setting, the Record-saving approach yielded Recall values from 70% to 100%, but low Precision (5% to 10%), which however increased to 50% when considering only predictions for which the model returned a probability above a given “confidence threshold”. For the History-oriented setting, both indicators increased as prediction time lengthened, reaching values of 67% (Recall) and 42% (Precision) at 720 days. We show how “real world” data can be effectively used to forecast the evolution of MS, leading to high Recall values and propose innovative approaches to improve Precision towards clinically useful values.

1 February 1998 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
SLStefano Lucidi
Stefano Lucidi
LPLaura Palagi
Laura Palagi
MRMassimo Roma
Massimo Roma
In this paper we consider the problem of minimizing a (possibly nonconvex) quadratic function with a quadratic constraint. We point out some new properties of the problem. In particular, in the first part ofthe paper, we show that (i) given a KKT point that is not a global minimizer, it is easy to find a "better" feasible point; (ii) strict complementarity holds at the local-nonglobal minimizer. In the second part of this paper, we show that the original constrained problem is equivalent to the unconstrained minimization of a piecewise quartic merit function. Using the unconstrained formulation we give, in the nonconvex case, a new second order necessary condition for global minimizers. In the third part of this paper, algorithmic applications of the preceding results are briefly outlined and some preliminary numerical experiments are reported.