Related papers: Algorithms for subelliptic multipliers in $\mathbb…
We prove several results on homogeneous plurisubharmonic polynomials on $\mathbb{C}^n$, $n\in\mathbb{Z}_{\geq 2}$. Said results are relevant to the problem of constructing local bumpings at boundary points of pseudoconvex domains of finite…
We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…
We wish to study the problem of bumping outwards a pseudoconvex, finite-type domain \Omega\subset C^n in such a way that pseudoconvexity is preserved and such that the lowest possible orders of contact of the bumped domain with bdy(\Omega),…
In this paper second-order elliptic and parabolic partial differential systems are considered on $C^1$ domains. Existence and uniqueness results are obtained in terms of Sobolev spaces with weights so that we allow the derivatives of the…
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…
We construct bounded pseudoconvex domains in $\mathbb{C}^2$ for which the Szeg\"o projection operators are unbounded on $L^p$ spaces of the boundary for all $p\not =2$.
Inspired by a recent result of Funano's, we provide a sharp quantitative comparison result between the first nontrivial eigenvalues of the Neumann Laplacian on bounded convex domains $\Omega_{1} \subset \Omega_{2}$ in any dimension $d$…
In the paper the complex geodesics of a convex domain in $\mathbb C^n$ are studied. One of the main results of the paper provides certain necessary condition for a holomorphic map to be a complex geodesic for a convex domain in $\mathbb…
In this paper, we propose two algorithms for solving convex optimization problems with linear ascending constraints. When the objective function is separable, we propose a dual method which terminates in a finite number of iterations. In…
We derive a new homotopy formula for a strictly pseudoconvex domain of $C^2$ boundary in ${\mathbf C}^n$ by using a method of Lieb and Range and obtain estimates in Lipschitz spaces for the homotopy operators. For $r>1$ and $q>0$, we obtain…
In the paper we study the geometry of semitube domains in $\mathbb C^2$. In particular, we extend the result of Burgu\'es and Dwilewicz for semitube domains dropping out the smoothness assumption. We also prove various properties of…
In this paper we consider the following question: For bounded domains with smooth boundary, can strong pseudoconvexity be characterized in terms of the intrinsic complex geometry of the domain? Our approach to answering this question is…
We prove regularity of solutions of the $\bar\partial$-problem in the H\"older-Zygmund spaces of bounded, strongly $\mathbf C$-linearly convex domains of class $C^{1,1}$. The proofs rely on a new, analytic characterization of said domains…
In this paper, we calculate estimates for invariant metrics on a finite type convex domain in $\mathbb C^n$ using the Sibony metric. We also discuss a possible modification of the Sibony metric.
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
In recent years, various subspace algorithms have been developed to handle large-scale optimization problems. Although existing subspace Newton methods require fewer iterations to converge in practice, the matrix operations and full…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
There exist several interesting results in the literature on subnormal operator tuples having their spectral properties tied to the geometry of strictly pseudoconvex domains or to that of bounded symmetric domains in $\C^n$. We introduce a…
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…
In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…