Splitting Forward-Backward Penalty Scheme for Constrained Variational Problems
Journal of convex analysis, Tome 23 (2016) no. 2, pp. 531-565
\newcommand{\R}{\mathbf{R}} \renewcommand{\H}{\mathcal{H}} We study a forward backward splitting algorithm that solves the variational inequality \begin{equation*} A x +\nabla \Phi(x)+ N_C (x) \ni 0 \end{equation*} where $\H$ is a real Hilbert space, $A: \H\rightrightarrows \H$ is a maximal monotone operator, $\Phi: \H\to\R$ is a smooth convex function, and $N_C$ is the outward normal cone to a closed convex set $C\subset\H$. The constraint set $C$ is represented as the intersection of the sets of minima of two convex penalization function $\Psi_1:\H\to\R$ and $\Psi_2:\H\to\R\cup \{+\infty\}$. The function $\Psi_1$ is smooth, the function $\Psi_2$ is proper and lower semicontinuous. Given a sequence $(\beta_n)$ of penalization parameters which tends to infinity, and a sequence of positive time steps $(\lambda_n)$, the algorithm (SFBP), $n\geq 1$, \begin{equation*} \ \left\{\begin{array}{rcl} x_1 \in \H,\\ x_{n+1} = (I+\lambda_n A+\lambda_n\beta_n\partial\Psi_2)^{-1} (x_n-\lambda_n\nabla\Phi(x_n)-\lambda_n\beta_n\nabla\Psi_1(x_n)), \end{array}\right. \end{equation*} performs forward steps on the smooth parts and backward steps on the other parts. Under suitable assumptions, we obtain weak ergodic convergence of the sequence $(x_n)$ to a solution of the variational inequality. Convergence is strong when either $A$ is strongly monotone or $\Phi$ is strongly convex. We also obtain weak convergence of the whole sequence $(x_n)$ when $A$ is the subdifferential of a proper lower semicontinuous convex function. This provides a unified setting for several classical and more recent results, in the line of historical research on continuous and discrete gradient-like systems.
Classification :
37N40, 46N10, 49M30, 65K05, 65K10, 90B50, 90C25
Mots-clés : Constrained convex optimization, forward-backward algorithms, hierarchical optimization, maximal monotone operators, penalization methods, variational inequalities
Mots-clés : Constrained convex optimization, forward-backward algorithms, hierarchical optimization, maximal monotone operators, penalization methods, variational inequalities
@article{JCA_2016_23_2_JCA_2016_23_2_a8,
author = {M.-O. Czarnecki and N. Noun and J. Peypouquet},
title = {Splitting {Forward-Backward} {Penalty} {Scheme} for {Constrained} {Variational} {Problems}},
journal = {Journal of convex analysis},
pages = {531--565},
year = {2016},
volume = {23},
number = {2},
url = {http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a8/}
}
TY - JOUR AU - M.-O. Czarnecki AU - N. Noun AU - J. Peypouquet TI - Splitting Forward-Backward Penalty Scheme for Constrained Variational Problems JO - Journal of convex analysis PY - 2016 SP - 531 EP - 565 VL - 23 IS - 2 UR - http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a8/ ID - JCA_2016_23_2_JCA_2016_23_2_a8 ER -
%0 Journal Article %A M.-O. Czarnecki %A N. Noun %A J. Peypouquet %T Splitting Forward-Backward Penalty Scheme for Constrained Variational Problems %J Journal of convex analysis %D 2016 %P 531-565 %V 23 %N 2 %U http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a8/ %F JCA_2016_23_2_JCA_2016_23_2_a8
M.-O. Czarnecki; N. Noun; J. Peypouquet. Splitting Forward-Backward Penalty Scheme for Constrained Variational Problems. Journal of convex analysis, Tome 23 (2016) no. 2, pp. 531-565. http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a8/