نتایج جستجو برای: inexact search directions
تعداد نتایج: 387345 فیلتر نتایج به سال:
Keeping track of scientific challenges, advances and emerging directions is a fundamental part research. However, researchers face flood papers that hinders discovery important knowledge. In biomedicine, this directly impacts human lives. To address problem, we present novel task extraction search challenges directions, to facilitate rapid knowledge discovery. We construct release an expert-ann...
In this paper, we study the global convergence of a large class of primal--dual interior point algorithms for solving the linearly constrained convex programming problem. The algorithms in this class decrease the value of a primal--dual potential function and hence belong to the class of so-called potential reduction algorithms. An inexact line search based on Armijo stepsize rule is used to co...
Convergence results are provided for inexact two-sided inverse and Rayleigh quotient iteration, which extend the previously established results to the generalized eigenproblem, and inexact solves with a decreasing solve tolerance. Moreover, the simultaneous solution of the forward and adjoint problem arising in two-sided methods is considered and the successful tuning strategy for preconditione...
Uncertainty in spatial analysis and planning has conventionally been treated as a consequence of random occurrence of exact spatial events. The present paper, however, argues that fuzziness is actually a major contributory factor to most of the uncertain spatial behavior. Exactitude in representing, analyzing, and predicting human behaviors over space and time is difficult if not impossible to ...
This review provides a survey of techniques for pattern matching in compressed text and images. Normally compressed data needs to be decompressed before it is processed, but if the compression has been done in the right way, it is often possible to search the data without having to decompress it, or at least only partially decompress it. The problem can be divided into lossless and lossy compre...
1. Abstract Complementarity problems arise in mathematical models of several applications in Engineering, Economy and different branches of Physics. We mention contact problems and dynamic of multiple body systems in Solid Mechanics. In this paper we present a new feasible directions interior-point algorithm for mixed nonlinear complementarity problems that we have called FDA-MNCP. This algorit...
In each iteration of the interior point method (IPM) at least one linear system has to be solved. The main computational effort of IPMs consists in the computation of these linear systems. Solving the corresponding linear systems with a direct method becomes very expensive for large scale problems. In this thesis, we have been concerned with using an iterative method for solving the reduced KKT...
Inexact Restoration methods have been proved to be effective to solve constrained optimization problems in which some structure of the feasible set induces a natural way of recovering feasibility from arbitrary infeasible points. Sometimes natural ways of dealing with minimization over tangent approximations of the feasible set are also employed. A recent paper [N. Banihashemi and C. Y. Kaya, I...
Simple examples for the failure of Newton's method with line search for strictly convex minimization
In this paper two simple examples of a twice continuously differentiable strictly convex function f are presented for which Newton’s method with line search converges to a point where the gradient of f is not zero. The first example uses a line search based on the Wolfe conditions. For the second example, some strictly convex function f is defined as well as a sequence of descent directions for...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید