2022


Retour à la vue des calendrier
Jeudi 13 Octobre
Heure: 10:30 - 11:30
Lieu: Salle A303, Université de Villetaneuse
Résumé: Turn it around. The opportunities of Circular Economy in operation management
Description: Pablo Andres Maya The traditional economic model based on produce, use, and disposal is reaching its limits. The Circular Economy is an alternative paradigm that envisions a better use of the limited resources we already have. However, putting into practice the circular economy imposes challenges and opportunities to operations management that are still to be addressed. We will discuss the role of analytics and operations research in tackling those challenges.
Jeudi 17 Novembre
Heure: 10:30 - 11:30
Lieu: Salle A303, Université de Villetaneuse
Résumé: On the solution of convex Semi-Infinite Problems
Description: Martina Cerulli In this talk, we will present the results of the paper "Convergent algorithms for a class of convex semi-infinite programs" by M. Cerulli, A. Oustry, C. D'Ambrosio, L. Liberti, accepted for publication on SIAM Journal on Optimization. In this paper, we focus on convex Semi-Infinite Problems (SIPs) with an infinite number of quadratically parametrized constraints, not necessarily convex w.r.t. the parameter. A new convergent approach to solve these SIPs is proposed, leveraging the dualization of the inner problem. Indeed, based on the Lagrangian dual of the inner problem, a convex and tractable restriction of the considered SIP is derived. We state sufficient conditions for the optimality of this restriction. If these conditions are not met, the restriction is enlarged through an Inner-Outer Approximation Algorithm, and its value converges to the value of the original semi-infinite problem. This new algorithmic approach is compared with the classical Cutting Plane algorithm. We propose a new rate of convergence of the Cutting Plane algorithm, directly related to the iteration index, derived when the objective function is strongly convex, and under a strict feasibility assumption. We successfully test the two methods on two applications: the constrained quadratic regression and a zero-sum game with cubic payoff.
Jeudi 24 Novembre
Heure: 10:30 - 11:30
Lieu: Salle A303, Université de Villetaneuse
Résumé: Combinatorial solvers and neural networks
Description: Pasquale Minervini