Related papers: Algorithms for subelliptic multipliers in $\mathbb…
It is shown that a lower bound of the Kobayashi metric of convex domains in C^n does not hold for non-convex domains.
In this paper after extending the definition of symplectic duality (given by the first two authors in arXiv:math/0603141 for bounded symmetric domains) to arbitrary complex domains of ${\C}^n$ centered at the origin we generalize some of…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
We prove here the Wolff-Denjoy-type theorem for a very large class of pseudoconvex domains in $\mathbb C^n$ that may contain many classes of pseudoconvex domains of finite type and infinite type.
We investigate a globalized inexact semismooth Newton method applied to strongly convex optimization problems in Hilbert spaces. Here, the semismooth Newton method is appplied to the dual problem, which has a continuously differentiable…
We prove a homotopy formula which yields almost sharp estimates in all (positive-indexed) Sobolev and H\"older-Zygmund spaces for the $\overline \partial$ equation on pseudoconvex domains of finite type in $\mathbb C^2$, extending the…
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…
This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…
In this article, we introduce special domains and discuss the geometry of these domains, which includes showing that every pseudoconvex truncated tube domain is a special domain. Next, we prove a theorem for the envelope of special domains…
This paper presents sharp estimates for the second-order Toeplitz determinant whose entries are the coefficients of convex functions defined on the unit disk in $\mathbb{C}$. These estimates are further extended to a subclass of holomorphic…
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,…
This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…
A new algorithm for one-dimensional minimization is described in detail and the results of some tests on practical cases are reported and illustrated. The method requires only punctual computation of the function, and is suitable to be…
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The…
We study some special almost complex structures on strictly pseudoconvex domains. They appear naturally as limits under a nonisotroping scaling procedure and play a role of model objects in the geometry of almost complex manifolds with…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…