|
|
|
|
|
 |
Search published articles |
 |
|
Showing 3 results for Ranjbar
Izadi, Ranjbarian, Ketabi, Nassiri-Mofakham,
Volume 4, Issue 1 (5-2013)
Abstract
Among various statistical and data mining discriminant analysis proposed so far for group classification, linear programming discriminant analysis has recently attracted the researchers’ interest. This study evaluates multi-group discriminant linear programming (MDLP) for classification problems against well-known methods such as neural networks and support vector machine. MDLP is less complicated as compared to other methods and does not suffer from having local optima. This study also proposes a fuzzy Delphi method to select and gather the required data, when databases suffer from deficient data. In addition, to absorb the uncertainty infused to collecting data, interval MDLP (IMDLP) is developed. The results show that the performance of MDLP and specially IMDLP is better than conventional classification methods with respect to correct classification, at least for small and medium-size datasets.
Msr. Raheleh Taghavi, Dr. Mohammad Ranjbar,
Volume 6, Issue 2 (9-2015)
Abstract
Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an increase in the probability of successful targeting of all incoming threats. We develop a heuristic method to obtain a very fast and acceptable solution for the problem. In addition, a branch and bound algorithm is developed to find the optimal solution. In order to increase the efficiency of this algorithm, a lower bound, an upper bound and a set of dominance rules have been developed. Using randomly generated test problems, the performance of the proposed solution approaches is analyzed. The results indicate that in all practical situations, the branch-and-bound algorithm is able to solve the problem optimally in less than a second.
Ali Ashrafi, Meysam Ranjbar,
Volume 16, Issue 1 (3-2025)
Abstract
In this paper, a modified hybrid three-term conjugate gradient (CG) method is proposed for solving unconstrained optimization problems. The search direction is a three-term hybrid form of the Hestenes-Stiefel (HS) and Liu–Storey (LS) CG parameters. It is established that the method ensures the sufficient descent property independent of line search techniques. The convergence analysis of the proposed method is carried out under standard assumptions for general functions. Numerical experiments on CUTEr problems and image denoising tasks demonstrate that our method outperforms existing approaches in terms of efficiency, accuracy, and robustness, particularly under high levels of salt-and-pepper noise.
|
|
|
|
|
|
|
|
|
