Conférences  >  Mathématiques  >  Optimisation, recherche opérationnelle

CIRM – Centre International de Rencontres Mathématiques

Ergodic optimization is a general framework in dynamical system where an observable is understood through its minimum over the set of invariant probability measures. A measure that attained that minimum is called minimizing. The general question is to understand the set of minimizing measures and more generally the set of minimizing orbits. One possible approach is to see minimizing measures as ground states, that is as limits of Gibbs measures at zero temperature. Gibbs measures are eigensolutions of the Ruelle operator or the transfer operator. We intend to study such questions in the framework of skew products of dynamical systems where the base dynamics is random (ergodic and invertible) and the fiber dynamics is a composition of maps indexed by a random environment. The problem of optimizing an observable in a random environment is new and has not yet been studied.

TU Wien, Research Unit for Variational Analysis, Dynamics and Operations Research

A well established conference on Optimal Control (ODF, PDE), Dynamic Games/Mean Field Games, Continuous Optimization; Shape Optimization, Mathematical Economics, and Industrial Applications. The organisation committee is lead by Aris Daniilidis. The conference features invited speakers, 5 parallel sessions over 4 days and contributed talks and posters. Registration opens January 2025.

Event Secretariat;     Email.: vc2025@tuwien.ac.at

Optimal Control (ODF, PDE), Dynamic Games/Mean Field Games, Continuous Optimization, Shape Optimization, Mathematical Economics, Industrial Applications

Systèmes, contrôle et automatisation,    Mathématiques appliquées (en général)

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Géométrie et topologie,    Réseaux de neurones et intelligence artificielle, apprentissage automatique

University of Liverpool

This two day Colloquium aims to bring together researchers in discrete mathematics, from areas such as structural and algorithmic graph theory, extremal combinatorics, logic and foundations of Computer Science. There is a four-hour tutorial on Constraint Satisfaction Problems given by Andrei Krokhin (Durham), nine invited talks, and a session with contributed one slide pitches by junior researchers.

Constraint Satisfaction Problems, Extremal Combinatorics, Structural Graph Theory, Algorithmic Meta Theorems.

Théorie des graphes et combinatoire,    Logique mathématique et fondements

This PhD School is part of the broader CWI Research Semester Programme on Learning Enhanced Optimization, contributing to its overarching mission of advancing cutting-edge research in theoretical computer science, operations research and beyond.

Cours et évènements pour étudiants en mathématiques,    Réseaux de neurones et intelligence artificielle, apprentissage automatique

Open Data Science Conference

ODSC West will feature 250+ speakers, instructors, and practitioners, 2,500 of your fellow data and AI practitioners, and hands-on instruction for world-class experts in: AI Agents, GenAI, LLMs, AI Engineering, Machine Learning, Deep Learning, AgentOps, LLMOps, MLOps, Ai for Robotics, Data Engineering, RAG, Reasoning, AI Safety & Security & more. You’ll also be able to build meaningful connections with speakers and peers in a relaxed setting during our networking events like the ODSC Networking Reception, Dinner with Data Scientists, Meet the Speaker session, Book Signing sessions, and more.

Tél.: [none];     Email.: iryna@odsc.com

ODSCWest, AI, Data Science, LLMs, Machine Learning

Réseaux de neurones et intelligence artificielle, apprentissage automatique,    Mathématiques numériques

The Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS) is a biennial event that brings together researchers and practitioners from around the world. Since 2001, LAGOS has served as a key forum for the exchange of ideas and collaboration. It is the merger of two Latin American conferences: the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO) and the Latin American Conference on Combinatorics, Graphs, and Applications (LACGA).

Algorithmes et structures de données,    Théorie des graphes et combinatoire

MIP South America is supported by the Mixed Integer Programming Society (MIPS), a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. It brings together researchers, students, and industry actors from around the globe, fostering collaboration and providing a showcase for students, early career academics, and developments in industry and novel applications. In this edition, we are putting a special focus on bringing a considerable number of speakers based in different countries of South America.

Algorithmes et structures de données,    Cours et évènements pour étudiants en mathématiques