Search results for "Mathematics - Optimization and Control"
showing 10 items of 52 documents
Approachability in Population Games
2014
This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a population of individuals with given distribution on actions. First, convergence conditions are revisited based on the common prior on the population distribution, and we define the notion of \emph{1st-moment approachability}. Second, we develop a model of two coupled partial differential equations (PDEs) in the spirit of mean-field game theory: one describing the best-response of every player given the population distribution (this is a \emph{Hamilton-Jacobi-Bell…
Extremal polynomials in stratified groups
2018
We introduce a family of extremal polynomials associated with the prolongation of a stratified nilpotent Lie algebra. These polynomials are related to a new algebraic characterization of abnormal subriemannian geodesics in stratified nilpotent Lie groups. They satisfy a set of remarkable structure relations that are used to integrate the adjoint equations.
Bounded Computational Capacity Equilibrium
2010
We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded c…
Weak and strong convergence of an inertial proximal method for solving bilevel monotone equilibrium problems
2022
In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two monotone equilibrium bifunctions in Hilbert spaces. Under suitable conditions and without any restrictive assumption on the trajectories, the weak and strong convergence of the sequence generated by the iterative method are established. Two particular cases illustrating the proposed method are thereafter discussed with respect to hierarchical minimization problems and equilibrium problems under saddle point constraint. Furthermore, a numerical example is given to demonstrate the implementability of our algorithm. The algorithm and its convergence results improve and develop previous results i…
Asymptotics of accessibility sets along an abnormal trajectory
2001
We describe precisely, under generic conditions, the contact of the accessibility set at time $T$ with an abnormal direction, first for a single-input affine control system with constraint on the control, and then as an application for a sub-Riemannian system of rank 2. As a consequence we obtain in sub-Riemannian geometry a new splitting-up of the sphere near an abnormal minimizer $\gamma$ into two sectors, bordered by the first Pontryagin's cone along $\gamma$, called the $\xLinfty$-sector and the $\xLtwo$-sector. Moreover we find again necessary and sufficient conditions of optimality of an abnormal trajectory for such systems, for any optimization problem.
Regularization of chattering phenomena via bounded variation controls
2018
In control theory, the term chattering is used to refer to strong oscillations of controls, such as an infinite number of switchings over a compact interval of times. In this paper we focus on three typical occurences of chattering: the Fuller phenomenon, referring to situations where an optimal control switches an infinite number of times over a compact set; the Robbins phenomenon, concerning optimal control problems with state constraints, meaning that the optimal trajectory touches the boundary of the constraint set an infinite number of times over a compact time interval; the Zeno phenomenon, referring as well to an infinite number of switchings over a compact set, for hybrid optimal co…
Time Versus Energy in the Averaged Optimal Coplanar Kepler Transfer towards Circular Orbits
2015
International audience; The aim of this note is to compare the averaged optimal coplanar transfer towards circular orbits when the costs are the transfer time transfer and the energy consumption. While the energy case leads to analyze a 2D Riemannian metric using the standard tools of Riemannian geometry (curvature computations, geodesic convexity), the time minimal case is associated to a Finsler metric which is not smooth. Nevertheless a qualitative analysis of the geodesic flow is given in this article to describe the optimal transfers. In particular we prove geodesic convexity of the elliptic domain.
Refitting solutions promoted by $\ell_{12}$ sparse analysis regularization with block penalties
2019
International audience; In inverse problems, the use of an $\ell_{12}$ analysis regularizer induces a bias in the estimated solution. We propose a general refitting framework for removing this artifact while keeping information of interest contained in the biased solution. This is done through the use of refitting block penalties that only act on the co-support of the estimation. Based on an analysis of related works in the literature, we propose a new penalty that is well suited for refitting purposes. We also present an efficient algorithmic method to obtain the refitted solution along with the original (biased) solution for any convex refitting block penalty. Experiments illustrate the g…
Distributed $n$-player approachability and consensus in coalitional games
2015
We study a distributed allocation process where, at each time, every player: i) proposes a new bid based on the average utilities produced up to that time, ii) adjusts such allocations based on the inputs received from its neighbors, and iii) generates and allocates new utilities. The average allocations evolve according to a doubly (over time and space) averaging algorithm. We study conditions under which the average allocations reach consensus to any point within a predefined target set even in the presence of adversarial disturbances. Motivations arise in the context of coalitional games with transferable utilities (TU) where the target set is any set of allocations that makes the grand …
CALIBRATION OF LÉVY PROCESSES USING OPTIMAL CONTROL OF KOLMOGOROV EQUATIONS WITH PERIODIC BOUNDARY CONDITIONS
2018
We present an optimal control approach to the problem of model calibration for L\'evy processes based on a non parametric estimation procedure. The calibration problem is of considerable interest in mathematical finance and beyond. Calibration of L\'evy processes is particularly challenging as the jump distribution is given by an arbitrary L\'evy measure, which form a infinite dimensional space. In this work, we follow an approach which is related to the maximum likelihood theory of sieves. The sampling of the L\'evy process is modelled as independent observations of the stochastic process at some terminal time $T$. We use a generic spline discretization of the L\'evy jump measure and selec…