Related papers: Effective Termination of Kohn's Algorithm for Sube…
The classical Dirichlet problem for a second-order strongly elliptic system with constant coefficients in a Jordan domain is considered. We show that the solution of the problem can be represented as a functional series in powers of the…
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial differential equations with highly varying coefficients. The method is based on a discontinuous Galerkin formulation. We present both a…
This paper investigates solving convex composite optimization on an undirected network, where each node, privately endowed with a smooth component function and a nonsmooth one, is required to minimize the sum of all the component functions…
We give a description (direct formulas) of all complex geodesics in a convex tube domain in $\CC^n$ containing no complex affine lines, expressed in terms of geometric properties of the domain. We next apply that result to give formulas (a…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
We investigate the $p$-essential normality of Hilbert quotient submodules on a relatively compact smooth strongly pseudoconvex domain in a complex manifold satisfying Property (S). For analytic subvarieties that have compact singularities…
Submodularity is one of the most well-studied properties of problem classes in combinatorial optimization and many applications of machine learning and data mining, with strong implications for guaranteed optimization. In this thesis, we…
We develop a robust solver for a mixed finite element convex splitting scheme for the Cahn-Hilliard equation. The key ingredient of the solver is a preconditioned minimal residual algorithm (with a multigrid preconditioner) whose…
We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…
For a Jordan domain with sufficiently smooth boundaries, the solution to the Dirichlet problem for second order skew-symmetric strongly elliptic system with constant coefficients and regular enough boundary data is constructed in the form…
We solve the $\partial\bar{\partial}$-problem for extensible currents defined on a strongly pseudoconvex domain of a contractible manifold.
We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly efficient to solve a…
We establish a general, weighted Kohn-H\"ormander-Morrey formula twisted by a pseudodifferential operator. As an application, we exhibit a new class of domains for which the $\bar\partial$-Neumann problem is locally hypoelliptic.
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 show that the subadditive dual of a feasible conic mixed-integer program (MIP) is a strong dual whenever it is feasible. Moreover, we show that this dual feasibility condition is equivalent to feasibility of the conic dual…
In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…
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…
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…
We establish the existence of weak solutions of coupled systems of elliptic partial differential equations with quasimonotone nonlinearities in the domain interior and on the boundary. When the nonlinearities satisfy some monotonicity…