1,028 research outputs found

    Well-posedness via Monotonicity. An Overview

    Full text link
    The idea of monotonicity (or positive-definiteness in the linear case) is shown to be the central theme of the solution theories associated with problems of mathematical physics. A "grand unified" setting is surveyed covering a comprehensive class of such problems. We elaborate the applicability of our scheme with a number examples. A brief discussion of stability and homogenization issues is also provided.Comment: Thoroughly revised version. Examples correcte

    Dynamical systems and forward-backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator

    Full text link
    In a Hilbert framework, we introduce continuous and discrete dynamical systems which aim at solving inclusions governed by structured monotone operators A=∂Φ+BA=\partial\Phi+B, where ∂Φ\partial\Phi is the subdifferential of a convex lower semicontinuous function Φ\Phi, and BB is a monotone cocoercive operator. We first consider the extension to this setting of the regularized Newton dynamic with two potentials. Then, we revisit some related dynamical systems, namely the semigroup of contractions generated by AA, and the continuous gradient projection dynamic. By a Lyapunov analysis, we show the convergence properties of the orbits of these systems. The time discretization of these dynamics gives various forward-backward splitting methods (some new) for solving structured monotone inclusions involving non-potential terms. The convergence of these algorithms is obtained under classical step size limitation. Perspectives are given in the field of numerical splitting methods for optimization, and multi-criteria decision processes.Comment: 25 page

    Monotone Inclusions, Acceleration and Closed-Loop Control

    Full text link
    We propose and analyze a new dynamical system with a closed-loop control law in a Hilbert space H\mathcal{H}, aiming to shed light on the acceleration phenomenon for \textit{monotone inclusion} problems, which unifies a broad class of optimization, saddle point and variational inequality (VI) problems under a single framework. Given A:H⇉HA: \mathcal{H} \rightrightarrows \mathcal{H} that is maximal monotone, we propose a closed-loop control system that is governed by the operator I−(I+λ(t)A)−1I - (I + \lambda(t)A)^{-1}, where a feedback law λ(⋅)\lambda(\cdot) is tuned by the resolution of the algebraic equation λ(t)∥(I+λ(t)A)−1x(t)−x(t)∥p−1=θ\lambda(t)\|(I + \lambda(t)A)^{-1}x(t) - x(t)\|^{p-1} = \theta for some θ>0\theta > 0. Our first contribution is to prove the existence and uniqueness of a global solution via the Cauchy-Lipschitz theorem. We present a simple Lyapunov function for establishing the weak convergence of trajectories via the Opial lemma and strong convergence results under additional conditions. We then prove a global ergodic convergence rate of O(t−(p+1)/2)O(t^{-(p+1)/2}) in terms of a gap function and a global pointwise convergence rate of O(t−p/2)O(t^{-p/2}) in terms of a residue function. Local linear convergence is established in terms of a distance function under an error bound condition. Further, we provide an algorithmic framework based on the implicit discretization of our system in a Euclidean setting, generalizing the large-step HPE framework. Although the discrete-time analysis is a simplification and generalization of existing analyses for a bounded domain, it is largely motivated by the above continuous-time analysis, illustrating the fundamental role that the closed-loop control plays in acceleration in monotone inclusion. A highlight of our analysis is a new result concerning pthp^{th}-order tensor algorithms for monotone inclusion problems, complementing the recent analysis for saddle point and VI problems.Comment: Accepted by Mathematics of Operations Research; 42 Page
    • …
    corecore