We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to...
详细信息
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unified and standardized fashion for a large class of apparently disparate problems. Recent results on monotone operator splitting methods are applied to establish the convergence of a forward-backward algorithm to solve the generic problem. In turn, we recover, extend, and provide a simplified analysis for a variety of existing iterative methods. Applications to geometry/texture image decomposition schemes are also discussed. A novelty of our framework is to use extensively the notion of a proximity operator, which was introduced by Moreau in the 1960s.
For solving monotone inclusion problems, we propose an inertial under-relaxed version of the relative-error hybrid proximal extragradient method. We study the asymptotic convergence of the method, as well as its nonas...
详细信息
For solving monotone inclusion problems, we propose an inertial under-relaxed version of the relative-error hybrid proximal extragradient method. We study the asymptotic convergence of the method, as well as its nonasymptotic global convergence rates in terms of iteration complexity. We analyze the new method under more flexible assumptions than existing ones, both on the extrapolation and on the relative-error parameters. The approach is applied to two types of forward-backward type methods for solving structured monotone inclusions.
This paper is concerned with optimal control problems of forward-backward Markovian regime-switching systems involving impulse controls. Here the Markov chains are continuous-time and finite-state. We derive the stoch...
详细信息
This paper is concerned with optimal control problems of forward-backward Markovian regime-switching systems involving impulse controls. Here the Markov chains are continuous-time and finite-state. We derive the stochastic maximum principle for this kind of systems. Besides the Markov chains, the most distinguishing features of our problem are that the control variables consist of regular and impulsive controls, and that the domain of regular control is not necessarily convex. We obtain the necessary and sufficient conditions for optimal controls. Thereafter, we apply the theoretical results to a financial problem and get the optimal consumption strategies.
In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same assumptions as Tseng's forward-b...
详细信息
In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same assumptions as Tseng's forward-backward-forward method, namely, it does not require cocoercivity of the single-valued operator. Moreover, each iteration only uses one forward evaluation rather than two as is the case for Tseng's method. Variants of the method incorporating a linesearch, relaxation and inertia, or a structured three operator inclusion are also discussed.
In this paper we study the relationship between functional forward-backward stochastic systems and path-dependent PDEs. In the framework of functional Ito calculus, we introduce a path-dependent PDE and prove that its...
详细信息
In this paper we study the relationship between functional forward-backward stochastic systems and path-dependent PDEs. In the framework of functional Ito calculus, we introduce a path-dependent PDE and prove that its solution is uniquely determined by a functional forward-backward stochastic system.
This paper introduces a generalized forward-backward splitting algorithm for finding a zero of a sum of maximal monotone operators B + Sigma(n)(i=1) A(i), where B is cocoercive. It involves the computation of B in an ...
详细信息
This paper introduces a generalized forward-backward splitting algorithm for finding a zero of a sum of maximal monotone operators B + Sigma(n)(i=1) A(i), where B is cocoercive. It involves the computation of B in an explicit (forward) step and the parallel computation of the resolvents of the A(i)'s in a subsequent implicit (backward) step. We prove the algorithm's convergence in infinite dimension and its robustness to summable errors on the computed operators in the explicit and implicit steps. In particular, this allows efficient minimization of the sum of convex functions f + Sigma(n)(i=1) g(i), where f has a Lipschitz-continuous gradient and each g(i) is simple in the sense that its proximity operator is easy to compute. The resulting method makes use of the regularity of f in the forward step, and the proximity operators of the g(i) is are applied in parallel in the backward step. While the forward-backward algorithm cannot deal with more than n = 1 nonsmooth function, we generalize it to the case of arbitrary n. Examples on inverse problems in imaging demonstrate the advantage of the proposed methods in comparison to other splitting algorithms.
Many problems arising from machine learning, signal & image recovery, and compressed sensing can be casted into a monotone inclusion problem for finding a zero of the sum of two monotone operators. The forward-bac...
详细信息
Many problems arising from machine learning, signal & image recovery, and compressed sensing can be casted into a monotone inclusion problem for finding a zero of the sum of two monotone operators. The forward-backward splitting algorithm is one of the most powerful and successful methods for solving such a problem. However, this algorithm has only weak convergence in the infinite dimensional settings. In this paper, we propose a new modification of the FBA so that it possesses a norm convergent property. Moreover, we establish two strong convergence theorems of the proposed algorithms under more general conditions.
We propose a new general type of splitting methods for accretive operators in Banach spaces. We then give the sufficient conditions to guarantee the strong convergence. In the last section, we apply our results to the...
详细信息
We propose a new general type of splitting methods for accretive operators in Banach spaces. We then give the sufficient conditions to guarantee the strong convergence. In the last section, we apply our results to the minimization optimization problem and the linear inverse problem including the numerical examples.
A central aim of population genetics is the inference of the evolutionary history of a population. To this end, the underlying process can be represented by a model of the evolution of allele frequencies parametrized ...
详细信息
A central aim of population genetics is the inference of the evolutionary history of a population. To this end, the underlying process can be represented by a model of the evolution of allele frequencies parametrized by e.g., the population size, mutation rates and selection coefficients. A large class of models use forward-in-time models, such as the discrete Wright-Fisher and Moran models and the continuous forward diffusion, to obtain distributions of population allele frequencies, conditional on an ancestral initial allele frequency distribution. backward-in-time diffusion processes have been rarely used in the context of parameter inference. Here, we demonstrate how forward and backward diffusion processes can be combined to efficiently calculate the exact joint probability distribution of sample and population allele frequencies at all times in the past, for both discrete and continuous population genetics models. This procedure is analogous to the forward-backward algorithm of hidden Markov models. While the efficiency of discrete models is limited by the population size, for continuous models it suffices to expand the transition density in orthogonal polynomials of the order of the sample size to infer marginal likelihoods of population genetic parameters. Additionally, conditional allele trajectories and marginal likelihoods of samples from single populations or from multiple populations that split in the past can be obtained. The described approaches allow for efficient maximum likelihood inference of population genetic parameters in a wide variety of demographic scenarios. (c) 2017 Elsevier Ltd. All rights reserved.
We deal with monotone inclusion problems of the form 0 a A x + D x + N (C) (x) in real Hilbert spaces, where A is a maximally monotone operator, D a cocoercive operator and C the nonempty set of zeros of another cocoe...
详细信息
We deal with monotone inclusion problems of the form 0 a A x + D x + N (C) (x) in real Hilbert spaces, where A is a maximally monotone operator, D a cocoercive operator and C the nonempty set of zeros of another cocoercive operator. We propose a forward-backward penalty algorithm for solving this problem which extends the one proposed by Attouch et al. (SIAM J. Optim. 21(4): 1251-1274, 2011). The condition which guarantees the weak ergodic convergence of the sequence of iterates generated by the proposed scheme is formulated by means of the Fitzpatrick function associated to the maximally monotone operator that describes the set C. In the second part we introduce a forward-backward-forwardalgorithm for monotone inclusion problems having the same structure, but this time by replacing the cocoercivity hypotheses with Lipschitz continuity conditions. The latter penalty type algorithm opens the gate to handle monotone inclusion problems with more complicated structures, for instance, involving compositions of maximally monotone operators with linear continuous ones.
暂无评论