Related papers: Triangles with one fixed side-length, a Furstenber…
Let $p$ be an odd prime and let $E\subset \mathbb{F}_p^2$ with $|E|=p^a$, where $0<a\le 1$. For a direction $V$ (a $1$-dimensional subspace of $\mathbb{F}_p^2$), let $\pi^V:\mathbb{F}_p^2\to \mathbb{F}_p^2/V$ denote the quotient map. We…
Since the 1960's the finite element method emerged as a powerful tool for the numerical simulation of countless physical phenomena or processes in applied sciences. One of the reasons for this undeniable success is the great versatility of…
Stochastic gradient (SG) methods are fundamental to system identification and machine learning, enabling online parameter estimation in large-scale and streaming-data settings. As a classical identification method, the SG algorithm has been…
It is well known that to determine a triangle up to congruence requires three measurements: three sides, two sides and the included angle, or one side and two angles. We consider various generalizations of this fact to two and three…
Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…
From Euclid's fundamental formula for the Pythagorean triples we define the rational triples relating certain congruent numbers by an identity and explore their relationships. We introduce two geometric methods relating the congruent number…
The purpose of this note is to provide a summary of the recent work of the authors on two variations of the pointwise convergence problem for the solutions to the fractional Schr\"odinger equations; convergence along a tangential line and…
In the setting of fractional minimal surfaces, we prove that if two nonlocal minimal sets are one included in the other and share a common boundary point, then they must necessarily coincide. This strict maximum principle is not obvious,…
Symmetric polynomial quadrature rules for triangles are commonly used to efficiently integrate two-dimensional domains in finite-element-type problems. While the development of such rules focuses on the maximum degree a given number of…
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
Gradient-related first-order methods have become the workhorse of large-scale numerical optimization problems. Many of these problems involve nonconvex objective functions with multiple saddle points, which necessitates an understanding of…
Upper bound limit analysis allows one to evaluate directly the ultimate load of structures without performing a cumbersome incremental analysis. In order to numerically apply this method to thin plates in bending, several authors have…
The paper proposes a novel hybrid method for solving equilibrium problems and fixed point problems. By constructing specially cutting-halfspaces, in this algorithm, only an optimization program is solved at each iteration without the…
It is known that the curvature of the feasible set in convex optimization allows for algorithms with better convergence rates, and there has been renewed interest in this topic both for offline as well as online problems. In this paper,…
In semidefinite programming a proposed optimal solution may be quite poor in spite of having sufficiently small residual in the optimality conditions. This issue may be framed in terms of the discrepancy between forward error (the…
We propose a remarkably general variance-reduced method suitable for solving regularized empirical risk minimization problems with either a large number of training examples, or a large model dimension, or both. In special cases, our method…
Let $0 \leq s \leq 1$. A set $K \subset \mathbb{R}^{2}$ is a Furstenberg $s$-set, if for every unit vector $e \in S^{1}$, some line $L_{e}$ parallel to $e$ satisfies $$\dim_{\mathrm{H}} [K \cap L_{e}] \geq s.$$ The Furstenberg set problem,…
In this paper, we study the lower iteration complexity bounds for finding the saddle point of a strongly convex and strongly concave saddle point problem: $\min_x\max_yF(x,y)$. We restrict the classes of algorithms in our investigation to…
Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection lemma type results typically…
The fixed-circle problem is a recent problem about the study of geometric properties of the fixed point set of a self-mapping on metric (resp. generalized metric) spaces. The fixed-disc problem occurs as a natural consequence of this…