SMAI-MODE 2020: JOURNéES SMAI-MODE 2020
TALK KEYWORD INDEX

This page contains an index consisting of author-provided keywords.

A
Accelerated methods
Adaptive therapy
Adversarial learning
algebraic number
Auctions Theory
augmented Lagrangian algorithm
B
Bi-level optimization
Bilevel Programming
bouncing trajectory phenomenon
Branch-and-Bound
branch-and-bound algorithm
Branching diffusion process
C
Chamber Complex
Chance constraints
Chattering
Classification
closed measures
Clustering
Combinatorial Optimization
common noise
Complexity
Concavification
Congestion
conic
Constrained Nash Equilibrium
Convergence linéaire
convex
Coordinate Descent
cut locus
D
Decomposition
Decomposition-coordination
Deflated Value Iteration
descente par coordonnée
diffusion
Discrete Geometry
Distance function
Dynamic Games
Dynamic Programming
dynamic programming principle
Dynamical systems
Déterminant fonctionnel
E
Energy system
Entropic regularization
Equilibrium
equilibrium refinement
Extra-Gradient
F
Feasible Games
Fenchel-Moreau conjugacy
financial equilibrium
Finslerian Geometry
First Hitting Times
fonction $\zeta$ spectrale
functional equations
G
game theory
Games
Global Optimization
H
Hamilton-Jacobi equations
Hamiltonian continuity
Hitting time analysis
HJB Equations
Hopf extension theorem
Hyperparameter optimization
Hyperparameter selection
I
Identification
Impulse controls
Incomplete information
Index of equilibria
index theory
Infinite horizon optimal control problem
Information Design
Interior Point Methods
interior-point methods
K
Kernel methods
Knitro
L
Lagrangian discretization
Langevin sampler
last iterate
Layered Least Squares
Linear Matroid
Linear Programming
Logistic regression
long-term assets
M
Machine learning
Maintenance scheduling
Mathematical economics
Mathematical oncology
Mean Field Games
Mean Payoff Stochastic Games
Median of Means
Microbial growth
Model-based methods
Multi-objective programming
Multistage
Multistage Stochastic programming
méthode primale-duale
N
N-Vortex problem
Nash equilibrium
networks
Non cooperative finite games
Non-linear programming
Non-parametric regression
Non-smooth optimization
nonconvex optimization
nonlinear programming
Nonsmooth Analysis
Nonsmooth Optimization
Normal fan
Numerical benchmark
O
online convex optimization
opinion dynamics
Optimal Control
Optimal Power Flow
optimal sampling times
optimal synthesis
Optimal transport
Optimisation globale
Optimistic Optimization
Optimization
Optimization Algorithms
opérateur de Schrödinger
P
Pairwise stability
Pharmacoresistance
Planning
Polyhedron
Pontryagin Maximum Principle
potential games
Power System
Probabilistic properties
Prox-regular sets
Proximal Gradient
Q
quadratic optimization
Quadratic Reformulation
R
Rational learning
re-traded assets
Reeb foliation
regret analysis
Relaxed control
Repeated games
replicator dynamics
Risk measure
Robust estimation
Routing games
running state constraints
S
sampled-data control
selection
Semi-Definite Programming
Semi-Lagrangian scheme
Separation
Sequential network formation
Session industrielle
Shape constraints
Shape from Shading
signaling games
Sinkhorn divergence
Smart Grids
Solveur
sous-régularité métrique
sparse optimization
Sparsity
stability
Stable Matching
state constraint
State constraints
Stochastic approximation with constant step
Stochastic control
Stochastic Optimal Control
Stochastic optimization
Stochastic Programming
Stopping Problem
Subgame perfect equilibrium
subgradient method
T
Time series
Trajectory reconstruction
Tropical algebra
U
Unbalanced OT
unconstrained optimization
V
Variables mixtes
Variance Reduction
Variational Analysis
Variational formulation
Variational Inequality
viscosity solutions
W
water management
Web advertising
Wolfe duality