Related papers: An Alternative to Vinberg's Algorithm
In this thesis, I explore the possibilities of conducting Bayesian optimization techniques in high dimensional domains. Although high dimensional domains can be defined to be between hundreds and thousands of dimensions, we will primarily…
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
In this paper, we consider diagonal hyperbolic systems with monotone continuous initial data. We propose a natural semi-explicit and upwind first order scheme. Under a certain non-negativity condition on the Jacobian matrix of the…
We present a new perspective on the celebrated Sinkhorn algorithm by showing that is a special case of incremental/stochastic mirror descent. In order to see this, one should simply plug Kullback-Leibler divergence in both mirror map and…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
In this paper we study a new approach in optimization that aims to search a large domain D where a given function takes large, small or specific values via an iterative optimization algorithm based on the gradient. We show that the…
One of the challenging problems in the condensed matter physics is to understand the quantum many-body systems, especially, their physical mechanisms behind. Since there are only a few complete analytical solutions of these systems, several…
The aim of this note is to show that weak relative hyperbolicity of a group relative to a subgroup (or relative hyperbolicity in the sense of Farb) does not imply any natural analogues of some well-known algebraic properties of ordinary…
Link prediction, a foundational task in complex network analysis, has extensive applications in critical scenarios such as social recommendation, drug target discovery, and knowledge graph completion. However, existing evaluations of…
We derive and prove the `fast response' formula for the linear response, the parameter derivatives of long-time-averaged statistics, of hyperbolic deterministic chaotic systems. The expression is pointwisely defined so we can compute the…
The solvability in Sobolev spaces is proved for divergence form complex-valued higher order parabolic systems in the whole space, on a half space, and on a Reifenberg flat domain. The leading coefficients are assumed to be merely measurable…
We describe a method, using periodic points and determinants, for giving alternative expressions for dynamical quantities (including Lyapunov exponents and Hausdorff dimension of invariant sets) associated to analytic hyperbolic systems.…
Using the framework of a previous article joint with Axelsson and McIntosh, we extend to systems two results of S. Hofmann for real symmetric equations and their perturbations going back to a work of B. Dahlberg for Laplace's equation on…
We implement an algorithm which is aimed to reduce the dimensions of the Hilbert space of quantum many-body systems by means of a renormalization procedure. We test the role and importance of different representations on the reduction…
In this paper, we develop a novel approach to the Weingarten calculus by employing the notion of virtual isometries. Traditionally, Weingarten calculus provides explicit formulas for integrating polynomial functions over compact matrix…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
In this paper, we derive a Fast Reflected Forward-Backward (Fast RFB) algorithm to solve the problem of finding a zero of the sum of a maximally monotone operator and a monotone and Lipschitz continuous operator in a real Hilbert space. Our…
We consider the following classification problem: Given a population of individuals characterized by a set of attributes represented as a vector in ${\mathbb R}^N$, the goal is to find a hyperplane in ${\mathbb R}^N$ that separates two sets…
The phase retrieval problem is a fundamental problem in many fields, which is appealing for investigation. It is to recover the signal vector $\tilde{x}\in\mathbb{C}^d$ from a set of $N$ measurements $b_n=|f^*_n\tilde{x}|^2,\ n=1,\cdots,…
Imaging systems are inherently prone to aberrations. We present an optimization method to design two-dimensional freeform reflectors that minimize aberrations for various parallel ray beams incident on the optical system. We iteratively…