Related papers: Operator Splitting Performance Estimation: Tight c…
Feasibility problem aims to find a common point of two or more closed (convex) sets whose intersection is nonempty. In the literature, projection based algorithms are widely adopted to solve the problem, such as the method of alternating…
In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety proving, bug finding, termination and non-termination proving,…
Bi-factor analysis is a form of confirmatory factor analysis widely used in psychological and educational measurement. The use of a bi-factor model requires the specification of an explicit bi-factor structure on the relationship between…
The Douglas-Rachford algorithm can be represented as the fixed point iteration of a firmly nonexpansive operator. When the operator has no fixed points, the algorithm's iterates diverge, but the difference between consecutive iterates…
The forward-backward splitting algorithm is a popular operator-splitting method for solving monotone inclusion of the sum of a maximal monotone operator and a cocoercive operator. In this paper, we present a new convergence analysis of a…
An equation containing a fractional power of an elliptic operator of second order is studied for Dirichlet boundary conditions. Finite difference approximations in space are employed. The proposed numerical algorithm is based on solving an…
We consider the minimum-energy control of a car, which is modelled as a point mass sliding on the ground in a fixed direction, and so it can be mathematically described as the double integrator. The control variable, representing the…
Data splitting divides data into two parts. One part is reserved for model selection. In some applications, the second part is used for model validation but we use this part for estimating the parameters of the chosen model. We focus on the…
In this paper, we rigorously analyze the energy, momentum and magnetic moment behaviours of two splitting methods for solving charged-particle dynamics. The near-conservations of these invariants are given for the system under constant…
We analyse the splitting algorithm performance in the estimation of rare event probabilities and this in a discrete multidimensional framework. For this we assume that each threshold is partitioned into disjoint subsets and the probability…
In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas-Rachford splitting method. Our algorithm sweeps the training set by randomly selecting a mini-batch of data…
In this paper we describe an iterative operator-splitting method for unbounded operators. We derive error bounds for iterative splitting methods in the presence of unbounded operators and semigroup operators. Here mixed applications of…
Semidefinite programming is a powerful tool in the design and analysis of approximation algorithms for combinatorial optimization problems. In particular, the random hyperplane rounding method of Goemans and Williamson has been extensively…
We consider unsteady poroelasticity problem in fractured porous medium within the classical Barenblatt double-porosity model. For numerical solution of double-porosity poroelasticity problems we construct splitting schemes with respect to…
The Douglas-Rachford algorithm is a simple yet effective method for solving convex feasibility problems. However, if the underlying constraints are inconsistent, then the convergence theory is incomplete. We provide convergence results when…
We present semi-decentralized and distributed algorithms, designed via a preconditioned forward-backward operator splitting, for solving large-scale, decomposable semidefinite programs (SDPs). We exploit a chordal aggregate sparsity pattern…
We study distributed composite optimization over networks: agents minimize the sum of a smooth (strongly) convex function, the agents' sum-utility, plus a non-smooth (extended-valued) convex one. We propose a general algorithmic framework…
We construct new, efficient, and accurate high-order finite differencing operators which satisfy summation by parts. Since these operators are not uniquely defined, we consider several optimization criteria: minimizing the bandwidth, the…
Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…
We introduce some general tools to design exact splitting methods to compute numerically semigroups generated by inhomogeneous quadratic differential operators. More precisely, we factorize these semigroups as products of semigroups that…