Related papers: Algorithms for subelliptic multipliers in $\mathbb…
For a pseudoconvex domain in complex space, we prove the equivalence of the local hypoellipticity of the system (di-bar, di-bar*) with the system (di-bar_b,di-bar*_b) induced in the boundary. This develops a result of ours which used the…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
The purpose of this article is twofold. The first aim is to characterize $h$-extendibility of smoothly bounded pseudoconvex domains in $\mathbb C^{n+1}$ by their noncompact automorphism groups. Our second goal is to show that if the…
In this paper, we obtain the Gehring-Hayman type theorem on smoothly bounded pseudoconvex domains of finite type in $\mathbb{C}^2$. As an application, we provide a quantitative comparison between global and local Kobayashi distances near a…
We consider the problem of maximizing the volume of hermitian ellipsoids inscribed in a given pseudoconvex domain in complex Euclidean space. We prove existence and uniqueness, and give a characterization of the maximizer.
We give an explicit construction of special strongly pseudoconvex domains in C^n of handlebody type, i.e., domains which are small tubes surrounding the union of a quadratic strongly pseudoconvex domain with an attached totally real handle.…
In this paper we study the geometry and the topology of unbounded domains in the Hyperbolic Space $\mathbb{H} ^n$ supporting a bounded positive solution to an overdetermined elliptic problem. Under suitable conditions on the elliptic…
We show subellipticity of the d-bar Neumann problem on domains with Lipschitz boundary in the presence of plurisubharmonic functions with Hessians of algebraic growth. In particular, a subelliptic estimate holds near a point where the…
For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate…
The $L^2$ theory of the $\bar\partial$ operator on domains in $\mathbb{C}^n$ is predicated on establishing a good basic estimate. Typically, one proves not a single basic estimate but a family of basic estimates that we call a family of…
We reduce the problem of constructing a linear solution operator to the $\bar{\partial}$-equation on smoothly bounded weakly pseudoconvex domains, $\Omega$, in $\mathbb{C}^2$ to the problem of the boundary $\bar{\partial}_b$-equation. We…
In this paper, we propose a generalized alternating direction method of multipliers (ADMM) with semi-proximal terms for solving a class of convex composite conic optimization problems, of which some are high-dimensional, to moderate…
In this paper, we accomplish a unified convergence analysis of a second-order method of multipliers (i.e., a second-order augmented Lagrangian method) for solving the conventional nonlinear conic optimization problems.Specifically, the…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
Least squares estimators, when trained on a few target domain samples, may predict poorly. Supervised domain adaptation aims to improve the predictive accuracy by exploiting additional labeled training samples from a source distribution…
We prove two separate lower bounds -- one for nondegenerate convex domains and the other for nondegenerate $\mathbb{C}$-convex (but not necessarily convex) domains -- for the squeezing function that hold true for all domains in…
Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of…
We treat the boundary problem for complex varieties (with isolated singularities) of dimension greater than one, which are contained in a suitable class of strictly pseudoconvex, unbounded domains of C^n.
We prove a subelliptic estimate for systems of complex vector fields under some assumptions that generalize the essential pseudoconcavity for $CR$ manifolds and H\"ormander's bracket condition for real vector fields. Applications are given…
We introduce and study various algorithms for solving nonconvex minimization with inequality constraints, based on the construction of convex surrogate envelopes that majorize the objective and the constraints. In the case where the…