相关论文: Equilibrium search algorithm of a perturbed quasi-…
In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to…
We analyze the possibility of modifying the original Farhi-Gutmann Hamiltonian algorithm in order to speed up the procedure for producing a suitably distributed unknown normalized quantum mechanical state. Such a modification is feasible…
In this short exposition, we describe equilibria and periodic orbits in terms of the flow map, {\Phi}, and discuss the essentials of the Jacobian-free Newton-Krylov (JFNK) method that can be used to find them. This method requires little…
This work studies minimization problems with zero-order noisy oracle information under the assumption that the objective function is highly smooth and possibly satisfies additional properties. We consider two kinds of zero-order projected…
In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introduced method as a framework that enables performance…
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…
A number of optimization algorithms have been inspired by the physics of Newtonian motion. Here, we ask the question: do algorithms themselves obey some ``natural laws of motion,'' and can they be derived by an application of these laws? We…
We study the partially asymmetric exclusion process with open boundaries. We generalise the matrix approach previously used to solve the special case of total asymmetry and derive exact expressions for the partition sum and currents valid…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…
We provide sufficient criteria for the oscillation of all solutions of neutral delay differential equations of the form \[ \left[x(t) - \sum_{i=1}^{N_r}R_i(t)x(t - r_i(t)) \right]' + \sum_{i=1}^{N_p}P_i(t)x(t - \tau_i(t)) -…
We apply topological methods to obtain global continuation results for harmonic solutions of some periodically perturbed ordinary differential equations on a $k$-dimensional differentiable manifold $M \subseteq \mathbb{R}^m$. We assume that…
This paper concerns a first-order algorithmic technique for a class of optimal control problems defined on switched-mode hybrid systems. The salient feature of the algorithm is that it avoids the computation of Fr\'echet or G\^ateaux…
A computer-assisted argument is given, which provides existence proofs for periodic orbits in state-dependent delayed perturbations of ordinary differential equations (ODEs). Assuming that the unperturbed ODE has an isolated periodic orbit,…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
We develop procedures, based on minimization of the composition $f(x) = h(c(x))$ of a convex function $h$ and smooth function $c$, for solving random collections of quadratic equalities, applying our methodology to phase retrieval problems.…
We introduce a type of safe extremum seeking (ES) controller, which minimizes an unknown objective function while also maintaining practical positivity of an unknown barrier function. We show semi-global practical asymptotic stability of…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce…
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…
We present a new method for computing orbits in the perturbed two-body problem: the position and velocity vectors of the propagated object in Cartesian coordinates are replaced by eight orbital elements, i.e., constants of the unperturbed…