Giacomo Borghi

Giacomo Borghi

Auto-generated profile, based on publicly available information

Giacomo Borghi

Heriot-Watt University, Edinburgh, UK

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
10 August 2023 in Applied Mathematics & Optimization
Verified
Journal Article
Open access
PDF file
GBGiacomo Borghi
Giacomo Borghi
MHMichael Herty
Michael Herty
Lorenzo PareschiLorenzo Pareschi
Lorenzo Pareschi
In this work we are interested in stochastic particle methods for multi-objective optimization. The problem is formulated via scalarization using parametrized, single-objective sub-problems which are solved simultaneously. To this end a consensus based multi-objective optimization method on the search space combined with an additional heuristic strategy to adapt parameters during the computations is proposed. The adaptive strategy aims to distribute the particles uniformly over the image space, in particular over the Pareto front, by using energy-based measures to quantify the diversity of the system. The resulting gradient-free metaheuristic algorithm is mathematically analyzed using a mean-field approximation of the algorithm iteration and convergence guarantees towards Pareto optimal points are rigorously proven. In addition, we analyze the dynamics when the Pareto front corresponds to the unit simplex, and show that the adaptive mechanism reduces to a gradient flow in this case. Several numerical experiments show the validity of the proposed stochastic particle dynamics, investigate the role of the algorithm parameters and validate the theoretical findings.

28 January 2023 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
GBGiacomo Borghi
Giacomo Borghi
MHMichael Herty
Michael Herty
Lorenzo PareschiLorenzo Pareschi
Lorenzo Pareschi
In this work we are interested in the construction of numerical methods for high-dimensional constrained nonlinear optimization problems by particle-based gradient-free techniques. A cons...

7 June 2022 in Applied Mathematics & Optimization
Verified
Journal Article
Open access
PDF file
ABAlessandro Benfenati
Alessandro Benfenati
GBGiacomo Borghi
Giacomo Borghi
Lorenzo PareschiLorenzo Pareschi
Lorenzo Pareschi
In this work we introduce a new class of gradient-free global optimization methods based on a binary interaction dynamics governed by a Boltzmann type equation. In each interaction the particles act taking into account both the best microscopic binary position and the best macroscopic collective position. For the resulting kinetic optimization methods, convergence to the global minimizer is guaranteed for a large class of functions under appropriate parameter constraints that do not depend on the dimension of the problem. In the mean-field limit we show that the resulting Fokker-Planck partial differential equations generalize the current class of consensus based optimization (CBO) methods. Algorithmic implementations inspired by the well-known direct simulation Monte Carlo methods in kinetic theory are derived and discussed. Several examples on prototype test functions for global optimization are reported including an application to machine learning.

1 August 2023 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
GBGiacomo Borghi
Giacomo Borghi
SGSara Grassi
Sara Grassi
LPLorenzo Pareschi
Lorenzo Pareschi

27 May 2026 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
GBGiacomo Borghi
Giacomo Borghi
HHHui Huang
Hui Huang
JQJinniao Qiu
Jinniao Qiu
We propose a zero-order optimization method for sequential min-max problems that employs two populations of interacting particles. The systems are coupled so that one population aims to s...

10 April 2026 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
GBGiacomo Borghi
Giacomo Borghi
Lorenzo PareschiLorenzo Pareschi
Lorenzo Pareschi
We establish quantitative convergence rates for stochastic particle approximation based on Nanbu-type Monte Carlo schemes applied to a broad class of collisional kinetic models. Using cou...