Related papers: Non-polyhedral extensions of the Frank-and-Wolfe t…
In 1936, Margarete C. Wolf showed that the ring of symmetric free polynomials in two or more variables is isomorphic to the ring of free polynomials in infinitely many variables. We show that Wolf's theorem is a special case of a general…
We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by low-degree…
We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…
Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with these developments is analogous results for convergence of…
This paper introduces and investigates a regularity condition in the asymptotic sense for optimization problems whose objective functions are polynomial. Under this regularity condition, the normalization argument in asymptotic analysis…
The complexity of Philip Wolfe's method for the minimum Euclidean-norm point problem over a convex polytope has remained unknown since he proposed the method in 1974. The method is important because it is used as a subroutine for one of the…
We formulate a criterion for the existence of an invariant measure for a Feller semigroup defined on a metric space with the e-property for bounded continuous functions and use it to prove the asymptotic stability of a semigroup satisfying…
The classical Julia-Wolff-Caratheodory theorem gives a condition ensuring the existence of the non-tangential limit of both a bounded holomorphic function and its derivative at a given boundary point of the unit disk in the complex plane.…
Frank-Wolfe methods are popular for optimization over a polytope. One of the reasons is because they do not need projection onto the polytope but only linear optimization over it. To understand its complexity, Lacoste-Julien and Jaggi…
We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…
We consider the Frank-Wolfe algorithm for solving variational inequalities over compact, convex sets under a monotone $C^1$ operator and vanishing, nonsummable step sizes. We introduce a continuous-time interpolation of the discrete…
Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…
In this paper, we establish the existence of the efficient solutions for polynomial vector optimization problems on a nonempty closed constraint set without any convexity and compactness assumptions. We first introduce the relative…
The Frank-Wolfe algorithm has seen a resurgence in popularity due to its ability to efficiently solve constrained optimization problems in machine learning and high-dimensional statistics. As such, there is much interest in establishing…
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This…
We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…
Due to Narkiewicz a field $F$ has property (P) if for no polynomial $f\in F[x]$ of degree at least two there is an infinite $f$-invariant subset of $F$. We present a new example of an algebraic extension of $\mathbb{Q}$ satisfying (P). This…
The Frank-Wolfe algorithm achieves a convergence rate of $\mathcal{O}(1/T)$ for smooth convex optimization over compact convex domains, accelerating to $\mathcal{O}(1/T^2)$ when both the objective and the feasible set are strongly convex.…
The ergodic theory and geometry of the Julia set of meromorphic functions on the complex plane with polynomial Schwarzian derivative is investigated under the condition that the forward trajectory of asymptotic values in the Julia set is…