Efficiency of Dynamic Computer Environment in Learning Absolute Value Equation
نویسندگان
چکیده
منابع مشابه
A note on unique solvability of the absolute value equation
It is proved that applying sufficient regularity conditions to the interval matrix $[A-|B|,A + |B|]$, we can create a new unique solvability condition for the absolute value equation $Ax + B|x|=b$, since regularity of interval matrices implies unique solvability of their corresponding absolute value equation. This condition is formulated in terms of positive deniteness of a certain point matrix...
متن کاملA uniform approximation method to solve absolute value equation
In this paper, we propose a parametric uniform approximation method to solve NP-hard absolute value equations. For this, we uniformly approximate absolute value in such a way that the nonsmooth absolute value equation can be formulated as a smooth nonlinear equation. By solving the parametric smooth nonlinear equation using Newton method, for a decreasing sequence of parameters, we can get the ...
متن کاملEvaluating Cost Efficiency in Fuzzy Environment by Using Expected Value
Today, one of the most fundamental issues within the field of industrial and nonindustrial activities is evaluate the costs performance of the units which are associated with industrial and nonindustrial activities. Data envelopment analysis (DEA) is a nonparametric method for evaluating performance. Fuzzy sets theory is a powerful tool for mentioning ambiguous situations. Traditional DEA model...
متن کاملAbsolute value equation solution via dual complementarity
By utilizing a dual complementarity condition, we propose an iterative method for solving the NPhard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving a succession of linear programs. The algorithm was tested on 500 consecutively generated random solvable instances of the AVE w...
متن کاملLinear complementarity as absolute value equation solution
We consider the linear complementarity problem (LCP): Mz + q ≥ 0, z ≥ 0, z′(Mz + q) = 0 as an absolute value equation (AVE): (M + I)z + q = |(M − I)z + q|, where M is an n× n square matrix and I is the identity matrix. We propose a concave minimization algorithm for solving (AVE) that consists of solving a few linear programs, typically two. The algorithm was tested on 500 consecutively generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12030473