相关论文: Effective Termination of Kohn's Algorithm for Sube…
We give examples of pseudoconvex domains of finite type in $\mathbb{C}^2$ where the Kohn algorithm for subelliptic estimates fails to yield an effective lower bound for the order of subellipticity in terms of the type. We show how to modify…
We provide a solution to the effectiveness problem in Kohn's algorithm for generating holomorphic subelliptic multipliers for $(0,q)$ forms for arbitrary $q$. As an application, we obtain subelliptic estimates for $(0,q)$ forms with…
Kohn introduced in 1979 the algorithm of multipliers to study the subelliptc estimate of the $\bar\partial$-Neumann problem for a smooth weakly pseudoconvex domain in a complex Euclidean space which satisfies D'Angelo's finite type…
In this article, we follow the arguments in a paper of Y-T. Siu to study the effective termination of Kohn's algorithm for special domains in $\mathbb{C}^{3}$. We make explicit the effective constants and generic conditions that appear…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
In 1979 J.J. Kohn gave an indirect argument via the Diederich-Forn\ae ss Theorem showing that finite D'Angelo type implies termination of the Kohn algorithm for a pseudoconvex domain with real-analytic boundary. We give here a direct…
We prove local hypoellipticity of the complex Laplacian $\Box$ and of the Kohn Laplacian $\Box_b$ in a pseudoconvex boundary when, for a system of cut-off $\eta$, the gradient $\partial_b\eta$ and the Levi form…
We propose a new class of geometric invariants called jet vanishing orders, and use them to establish a new selection algorithm in the Kohn's construction of subelliptic multipliers for special domains in dimension $3$, inspired by the work…
We show that a smooth bounded domain in $\mathbb{C}^n$ admitting partial pseudoconvex exhaustion remains partial pseudoconvex. The main ingredient of the proof is based on a new characterization of hyper-$q$-convex domains. Furthermore, we…
We consider a smooth boundary b\Omega which is q-convex in the sense that its Levi-form has positive trace on every complex q-plane. We prove that b\Omega is tangent of infinite order to the complexification of each of its submanifolds…
The purpose of this note is threefold. (i) To explain the effective Kohn algorithm for multipliers in the complex Neumann problem and its difference with the full-real-radical Kohn algorithm, especially in the context of an example of…
We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…
This paper presents monotonicity of subelliptic estimates on rigid pseudoconvex domains. As an application of monotonicity, we will show that if a rigid monomial domain is of finite type in the D'Angelo's sense, then the sharp subelliptic…
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…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
In the smooth case, we prove quasi-flasqueness for the sheaves of all subelliptic multipliers as well as at each of the steps of the Kohn algorithm on a pseudoconvex domain in $\C^n.$ We use techniques by Jean-Claude Tougeron to show that…
In this paper, a decentralized proximal method of multipliers (DPMM) is proposed to solve constrained convex optimization problems over multi-agent networks, where the local objective of each agent is a general closed convex function, and…
We give an explicit verifiable characterization of weakly pseudoconvex but locally nonconvexifiable hypersurfaces of finite type in dimension two. It is expressed in terms of a generalized model, which captures local geometry of the…
In this paper, by modifying significantly the Friedrichs-Gross mollifier technique and/or using the Lasry-Lions regularization technique together with some carefully chosen cut-off functions, for the first time we construct explicitly…
We propose an early termination technique for mixed integer conic programming for use within branch-and-bound based solvers. Our approach generalizes previous early termination results for ADMM-based solvers to a broader class of…