نتایج جستجو برای: beale version with normalized search direction
تعداد نتایج: 9393731 فیلتر نتایج به سال:
Simultaneous estimation of range and angle of close emitters usually requires a multidimensional search. This paper offers an algorithm to improve the position of an element of any array designed on the basis of some certain or random rules. In the proposed method one element moves on its original direction, i.e., keeping the vertical distance to each source, to reach the constellation with les...
Users can explore the world by viewing place related photos on Google Maps. One possible way is to take the nearby photos for viewing. However, for a given geo-location, many photos with view directions not pointing to the desired regions are returned by that world map. To address this problem, prior know the poses in terms of position and view direction of photos is a feasible solution. We can...
We propose a new technique for minimization of convex functions not necessarily smooth. Our approach employs an equivalent constrained optimization problem and approximated linear programs obtained with cutting planes. At each iteration a search direction and a step length are computed. If the step length is considered “non serious”, a cutting plane is added and a new search direction is comput...
In this paper, an approach is proposed for accurate locating of single phase faults in transmission lines using voltage signals measured at one-end. In this method, harmonic components of the voltage signals are extracted through Discrete Fourier Transform (DFT) and are normalized by a transformation. The proposed fault locator, which is designed based on Random Forests (RF) algorithm, is train...
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
In this paper, we prove the local well-posedness of free boundary problem for incompressible Euler equations in low regularity Sobolev spaces, which velocity is a Lipschtiz function and surface belongs to $C^{\f32+\varepsilon}$. Moreover, also present Beale-Kato-Majda type break-down criterion smooth solution terms mean curvature surface, gradient Taylor sign condition.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید