Related papers: Optimization Of Quasi-convex Function Over Product…
By using the fact that the space of all probability measures with finite support can be somehow completed in two different fashions, one generating the Arens-Eells space and another generating the Kantorovich-Wasserstein (Wasserstein-1)…
This paper is concerned with minimizing a sum of rational functions over a compact set of high-dimension. Our approach relies on the second Lasserre's hierarchy (also known as the upper bounds hierarchy) formulated on the pushforward…
Tensor decompositions have become essential tools for feature extraction and compression of multiway data. Recent advances in tensor operators have enabled desirable properties of standard matrix algebra to be retained for multilinear…
In this paper, we investigate the statistical convergence rate of a Bayesian low-rank tensor estimator. Our problem setting is the regression problem where a tensor structure underlying the data is estimated. This problem setting occurs in…
The maximum principle is one of the most important tools in the analysis of geometric partial differential equations. Traditionally, the maximum principle is applied to a scalar function defined on a manifold, but in recent years more…
We prove the convergence of the proximal point algorithm for finding the unique minimizer of a strongly quasiconvex function in general nonlinear Hadamard spaces, generalizing a recent result due to F. Lara. Our argument is rather…
Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…
In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…
In this paper, we establish explicit quantitative Berry-Esseen bounds in the hyper-rectangle distance $d_R$, the convex distance $d_{\mathscr{C}}$ and the $1$-Wasserstein distance $d_W$ for high-dimensional, non-linear functionals of…
Quasar-convex functions form a broad nonconvex class with applications to linear dynamical systems, generalized linear models, and Riemannian optimization, among others. Current nearly optimal algorithms work only in affine spaces due to…
Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors $v_1,\ldots,v_m \in \mathbb{R}^d$ and a constraint family ${\cal B}\subseteq 2^{[m]}$, find a set $S \in \cal{B}$ that…
Developing equivariant neural networks for the E(3) group plays an important role in modeling 3D data across real-world applications. Enforcing this equivariance primarily involves the tensor products of irreducible representations…
In this paper, we derive a new form of maximum principle for smooth functions on a complete noncompact Riemannian manifold $M$ for which there exists a bounded vector field $X$ such that $\langle\nabla f,X\rangle\geq 0$ on $M$ and…
This article is devoted to investigate a nonsmooth/nonconvex uncertain multiobjective optimization problem with composition fields (CUP) for brevity) over arbitrary Asplund spaces. Employing some advanced techniques of variational analysis…
In the setting of nonparametric multivariate regression with unknown error variance, we study asymptotic properties of a Bayesian method for estimating a regression function f and its mixed partial derivatives. We use a random series of…
We investigate a data-driven quasiconcave maximization problem where information about the objective function is limited to a finite sample of data points. We begin by defining an ambiguity set for admissible objective functions based on…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…