相关论文: Equilibrium search algorithm of a perturbed quasi-…
In this paper an approach is outlined. With this approach some explicit algorithms can be applied to solve the initial value problem of $n-$dimensional damped oscillators. This approach is based upon following structure: for any…
In this paper, we consider the equilibrium problems and also their regularized problems under the setting of Hadamard spaces. The solution to the regularized problem is represented in terms of resolvent operators. As an essential machinery…
The problem of the initial conditions for the oscillator model of quantum dissipative systems is studied. It is argued that, even in the classical case, the hypothesis that the environment is in thermal equilibrium implies a statistical…
The paper deals with the extremum seeking problem for a class of cost functions depending only on a part of state variables of a control system. This problem is related to the concept of partial asymptotic stability and analyzed by…
A Hamiltonian algorithm, both theoretical and numerical, to obtain the reduced equations implementing Pontryagine's Maximum Principle for singular linear-quadratic optimal control problems is presented. This algorithm is inspired on the…
In this paper, we present a novel Newton-based extremum seeking controller for the solution of multivariable model-free optimization problems in static maps. Unlike existing asymptotic and fixed-time results in the literature, we present a…
Grover's database search algorithm is the optimal algorithm for finding a desired object from an unsorted collection of items. Although it was discovered in the context of quantum computation, it is simple and versatile enough to be…
This paper explores the problem of analytically approximating the orbital state for a subset of orbits in a rotating potential with oblateness and ellipticity perturbations. This is done by isolating approximate differential equations for…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. The Grover algorithm exploits the concept of an oracle…
We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the…
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
The paper deals with a well-known extremum seeking scheme by proving uniformity properties with respect to the amplitudes of the dither signal and of the cost function. Those properties are then used to show that the scheme guarantees the…
Stability results for extremum seeking control in $\mathbb{R}^n$ have predominantly been restricted to local or, at best, semi-global practical stability. Extending semi-global stability results of extremum-seeking systems to unbounded sets…
Frozen orbits are always important foci of orbit design because of their valuable characteristics that their eccentricity and argument of pericentre remain constant on average. This study investigates quasi-circular frozen orbits and…
We introduce a new approach to deriving approximate analytical solutions of a harmonic oscillator damped by purely nonlinear, or combinations of linear and nonlinear damping forces. Our approach is based on choosing a suitable trial…
We propose an efficient algorithm for finding first-order Nash equilibria in min-max problems of the form $\min_{x \in X}\max_{y\in Y} F(x,y)$, where the objective function is smooth in both variables and concave with respect to $y$; the…
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the…