相关论文: Effective Termination of Kohn's Algorithm for Sube…

We study the semicontinuity of automorphism groups for perturbations of domains in complex space or in complex manifolds. We provide a new approach to the study of such results for domains having minimal boundary smoothness. The emphasis in…

Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

The problem of distributed matrix multiplication with straggler tolerance over finite fields is considered, focusing on field sizes for which previous solutions were not applicable (for instance, the field of two elements). We employ…

Comparison and localization results for the Lempert function, the Carath\'eodory distance and their infinitesimal forms on strongly pseudoconvex domains are obtained. Related results for visible and strongly complete domains are proved.

We develop a cut finite element method for a second order elliptic coupled bulk-surface model problem. We prove a priori estimates for the energy and $L^2$ norms of the error. Using stabilization terms we show that the resulting algebraic…

Let $ \ti \Om $ be a bounded convex domain in Euclidean $ n $ space, $ \hat x \in \ar \ti \Om, $ and $ r > 0. $ Let $ \ti u = (\ti u^1, \ti u^2, \dots, \ti u^N) $ be a weak solution to \[\nabla \cdot \left (|\nabla \ti u |^{p-2} \nabla \ti…

The method for the recursive calculation of the effective potential is applied successfully in case of weak coupling limit (g tend to zero) to a multidimensional complex cubic potential. In strong-coupling limit (g tend to infinity), the…

We show that if a bounded pseudoconvex domain satisfies the solvability of the bounded $\bar{\partial}$ problem, then the ideal of bounded holomorphic functions vanishing at a point in the domain is finitely generated. We also prove a…

We obtain new multilinear multiplier theorems for symbols of restricted smoothness which lie locally in certain Sobolev spaces. We provide applications concerning the boundedness of the commutators of Calder\'on and…

The affine scaling method has been a typical approach to study complex domains with noncompact automorphism group. In this article, we will introduce an alternative approach, so called, the method of potential scaling to construct a certain…

We consider the problem of minimizing a finite sum of convex functions subject to the set of minimizers of a convex differentiable function. In order to solve the problem, an algorithm combining the incremental proximal gradient method with…

We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…

In this paper, we obtain a more precise estimate of Catlin-type distance for smoothly bounded pseudoconvex domain of finite type in $\mathbb{C}^2$. As an application, we get an alternative proof of the Gromov hyperbolicity of this domain…

In this paper, we study the regularity of weak solutions and subsolutions of second-order elliptic equations having a gradient term with superquadratic growth. We show that, under appropriate integrability conditions on the data, all weak…

The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable quantum states. We study the convex optimization problem over…

We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…

In this work, we propose and study a framework of generalized proximal point algorithms associated with a maximally monotone operator. We indicate sufficient conditions on the regularization and relaxation parameters of generalized proximal…

This paper introduces and studies the convergence properties of a new class of explicit $\epsilon$-subgradient methods for the task of minimizing a convex function over the set of minimizers of another convex minimization problem. The…

In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…