نتایج جستجو برای: inexact
تعداد نتایج: 2911 فیلتر نتایج به سال:
Exact and inexact methods can be used for solving Constraint Satisfaction Problems (CSP), i.e. for finding a variable assignment which violates none of the constraints or minimizes the number of violated constraints. Based on a Backtrack tree search, exact methods are able to produce an optimal assignment, when no time limit is imposed. Based on local improvement mechanisms, inexact methods can...
The problems studied are the separable variational inequalities with linearly coupling constraints. Some existing decomposition methods are very problem specific, and the computation load is quite costly. Combining the ideas of proximal point algorithm PPA and augmented Lagrangian method ALM , we propose an asymmetric proximal decomposition method AsPDM to solve a wide variety separable problem...
This paper considers a special class of convex programming (CP) problems whose feasible regions consist of a simple compact convex set intersected with an affine manifold. We present first-order methods for this class of problems based on an inexact version of the classical augmented Lagrangian (AL) approach, where the subproblems are approximately solved by means of Nesterov’s optimal method. ...
We present a new algorithm to solve the INEXACT CHARACTERISTIC STRING PROBLEM using Hamming distance instead of Levenshtein distance as a measure. We embed our new algorithm and the previously known algorithm for Levenshtein distance in a common framework which reveals an additional improvement to the Levenshtein distance algorithm. The INEXACT CHARACTERISTIC STRING PROBLEM can thus be solved i...
The efficiency of the implicit method proposed by He 1999 depends on the parameter β heavily; while it varies for individual problem, that is, different problem has different “suitable” parameter, which is difficult to find. In this paper, we present a modified implicit method, which adjusts the parameter β automatically per iteration, based on the message from former iterates. To improve the p...
We study the numerical behavior of stationary one-step or two-step matrix splitting iteration methods for solving large sparse systems of linear equations. We show that inexact solutions of inner linear systems associated with the matrix splittings may considerably influence the accuracy of the approximate solutions computed in finite precision arithmetic. For a general stationary matrix splitt...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید