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

We show some lower estimates for the Kobayashi-Royden metric on a class of smooth bounded pseudoconvex domains.

Typically, the sequence of points generated by an optimization algorithm may have multiple limit points. Under convexity assumptions, however, (sub)gradient methods are known to generate a convergent sequence of points. In this paper, we…

In this paper, finite type domains with hyperbolic orbit accumulation points are studied. We prove, in case of $\mathbb{C}^2$, it has to be a (global) pseudoconvex domain, after an assumption of boundary regularity. Moreover, one of the…

We study a general class of convex submodular optimization problems with indicator variables. Many applications such as the problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled in…

This paper is concerned with the development of weak Galerkin (WG) finite element method for optimal control problems governed by second order elliptic partial differential equations (PDEs). It is advantageous to use discontinuous finite…

An accurate approximation of solutions to elliptic problems in infinite domains is challenging from a computational point of view. This is due to the need to replace the infinite domain with a sufficiently large and bounded computational…

We solve the Kato square root problem for bounded measurable perturbations of subelliptic operators on connected Lie groups. The subelliptic operators are divergence form operators with complex bounded coefficients, which may have lower…

We establish a weighted $L^p$ norm estimate for the Bergman projection for a class of pseudoconvex domains. We obtain an upper bound for the weighted $L^p$ norm when the domain is, for example, a bounded smooth strictly pseudoconvex domain,…

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

This article is about a problem in the numerical analysis of random operators. We study a version of the finite section method for the approximate solution of equations $Ax=b$ in infinitely many variables, where $A$ is a random Jacobi…

The aim of this short note is to investigate the geometry of weakly complete subdomains of Grauert type surfaces, i.e. open connected sets D, sitting inside a Grauert type surface X, which admit a smooth plurisubharmonic exhaustion…

Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…

This paper develops a smoothing-based postprocessing method for superconvergence in finite element methods. The method applies a few smoothing iterations, such as damped Jacobi, Gauss-Seidel, or conjugate gradient, with initial guess being…

A theoretical analysis of the finite element method for a generalized Robin boundary value problem, which involves a second-order differential operator on the boundary, is presented. If $\Omega$ is a general smooth domain with a curved…

In this paper, we present new second-order algorithms for composite convex optimization, called Contracting-domain Newton methods. These algorithms are affine-invariant and based on global second-order lower approximation for the smooth…

Minimax optimization has been central in addressing various applications in machine learning, game theory, and control theory. Prior literature has thus far mainly focused on studying such problems in the continuous domain, e.g.,…

We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…

The purpose of this paper is to prove a local p-adic monodromy theorem for ordinary abelian surfaces and K3 surfaces with bad reduction in characteristic p. As an application, we get a finiteness result for the reduction of their Hecke…

We prove that in a strongly pseudoconvex domain with smooth boundary, then the length of a geodesic for the Kobayashi-Royden infinitesimal metric between two points is bounded by a constant multiple of the Euclidean distance between the…

We introduce a geometric condition of Bloch type which guarantees that a subset of a bounded convex domain in several complex variables is degenerate with respect to every iterated function system. Furthermore we discuss the relations of…