Related papers: Algorithms for subelliptic multipliers in $\mathbb…
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…
We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…
We consider differentially private approximate singular vector computation. Known worst-case lower bounds show that the error of any differentially private algorithm must scale polynomially with the dimension of the singular vector. We are…
We consider a simply supported plate with constant thickness, defined on an unknown multiply connected domain. We optimize its shape according to some given performance functional. Our method is of fixed domain type, easy to be implemented,…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
We construct a bounded domain $\Omega$ in $\mathbb{C}^2$ with boundary of class $\mathcal{C}^{1,1}$, such that $\overline{\Omega}$ has a Stein neighborhood basis, but is not $s$-H-convex for any real number $s\geq{1}$.
We study a weak formulation of Serrin's overdetermined boundary value problem in planar Jordan domains with rectifiable boundary. Our first result establishes that, within the class of rectifiable Jordan Smirnov domains, the corresponding…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
This paper is devoted to the study of second order optimality conditions for strong local minimizers in the frameworks of unconstrained and constrained optimization problems in finite dimensions via subgradient graphical derivative. We…
This paper deals with some geometrical properties of solutions of some semilinear elliptic equations in bounded convex domains or convex rings. Constant boundary conditions are imposed on the single component of the boundary when the domain…
We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…
It is an observation due to J.J. Kohn that for a smooth bounded pseudoconvex domain D in $C^n$ there exists s>0 such that the dbar-Neumann operator on D maps $W^s_{(0,1)}(D)$ (the space of $(0,1)$-forms with coefficient functions in…
In recent work by Zimmer it was proved that if $\Omega\subset\mathbb C^n$ is a bounded convex domain with $C^\infty$-smooth boundary, then $\Omega$ is strictly pseudoconvex provided that the squeezing function approaches one as one…
We show some lower estimates for the Kobayashi-Royden metric on a class of smooth bounded pseudoconvex domains.
This paper introduces a nonconforming virtual element method for general second-order elliptic problems with variable coefficients on domains with curved boundaries and curved internal interfaces. We prove arbitrary order optimal…
We introduce the notion of extremal basis of tangent vector fields at a boundary point of finite type of a pseudo-convex domain in $\mathbb{C}^n$. Then we define the class of geometrically separated domains at a boundary point, and give a…
In this paper, we present new second-order algorithms for composite convex optimization, called Contracting-domain Newton methods. These algorithms are affine-invariant and based on global second-order lower approximation for the smooth…
We investigate the convexity up to symplectomorphism (called symplectic convexity) of star-shaped toric domains in $\mathbb R^4$. In particular, based on the criterion from Chaidez-Edtmair via Ruelle invariant and systolic ratio of the…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…