Related papers: A modified proximal contraction principle with app…
This paper deals with the solving of variational inequality problem where the constrained set is given as the intersection of a number of fixed-point sets. To this end, we present an extrapolated sequential constraint method. At each…
In this paper, we provide a simple convergence analysis of proximal gradient algorithm with Bregman distance, which provides a tighter bound than existing result. In particular, for the problem of minimizing a class of convex objective…
This paper addresses the challenging issue of symmetry in mixed-integer convex optimization problems, which frequently arise in real-world applications such as the unit commitment problem. Although variable aggregation techniques have been…
A simple bilevel variational problem where the lower level is a variational inequality while the upper level is an optimization problem is studied. We consider an inexact version of the lower problem, which guarantees enough regularity to…
In this paper, we explore adaptive inference based on variational Bayes. Although several studies have been conducted to analyze the contraction properties of variational posteriors, there is still a lack of a general and computationally…
The objective of this paper is to introduce and study a complicated nonlinear system, called coupled variational-hemivariational inequalities, which is described by a highly nonlinear coupled system of inequalities on Banach spaces. We…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…
We obtain existence and convergence theorems on two variants of the proximal point algorithm for proper lower semicontinuous convex functions in complete geodesic spaces with curvature bounded above.
In this paper, we extend the concept of split variational inequality problems from Hilbert spaces to Banach spaces. Then we apply the Fan-KKM theorem to prove the existence of solutions to some split variational inequality problems and some…
The aim of this paper is twofold: first, to extend the area of applications of tropical optimization by solving new constrained location problems, and second, to offer new closed-form solutions to general problems that are of interest to…
New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…
We present a variational principle governing the quasistatic evolution of a linearized elastoplastic material. In case of linear hardening, the novel characterization allows to recover and partly extend some known results and proves itself…
We consider the question of quantitative stability of minimisers for a well-known variational problem for which the infimum of the energy is not achieved in the classical sense, namely for the Dirichlet energy of degree $1$ maps from closed…
The isodiametric inequality is derived from the isoperimetric inequality trough a variational principle, establishing that balls maximize the perimeter among convex sets with fixed diameter. This principle brings also quantitative…
We propose a novel method for template matching in unconstrained environments. Its essence is the Best-Buddies Similarity (BBS), a useful, robust, and parameter-free similarity measure between two sets of points. BBS is based on counting…
We consider the minimization problem for an integral functional $J$, possibly non-convex and non-coercive in $W^{1,1}_0(\Omega)$, where $\Omega\subset\R^n$ is a bounded smooth set. We prove sufficient conditions in order to guarantee that a…
This paper concerns with mesh restrictions that are needed to satisfy several important mathematical properties -- maximum principles, comparison principles, and the non-negative constraint -- for a general linear second-order elliptic…
The Alternating Minimization Algorithm (AMA) has been proposed by Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be…
In this paper, we present some fixed point results for generalized $\theta -\phi -$contraction in the framework of $\left( \alpha ,\eta \right)-$compete rectangular $b-$metric spaces. Further, we establish some fixed point theorems for this…
We provide a framework for computing the exact worst-case performance of any algorithm belonging to a broad class of oracle-based first-order methods for composite convex optimization, including those performing explicit, projected,…