Related papers: Backward Rauzy-Veech algorithm and horizontal sadd…
In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we assume that each node has access to a summand of a global…
An analytic reversible Hamiltonian system with two degrees of freedom is studied in a neighborhood of its symmetric heteroclinic connection made up of a symmetric saddle-center, a symmetric orientable saddle periodic orbit lying in the same…
The success of deep neural networks hinges on our ability to accurately and efficiently optimize high-dimensional, non-convex functions. In this paper, we empirically investigate the loss functions of state-of-the-art networks, and how…
We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\min_x\max_y f(x) + \langle y,\mathbf{B} x\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine…
In this paper, we extend the inexact Uzawa algorithm in [Q. Hu, J. Zou, SIAM J. Matrix Anal., 23(2001), pp. 317-338] to the nonsymmetric generalized saddle point problem. The techniques used here are similar to those in [Bramble \emph{et…
We compute the gap distribution of directions of saddle connections for two classes of translation surfaces. One class will be the translation surfaces arising from gluing two identical tori along a slit. These yield the first explicit…
Translation surfaces can be defined in an elementary way via polygons, and arise naturally in in the study of various basic dynamical systems. They can also be defined as Abelian differentials on Riemann surfaces, and have moduli spaces…
In this paper the authors find examples of translation surfaces that have infinitely generated Veech groups, satisfy the topological dichotomy property that for every direction either the flow in that direction is completely periodic or…
We propose a derivative-free saddle-search algorithm designed to locate transition states using only function evaluations. The algorithm employs a nested architecture consisting of an inner eigenvector search and an outer saddle-point…
To every half-translation surface, we associate a saddle connection graph, which is a subgraph of the arc graph. We prove that every isomorphism between two saddle connection graphs is induced by an affine homeomorphism between the…
In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback…
In this work, we analyze the global convergence property of coordinate gradient descent with random choice of coordinates and stepsizes for non-convex optimization problems. Under generic assumptions, we prove that the algorithm iterate…
We provide a comprehensive study of the convergence of the forward-backward algorithm under suitable geometric conditions, such as conditioning or {\L}ojasiewicz properties. These geometrical notions are usually local by nature, and may…
We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the…
This is a continuation of our previous work entitled \enquote{Alternating Proximity Mapping Method for Convex-Concave Saddle-Point Problems}, in which we proposed the alternating proximal mapping method and showed convergence results on the…
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order convergent if and only if a certain maximal inequality is…
We search saddle points for a large class of convex-concave Lagrangian. A generalized explicit iterative scheme based on Arrow-Hurwicz method converges to a saddle point of the problem. We also propose in this work, a convergent…
This paper presents an algorithm for solving the problem of tracking smooth curves by a fixed wing unmanned aerial vehicle travelling with a constant airspeed and under a constant wind disturbance. The algorithm is based on the idea of…
We prove an effective version of a celebrated result of Eskin and Masur: for any affine invariant manifold of translation surfaces, almost every translation surface has quadratic growth for the saddle connection holonomy vectors, with an…
We present a field-of-values (FOV) analysis for preconditioned nonsymmetric saddle-point linear systems, where zero is included in the field of values of the matrix. We rely on recent results of Crouzeix and Greenbaum [Spectral sets:…