相关论文: Tight Low Degree Hardness for Optimizing Pure Sphe…

We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…

We present a simple geometric approach to studying the $L^p$ boundedness properties of Stein's spherical maximal operator, which does not rely on the Fourier transform. Using this, we recover a weak form of Stein's spherical maximal…

An adaptive regularization algorithm for unconstrained nonconvex optimization is presented in which the objective function is never evaluated, but only derivatives are used. This algorithm belongs to the class of adaptive regularization…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

The recently proposed Hysteretic Optimization (HO) procedure is applied to the 1D Ising spin chain with long range interactions. To study its effectiveness, the quality of ground state energies found as a function of the distance dependence…

We prove non asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithm in the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of…

Consider a logharmonic polynomial; that is, a product of the form $p(z)\overline{q(z)}$, where $p$, $q$ are holomorphic polynomials. Assume $q$ is linear and denote by $n$ the degree of $p$. It was recently shown in arXiv:2302.04339…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

Spin-glass systems are universal models for representing many-body phenomena in statistical physics and computer science. High quality solutions of NP-hard combinatorial optimization problems can be encoded into low energy states of…

For functions $f$ in Dirichlet-type spaces we study how to determine constructively optimal polynomials $p_n$ that minimize $\|p f-1\|_\alpha$ among all polynomials $p$ of degree at most $n$. Then we give upper and lower bounds for the rate…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

In this note, we consider the complexity of optimizing a highly smooth (Lipschitz $k$-th order derivative) and strongly convex function, via calls to a $k$-th order oracle which returns the value and first $k$ derivatives of the function at…

We study the large $N$-dimensional limit of the Hessian spectrum at the global minimum of some subclasses of the spherical mixed $p$-spin models. Specifically, we show that its empirical spectral measure converges in probability to a…

We prove sharp upper bounds for sums of eigenvalues (and other spectral functionals) of Laplace-like operators, including bi-Laplacian and fractional Laplacian. We show that among linear images of a highly symmetric domain, our spectral…

Polyak-{\L}ojasiewicz (PL) [Polyak, 1963] condition is a weaker condition than the strong convexity but suffices to ensure a global convergence for the Gradient Descent algorithm. In this paper, we study the lower bound of algorithms using…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

Let $\alpha>0$, $H=(-\triangle)^{\alpha}+V(x)$, $V(x)$ belongs to the higher order Kato class $K_{2\alpha}(\mathbbm{R}^n)$. For $1\leq p\leq \infty$, we prove a polynomial upper bound of $\|e^{-itH}(H+M)^{-\beta}\|_{L^p, L^p}$ in terms of…

Penalty methods are a well known class of algorithms for constrained optimization. They transform a constrained problem into a sequence of unconstrained \emph{penalized} problems in the hope that approximate solutions of the latter converge…

Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…